HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem 2euswap 1065
Description: A condition allowing swap of uniqueness and existential quantifiers.
Assertion
Ref Expression
2euswap (∀x∃*yφ → (∃!xyφ → ∃!yxφ))

Proof of Theorem 2euswap
StepHypRef Expression
1 excomim 727 . . . 4 (∃xyφ → ∃yxφ)
21a1i 7 . . 3 (∀x∃*yφ → (∃xyφ → ∃yxφ))
3 2moswap 1064 . . 3 (∀x∃*yφ → (∃*xyφ → ∃*yxφ))
42, 3anim12d 431 . 2 (∀x∃*yφ → ((∃xyφ ∧ ∃*xyφ) → (∃yxφ ∧ ∃*yxφ)))
5 eu5 1035 . 2 (∃!xyφ ↔ (∃xyφ ∧ ∃*xyφ))
6 eu5 1035 . 2 (∃!yxφ ↔ (∃yxφ ∧ ∃*yxφ))
74, 5, 63imtr4g 426 1 (∀x∃*yφ → (∃!xyφ → ∃!yxφ))
Colors of variables: wff set class
Syntax hints:   → wi 2   ∧ wa 196  ∀wal 672  ∃wex 678  ∃!weu 1007  ∃*wmo 1008
This theorem is referenced by:  2reuswap 1341  euxfr2 1435
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010
metamath.org