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

Theorem exmoeu 1406
Description: Existence in terms of "at most one" and uniqueness.
Assertion
Ref Expression
exmoeu |- (E.xph <-> (E*xph -> E!xph))

Proof of Theorem exmoeu
StepHypRef Expression
1 df-mo 1376 . . . 4 |- (E*xph <-> (E.xph -> E!xph))
21biimp 151 . . 3 |- (E*xph -> (E.xph -> E!xph))
32com12 11 . 2 |- (E.xph -> (E*xph -> E!xph))
41biimpr 152 . . . 4 |- ((E.xph -> E!xph) -> E*xph)
5 euex 1387 . . . 4 |- (E!xph -> E.xph)
64, 5imim12i 18 . . 3 |- ((E*xph -> E!xph) -> ((E.xph -> E!xph) -> E.xph))
7 peirce 82 . . 3 |- (((E.xph -> E!xph) -> E.xph) -> E.xph)
86, 7syl 10 . 2 |- ((E*xph -> E!xph) -> E.xph)
93, 8impbi 157 1 |- (E.xph <-> (E*xph -> E!xph))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  E.wex 977  E!weu 1373  E*wmo 1374
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376
Copyright terms: Public domain