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

Theorem neutru 37195
Description: There does not exist exactly one set such that ⊤ is true. (Contributed by Anthony Hart, 13-Sep-2011.)
Assertion
Ref Expression
neutru ¬ ∃!𝑥⊤

Proof of Theorem neutru
StepHypRef Expression
1 nexntru 37192 . 2 ¬ ∃𝑥 ¬ ⊤
2 eunex 5352 . 2 (∃!𝑥⊤ → ∃𝑥 ¬ ⊤)
31, 2mto 200 1 ¬ ∃!𝑥⊤
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  ⊤wtru 1571  ∃wex 1812  ∃!weu 2594
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-nul 5260  ax-pow 5327
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2565  df-eu 2595
This theorem is used by:  nmotru  37196
  Copyright terms: Public domain W3C validator