Theorem mofal 36920

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

Syntax hints:  ⊥wfal 1582  ∃wex 1809  ∃*wmo 2565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1573  df-fal 1583  df-ex 1810  df-mo 2567

This theorem is referenced by:  nrmo  36921  amosym1  36937