ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  hbmo Unicode version

Theorem hbmo 2065
Description: Bound-variable hypothesis builder for "at most one". (Contributed by NM, 9-Mar-1995.)
Hypothesis
Ref Expression
hbmo.1  |-  ( ph  ->  A. x ph )
Assertion
Ref Expression
hbmo  |-  ( E* y ph  ->  A. x E* y ph )

Proof of Theorem hbmo
StepHypRef Expression
1 df-mo 2030 . 2  |-  ( E* y ph  <->  ( E. y ph  ->  E! y ph ) )
2 hbmo.1 . . . 4  |-  ( ph  ->  A. x ph )
32hbex 1636 . . 3  |-  ( E. y ph  ->  A. x E. y ph )
42hbeu 2047 . . 3  |-  ( E! y ph  ->  A. x E! y ph )
53, 4hbim 1545 . 2  |-  ( ( E. y ph  ->  E! y ph )  ->  A. x ( E. y ph  ->  E! y ph ) )
61, 5hbxfrbi 1472 1  |-  ( E* y ph  ->  A. x E* y ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1351   E.wex 1492   E!weu 2026   E*wmo 2027
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030
This theorem is referenced by:  moexexdc  2110  2moex  2112  2euex  2113  2exeu  2118
  Copyright terms: Public domain W3C validator