MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2euswap Structured version   Visualization version   GIF version

Theorem 2euswap 2535
Description: A condition allowing swap of uniqueness and existential quantifiers. (Contributed by NM, 10-Apr-2004.)
Assertion
Ref Expression
2euswap (∀𝑥∃*𝑦𝜑 → (∃!𝑥𝑦𝜑 → ∃!𝑦𝑥𝜑))

Proof of Theorem 2euswap
StepHypRef Expression
1 excomim 2029 . . . 4 (∃𝑥𝑦𝜑 → ∃𝑦𝑥𝜑)
21a1i 11 . . 3 (∀𝑥∃*𝑦𝜑 → (∃𝑥𝑦𝜑 → ∃𝑦𝑥𝜑))
3 2moswap 2534 . . 3 (∀𝑥∃*𝑦𝜑 → (∃*𝑥𝑦𝜑 → ∃*𝑦𝑥𝜑))
42, 3anim12d 583 . 2 (∀𝑥∃*𝑦𝜑 → ((∃𝑥𝑦𝜑 ∧ ∃*𝑥𝑦𝜑) → (∃𝑦𝑥𝜑 ∧ ∃*𝑦𝑥𝜑)))
5 eu5 2483 . 2 (∃!𝑥𝑦𝜑 ↔ (∃𝑥𝑦𝜑 ∧ ∃*𝑥𝑦𝜑))
6 eu5 2483 . 2 (∃!𝑦𝑥𝜑 ↔ (∃𝑦𝑥𝜑 ∧ ∃*𝑦𝑥𝜑))
74, 5, 63imtr4g 283 1 (∀𝑥∃*𝑦𝜑 → (∃!𝑥𝑦𝜑 → ∃!𝑦𝑥𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382  wal 1472  wex 1694  ∃!weu 2457  ∃*wmo 2458
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-tru 1477  df-ex 1695  df-nf 1700  df-eu 2461  df-mo 2462
This theorem is referenced by:  2eu1  2540  euxfr2  3357  2reuswap  3376  2reuswap2  28505
  Copyright terms: Public domain W3C validator