Mathbox for Alexander van der Vekens < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  2rmoswap Structured version   Visualization version   GIF version

Theorem 2rmoswap 41505
 Description: A condition allowing swap of restricted "at most one" and restricted existential quantifiers, analogous to 2moswap 2576. (Contributed by Alexander van der Vekens, 25-Jun-2017.)
Assertion
Ref Expression
2rmoswap (∀𝑥𝐴 ∃*𝑦𝐵 𝜑 → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
Distinct variable groups:   𝑦,𝐴   𝑥,𝑦   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem 2rmoswap
StepHypRef Expression
1 df-rmo 2949 . . 3 (∃*𝑦𝐵 𝜑 ↔ ∃*𝑦(𝑦𝐵𝜑))
21ralbii 3009 . 2 (∀𝑥𝐴 ∃*𝑦𝐵 𝜑 ↔ ∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑))
3 df-ral 2946 . . . 4 (∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑) ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦(𝑦𝐵𝜑)))
4 moanimv 2560 . . . . 5 (∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ (𝑥𝐴 → ∃*𝑦(𝑦𝐵𝜑)))
54albii 1787 . . . 4 (∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦(𝑦𝐵𝜑)))
63, 5bitr4i 267 . . 3 (∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑) ↔ ∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
7 2moswap 2576 . . . 4 (∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) → (∃*𝑥𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) → ∃*𝑦𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑))))
8 df-rmo 2949 . . . . 5 (∃*𝑥𝐴𝑦𝐵 𝜑 ↔ ∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝜑))
9 r19.42v 3121 . . . . . . 7 (∃𝑦𝐵 (𝑥𝐴𝜑) ↔ (𝑥𝐴 ∧ ∃𝑦𝐵 𝜑))
10 df-rex 2947 . . . . . . . 8 (∃𝑦𝐵 (𝑥𝐴𝜑) ↔ ∃𝑦(𝑦𝐵 ∧ (𝑥𝐴𝜑)))
11 an12 855 . . . . . . . . 9 ((𝑦𝐵 ∧ (𝑥𝐴𝜑)) ↔ (𝑥𝐴 ∧ (𝑦𝐵𝜑)))
1211exbii 1814 . . . . . . . 8 (∃𝑦(𝑦𝐵 ∧ (𝑥𝐴𝜑)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
1310, 12bitri 264 . . . . . . 7 (∃𝑦𝐵 (𝑥𝐴𝜑) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
149, 13bitr3i 266 . . . . . 6 ((𝑥𝐴 ∧ ∃𝑦𝐵 𝜑) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
1514mobii 2521 . . . . 5 (∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝜑) ↔ ∃*𝑥𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
168, 15bitri 264 . . . 4 (∃*𝑥𝐴𝑦𝐵 𝜑 ↔ ∃*𝑥𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
17 df-rmo 2949 . . . . 5 (∃*𝑦𝐵𝑥𝐴 𝜑 ↔ ∃*𝑦(𝑦𝐵 ∧ ∃𝑥𝐴 𝜑))
18 r19.42v 3121 . . . . . . 7 (∃𝑥𝐴 (𝑦𝐵𝜑) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑))
19 df-rex 2947 . . . . . . 7 (∃𝑥𝐴 (𝑦𝐵𝜑) ↔ ∃𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
2018, 19bitr3i 266 . . . . . 6 ((𝑦𝐵 ∧ ∃𝑥𝐴 𝜑) ↔ ∃𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
2120mobii 2521 . . . . 5 (∃*𝑦(𝑦𝐵 ∧ ∃𝑥𝐴 𝜑) ↔ ∃*𝑦𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
2217, 21bitri 264 . . . 4 (∃*𝑦𝐵𝑥𝐴 𝜑 ↔ ∃*𝑦𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
237, 16, 223imtr4g 285 . . 3 (∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
246, 23sylbi 207 . 2 (∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑) → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
252, 24sylbi 207 1 (∀𝑥𝐴 ∃*𝑦𝐵 𝜑 → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383  ∀wal 1521  ∃wex 1744   ∈ wcel 2030  ∃*wmo 2499  ∀wral 2941  ∃wrex 2942  ∃*wrmo 2944 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-eu 2502  df-mo 2503  df-ral 2946  df-rex 2947  df-rmo 2949 This theorem is referenced by:  2reu1  41507
 Copyright terms: Public domain W3C validator