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

Theorem 2eu1 1426
Description: Double existential uniqueness. This theorem shows a condition under which a "naive" definition matches the correct one.
Assertion
Ref Expression
2eu1 |- (A.xE*yph -> (E!xE!yph <-> (E!xE.yph /\ E!yE.xph)))

Proof of Theorem 2eu1
StepHypRef Expression
1 eu5 1386 . . . . . . . 8 |- (E!xE!yph <-> (E.xE!yph /\ E*xE!yph))
2 eu5 1386 . . . . . . . . . 10 |- (E!yph <-> (E.yph /\ E*yph))
32exbii 1027 . . . . . . . . 9 |- (E.xE!yph <-> E.x(E.yph /\ E*yph))
42mobii 1382 . . . . . . . . 9 |- (E*xE!yph <-> E*x(E.yph /\ E*yph))
53, 4anbi12i 481 . . . . . . . 8 |- ((E.xE!yph /\ E*xE!yph) <-> (E.x(E.yph /\ E*yph) /\ E*x(E.yph /\ E*yph)))
61, 5bitr 173 . . . . . . 7 |- (E!xE!yph <-> (E.x(E.yph /\ E*yph) /\ E*x(E.yph /\ E*yph)))
76pm3.27bi 326 . . . . . 6 |- (E!xE!yph -> E*x(E.yph /\ E*yph))
8 ax-4 951 . . . . . . . . . . . 12 |- (A.xE*yph -> E*yph)
98anim2i 335 . . . . . . . . . . 11 |- ((E.yph /\ A.xE*yph) -> (E.yph /\ E*yph))
109ancoms 436 . . . . . . . . . 10 |- ((A.xE*yph /\ E.yph) -> (E.yph /\ E*yph))
1110immoi 1395 . . . . . . . . 9 |- (E*x(E.yph /\ E*yph) -> E*x(A.xE*yph /\ E.yph))
12 hba1 979 . . . . . . . . . 10 |- (A.xE*yph -> A.xA.xE*yph)
1312moanim 1404 . . . . . . . . 9 |- (E*x(A.xE*yph /\ E.yph) <-> (A.xE*yph -> E*xE.yph))
1411, 13sylib 198 . . . . . . . 8 |- (E*x(E.yph /\ E*yph) -> (A.xE*yph -> E*xE.yph))
1514ancrd 299 . . . . . . 7 |- (E*x(E.yph /\ E*yph) -> (A.xE*yph -> (E*xE.yph /\ A.xE*yph)))
16 2moswap 1421 . . . . . . . . 9 |- (A.xE*yph -> (E*xE.yph -> E*yE.xph))
1716com12 11 . . . . . . . 8 |- (E*xE.yph -> (A.xE*yph -> E*yE.xph))
1817imdistani 443 . . . . . . 7 |- ((E*xE.yph /\ A.xE*yph) -> (E*xE.yph /\ E*yE.xph))
1915, 18syl6 22 . . . . . 6 |- (E*x(E.yph /\ E*yph) -> (A.xE*yph -> (E*xE.yph /\ E*yE.xph)))
207, 19syl 10 . . . . 5 |- (E!xE!yph -> (A.xE*yph -> (E*xE.yph /\ E*yE.xph)))
21 2eu2ex 1420 . . . . . 6 |- (E!xE!yph -> E.xE.yph)
22 excom 1022 . . . . . . 7 |- (E.xE.yph <-> E.yE.xph)
2321, 22sylib 198 . . . . . 6 |- (E!xE!yph -> E.yE.xph)
2421, 23jca 288 . . . . 5 |- (E!xE!yph -> (E.xE.yph /\ E.yE.xph))
2520, 24jctild 599 . . . 4 |- (E!xE!yph -> (A.xE*yph -> ((E.xE.yph /\ E.yE.xph) /\ (E*xE.yph /\ E*yE.xph))))
26 eu5 1386 . . . . . 6 |- (E!xE.yph <-> (E.xE.yph /\ E*xE.yph))
27 eu5 1386 . . . . . 6 |- (E!yE.xph <-> (E.yE.xph /\ E*yE.xph))
2826, 27anbi12i 481 . . . . 5 |- ((E!xE.yph /\ E!yE.xph) <-> ((E.xE.yph /\ E*xE.yph) /\ (E.yE.xph /\ E*yE.xph)))
29 an4 505 . . . . 5 |- (((E.xE.yph /\ E*xE.yph) /\ (E.yE.xph /\ E*yE.xph)) <-> ((E.xE.yph /\ E.yE.xph) /\ (E*xE.yph /\ E*yE.xph)))
3028, 29bitr 173 . . . 4 |- ((E!xE.yph /\ E!yE.xph) <-> ((E.xE.yph /\ E.yE.xph) /\ (E*xE.yph /\ E*yE.xph)))
3125, 30syl6ibr 213 . . 3 |- (E!xE!yph -> (A.xE*yph -> (E!xE.yph /\ E!yE.xph)))
3231com12 11 . 2 |- (A.xE*yph -> (E!xE!yph -> (E!xE.yph /\ E!yE.xph)))
33 2exeu 1423 . 2 |- ((E!xE.yph /\ E!yE.xph) -> E!xE!yph)
3432, 33impbid1 515 1 |- (A.xE*yph -> (E!xE!yph <-> (E!xE.yph /\ E!yE.xph)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 950  E.wex 956  E!weu 1357  E*wmo 1358
This theorem is referenced by:  2eu2 1427  2eu3 1428  2eu5 1430
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-11 1180  ax-17 1190  ax-16 1194  ax-11o 1202
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 957  df-sb 1155  df-eu 1359  df-mo 1360
Copyright terms: Public domain