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

Theorem mofal 37197
Description: There exist at most one set such that ⊥ is true. (Contributed by Anthony Hart, 13-Sep-2011.)
Assertion
Ref Expression
mofal ∃*𝑥⊥

Proof of Theorem mofal
StepHypRef Expression
1 nexfal 37193 . 2 ¬ ∃𝑥⊥
2 exmo 2568 . 2 (∃𝑥⊥ ∨ ∃*𝑥⊥)
31, 2mtpor 1803 1 ∃*𝑥⊥
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ⊥wfal 1582  ∃wex 1812  ∃*wmo 2563
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-mo 2565
This theorem is used by:  nrmo  37198  amosym1  37214
  Copyright terms: Public domain W3C validator