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

Theorem mof 31075
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 31071 . 2  |-  -.  E. x F.
2 exmo 2294 . 2  |-  ( E. x F.  \/  E* x F.  )
31, 2mtpor 1647 1  |-  E* x F.
Colors of variables: wff setvar class
Syntax hints:   F. wfal 1442   E.wex 1657   E*wmo 2270
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663
This theorem depends on definitions:  df-bi 188  df-or 371  df-tru 1440  df-fal 1443  df-ex 1658  df-mo 2274
This theorem is referenced by:  amosym1  31091
  Copyright terms: Public domain W3C validator