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

Theorem mof 26160
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 26156 . 2  |-  -.  E. x  F.
2 exmo 2326 . 2  |-  ( E. x  F.  \/  E* x  F.  )
31, 2mtp-or 1547 1  |-  E* x  F.
Colors of variables: wff set class
Syntax hints:    F. wfal 1326   E.wex 1550   E*wmo 2282
This theorem is referenced by:  amosym1  26176
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555
This theorem depends on definitions:  df-bi 178  df-or 360  df-tru 1328  df-fal 1329  df-ex 1551  df-mo 2286
  Copyright terms: Public domain W3C validator