Theorem mofal 36769

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 36765	. 2 ⊢ ¬ ∃𝑥⊥
2		exmo 2569	. 2 ⊢ (∃𝑥⊥ ∨ ∃*𝑥⊥)
3	1, 2	mtpor 1790	1 ⊢ ∃*𝑥⊥

Syntax hints:  ⊥wfal 1572  ∃wex 1799  ∃*wmo 2564

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1563  df-fal 1573  df-ex 1800  df-mo 2566

This theorem is referenced by:  nrmo  36770  amosym1  36786