Theorem nulmo 2718

Description: There exists at most one empty set. With either axnul 5230 or axnulALT 5229 or ax-nul 5231, this proves that there exists a unique empty set. In practice, once the language of classes is available, we use the stronger characterization among classes eq0 4281. (Contributed by NM, 22-Dec-2007.) Use the at-most-one quantifier. (Revised by BJ, 17-Sep-2022.) (Proof shortened by Wolf Lammen, 26-Apr-2023.)

Assertion

Ref	Expression
nulmo	⊢ ∃*𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥

Distinct variable group:   𝑥,𝑦

Proof of Theorem nulmo

Step	Hyp	Ref	Expression
1		nfv 1922	. . 3 ⊢ Ⅎ𝑥⊥
2	1	axextmo 2717	. 2 ⊢ ∃*𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ ⊥)
3		nbfal 1563	. . . 4 ⊢ (¬ 𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝑥 ↔ ⊥))
4	3	albii 1827	. . 3 ⊢ (∀𝑦 ¬ 𝑦 ∈ 𝑥 ↔ ∀𝑦(𝑦 ∈ 𝑥 ↔ ⊥))
5	4	mobii 2554	. 2 ⊢ (∃*𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥 ↔ ∃*𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ ⊥))
6	2, 5	mpbir 233	1 ⊢ ∃*𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥

Syntax hints:  ¬ wn 3   ↔ wb 208  ∀wal 1546  ⊥wfal 1560  ∃*wmo 2543

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545

This theorem is referenced by:  eu0  43979