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

Theorem 2euex 1844
Description: Double quantification with existential uniqueness. (The proof was shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
2euex |- (E!xE.yph -> E.yE!xph)

Proof of Theorem 2euex
StepHypRef Expression
1 eu5 1805 . 2 |- (E!xE.yph <-> (E.xE.yph /\ E*xE.yph))
2 hbe1 1363 . . . . . 6 |- (E.yph -> A.yE.yph)
32hbmo 1803 . . . . 5 |- (E*xE.yph -> A.yE*xE.yph)
4 19.8a 1376 . . . . . . 7 |- (ph -> E.yph)
54immoi 1814 . . . . . 6 |- (E*xE.yph -> E*xph)
6 df-mo 1776 . . . . . 6 |- (E*xph <-> (E.xph -> E!xph))
75, 6sylib 215 . . . . 5 |- (E*xE.yph -> (E.xph -> E!xph))
83, 7eximd 1410 . . . 4 |- (E*xE.yph -> (E.yE.xph -> E.yE!xph))
9 excom 1393 . . . 4 |- (E.xE.yph <-> E.yE.xph)
108, 9syl5ib 223 . . 3 |- (E*xE.yph -> (E.xE.yph -> E.yE!xph))
1110impcom 378 . 2 |- ((E.xE.yph /\ E*xE.yph) -> E.yE!xph)
121, 11sylbi 216 1 |- (E!xE.yph -> E.yE!xph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240  E.wex 1326  E!weu 1771  E*wmo 1772
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776
Copyright terms: Public domain