Users' Mathboxes Mathbox for Anthony Hart < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mof Unicode version

Theorem mof 24849
Description: There exist at most one set, such that  F. is true. (Contributed by Anthony Hart, 13-Sep-2011.)
Assertion
Ref Expression
mof  |-  E* x  F.

Proof of Theorem mof
StepHypRef Expression
1 nextf 24845 . 2  |-  -.  E. x  F.
2 exmo 2188 . . 3  |-  ( E. x  F.  \/  E* x  F.  )
32ori 364 . 2  |-  ( -. 
E. x  F.  ->  E* x  F.  )
41, 3ax-mp 8 1  |-  E* x  F.
Colors of variables: wff set class
Syntax hints:   -. wn 3    F. wfal 1308   E.wex 1528   E*wmo 2144
This theorem is referenced by:  amosym1  24865
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533
This theorem depends on definitions:  df-bi 177  df-or 359  df-tru 1310  df-fal 1311  df-ex 1529  df-mo 2148
  Copyright terms: Public domain W3C validator