Theorem mofal 35597

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

Step	Hyp	Ref	Expression
1		nexfal 35593	. 2 ⊢ ¬ ∃𝑥⊥
2		exmo 2534	. 2 ⊢ (∃𝑥⊥ ∨ ∃*𝑥⊥)
3	1, 2	mtpor 1770	1 ⊢ ∃*𝑥⊥

Syntax hints:  ⊥wfal 1551  ∃wex 1779  ∃*wmo 2530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969

This theorem depends on definitions:  df-bi 206  df-or 844  df-tru 1542  df-fal 1552  df-ex 1780  df-mo 2532

This theorem is referenced by:  nrmo  35598  amosym1  35614