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

Theorem 2eu1 1492
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 1451 . . . . . . . 8 |- (E!xE!yph <-> (E.xE!yph /\ E*xE!yph))
2 eu5 1451 . . . . . . . . . 10 |- (E!yph <-> (E.yph /\ E*yph))
32exbii 1092 . . . . . . . . 9 |- (E.xE!yph <-> E.x(E.yph /\ E*yph))
42mobii 1447 . . . . . . . . 9 |- (E*xE!yph <-> E*x(E.yph /\ E*yph))
53, 4anbi12i 493 . . . . . . . 8 |- ((E.xE!yph /\ E*xE!yph) <-> (E.x(E.yph /\ E*yph) /\ E*x(E.yph /\ E*yph)))
61, 5bitri 180 . . . . . . 7 |- (E!xE!yph <-> (E.x(E.yph /\ E*yph) /\ E*x(E.yph /\ E*yph)))
76pm3.27bi 333 . . . . . 6 |- (E!xE!yph -> E*x(E.yph /\ E*yph))
8 ax-4 1014 . . . . . . . . . . . 12 |- (A.xE*yph -> E*yph)
98anim2i 342 . . . . . . . . . . 11 |- ((E.yph /\ A.xE*yph) -> (E.yph /\ E*yph))
109ancoms 447 . . . . . . . . . 10 |- ((A.xE*yph /\ E.yph) -> (E.yph /\ E*yph))
1110immoi 1460 . . . . . . . . 9 |- (E*x(E.yph /\ E*yph) -> E*x(A.xE*yph /\ E.yph))
12 hba1 1044 . . . . . . . . . 10 |- (A.xE*yph -> A.xA.xE*yph)
1312moanim 1469 . . . . . . . . 9 |- (E*x(A.xE*yph /\ E.yph) <-> (A.xE*yph -> E*xE.yph))
1411, 13sylib 205 . . . . . . . 8 |- (E*x(E.yph /\ E*yph) -> (A.xE*yph -> E*xE.yph))
1514ancrd 306 . . . . . . 7 |- (E*x(E.yph /\ E*yph) -> (A.xE*yph -> (E*xE.yph /\ A.xE*yph)))
16 2moswap 1487 . . . . . . . . 9 |- (A.xE*yph -> (E*xE.yph -> E*yE.xph))
1716com12 11 . . . . . . . 8 |- (E*xE.yph -> (A.xE*yph -> E*yE.xph))
1817imdistani 454 . . . . . . 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 1486 . . . . . 6 |- (E!xE!yph -> E.xE.yph)
22 excom 1087 . . . . . . 7 |- (E.xE.yph <-> E.yE.xph)
2321, 22sylib 205 . . . . . 6 |- (E!xE!yph -> E.yE.xph)
2421, 23jca 295 . . . . 5 |- (E!xE!yph -> (E.xE.yph /\ E.yE.xph))
2520, 24jctild 612 . . . 4 |- (E!xE!yph -> (A.xE*yph -> ((E.xE.yph /\ E.yE.xph) /\ (E*xE.yph /\ E*yE.xph))))
26 eu5 1451 . . . . . 6 |- (E!xE.yph <-> (E.xE.yph /\ E*xE.yph))
27 eu5 1451 . . . . . 6 |- (E!yE.xph <-> (E.yE.xph /\ E*yE.xph))
2826, 27anbi12i 493 . . . . 5 |- ((E!xE.yph /\ E!yE.xph) <-> ((E.xE.yph /\ E*xE.yph) /\ (E.yE.xph /\ E*yE.xph)))
29 an4 517 . . . . 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, 29bitri 180 . . . 4 |- ((E!xE.yph /\ E!yE.xph) <-> ((E.xE.yph /\ E.yE.xph) /\ (E*xE.yph /\ E*yE.xph)))
3125, 30syl6ibr 220 . . 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 1489 . 2 |- ((E!xE.yph /\ E!yE.xph) -> E!xE!yph)
3432, 33impbid1 528 1 |- (A.xE*yph -> (E!xE!yph <-> (E!xE.yph /\ E!yE.xph)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 153   /\ wa 230  A.wal 995  E.wex 1021  E!weu 1422  E*wmo 1423
This theorem is referenced by:  2eu2 1493  2eu3 1494  2eu5 1496
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1003  ax-gen 1004  ax-8 1005  ax-10 1007  ax-11 1008  ax-12 1009  ax-17 1012  ax-4 1014  ax-5o 1016  ax-6o 1019  ax-9o 1164  ax-10o 1182  ax-16 1252  ax-11o 1260
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-ex 1022  df-sb 1214  df-eu 1424  df-mo 1425
Copyright terms: Public domain