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

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

Proof of Theorem mont
StepHypRef Expression
1 extt 31064 . . 3  |-  E. x T.
2 unnt 31068 . . 3  |-  -.  E! x T.
3 mth8 150 . . 3  |-  ( E. x T.  ->  ( -.  E! x T.  ->  -.  ( E. x T. 
->  E! x T.  ) ) )
41, 2, 3mp2 9 . 2  |-  -.  ( E. x T.  ->  E! x T.  )
5 df-mo 2304 . 2  |-  ( E* x T.  <->  ( E. x T.  ->  E! x T.  ) )
64, 5mtbir 301 1  |-  -.  E* x T.
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4   T. wtru 1445   E.wex 1663   E!weu 2299   E*wmo 2300
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1669  ax-4 1682  ax-5 1758  ax-6 1805  ax-7 1851  ax-8 1889  ax-9 1896  ax-10 1915  ax-11 1920  ax-12 1933  ax-13 2091  ax-nul 4534  ax-pow 4581
This theorem depends on definitions:  df-bi 189  df-an 373  df-tru 1447  df-ex 1664  df-nf 1668  df-eu 2303  df-mo 2304
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator