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

Theorem 2euswap 1445
Description: A condition allowing swap of uniqueness and existential quantifiers.
Assertion
Ref Expression
2euswap |- (A.xE*yph -> (E!xE.yph -> E!yE.xph))

Proof of Theorem 2euswap
StepHypRef Expression
1 excomim 1045 . . . 4 |- (E.xE.yph -> E.yE.xph)
21a1i 8 . . 3 |- (A.xE*yph -> (E.xE.yph -> E.yE.xph))
3 2moswap 1444 . . 3 |- (A.xE*yph -> (E*xE.yph -> E*yE.xph))
42, 3anim12d 558 . 2 |- (A.xE*yph -> ((E.xE.yph /\ E*xE.yph) -> (E.yE.xph /\ E*yE.xph)))
5 eu5 1409 . 2 |- (E!xE.yph <-> (E.xE.yph /\ E*xE.yph))
6 eu5 1409 . 2 |- (E!yE.xph <-> (E.yE.xph /\ E*yE.xph))
74, 5, 63imtr4g 553 1 |- (A.xE*yph -> (E!xE.yph -> E!yE.xph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223  A.wal 954  E.wex 980  E!weu 1380  E*wmo 1381
This theorem is referenced by:  euxfr2 1926  2reuswap 1937
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383
Copyright terms: Public domain