Users' Mathboxes 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 41879
Description: A condition allowing swap of restricted "at most one" and restricted existential quantifiers, analogous to 2moswap 2669. (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 3063 . . 3 (∃*𝑦𝐵 𝜑 ↔ ∃*𝑦(𝑦𝐵𝜑))
21ralbii 3127 . 2 (∀𝑥𝐴 ∃*𝑦𝐵 𝜑 ↔ ∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑))
3 df-ral 3060 . . . 4 (∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑) ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦(𝑦𝐵𝜑)))
4 moanimv 2653 . . . . 5 (∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ (𝑥𝐴 → ∃*𝑦(𝑦𝐵𝜑)))
54albii 1914 . . . 4 (∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) ↔ ∀𝑥(𝑥𝐴 → ∃*𝑦(𝑦𝐵𝜑)))
63, 5bitr4i 269 . . 3 (∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑) ↔ ∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
7 2moswap 2669 . . . 4 (∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) → (∃*𝑥𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) → ∃*𝑦𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑))))
8 df-rmo 3063 . . . . 5 (∃*𝑥𝐴𝑦𝐵 𝜑 ↔ ∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝜑))
9 r19.42v 3239 . . . . . . 7 (∃𝑦𝐵 (𝑥𝐴𝜑) ↔ (𝑥𝐴 ∧ ∃𝑦𝐵 𝜑))
10 df-rex 3061 . . . . . . . 8 (∃𝑦𝐵 (𝑥𝐴𝜑) ↔ ∃𝑦(𝑦𝐵 ∧ (𝑥𝐴𝜑)))
11 an12 635 . . . . . . . . 9 ((𝑦𝐵 ∧ (𝑥𝐴𝜑)) ↔ (𝑥𝐴 ∧ (𝑦𝐵𝜑)))
1211exbii 1943 . . . . . . . 8 (∃𝑦(𝑦𝐵 ∧ (𝑥𝐴𝜑)) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
1310, 12bitri 266 . . . . . . 7 (∃𝑦𝐵 (𝑥𝐴𝜑) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
149, 13bitr3i 268 . . . . . 6 ((𝑥𝐴 ∧ ∃𝑦𝐵 𝜑) ↔ ∃𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
1514mobii 2568 . . . . 5 (∃*𝑥(𝑥𝐴 ∧ ∃𝑦𝐵 𝜑) ↔ ∃*𝑥𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
168, 15bitri 266 . . . 4 (∃*𝑥𝐴𝑦𝐵 𝜑 ↔ ∃*𝑥𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
17 df-rmo 3063 . . . . 5 (∃*𝑦𝐵𝑥𝐴 𝜑 ↔ ∃*𝑦(𝑦𝐵 ∧ ∃𝑥𝐴 𝜑))
18 r19.42v 3239 . . . . . . 7 (∃𝑥𝐴 (𝑦𝐵𝜑) ↔ (𝑦𝐵 ∧ ∃𝑥𝐴 𝜑))
19 df-rex 3061 . . . . . . 7 (∃𝑥𝐴 (𝑦𝐵𝜑) ↔ ∃𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
2018, 19bitr3i 268 . . . . . 6 ((𝑦𝐵 ∧ ∃𝑥𝐴 𝜑) ↔ ∃𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
2120mobii 2568 . . . . 5 (∃*𝑦(𝑦𝐵 ∧ ∃𝑥𝐴 𝜑) ↔ ∃*𝑦𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
2217, 21bitri 266 . . . 4 (∃*𝑦𝐵𝑥𝐴 𝜑 ↔ ∃*𝑦𝑥(𝑥𝐴 ∧ (𝑦𝐵𝜑)))
237, 16, 223imtr4g 287 . . 3 (∀𝑥∃*𝑦(𝑥𝐴 ∧ (𝑦𝐵𝜑)) → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
246, 23sylbi 208 . 2 (∀𝑥𝐴 ∃*𝑦(𝑦𝐵𝜑) → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
252, 24sylbi 208 1 (∀𝑥𝐴 ∃*𝑦𝐵 𝜑 → (∃*𝑥𝐴𝑦𝐵 𝜑 → ∃*𝑦𝐵𝑥𝐴 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wal 1650  wex 1874  wcel 2155  ∃*wmo 2563  wral 3055  wrex 3056  ∃*wrmo 3058
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-tru 1656  df-ex 1875  df-nf 1879  df-mo 2565  df-ral 3060  df-rex 3061  df-rmo 3063
This theorem is referenced by:  2reu1  41881
  Copyright terms: Public domain W3C validator