Theorem axnul 5258

Description: The Null Set Axiom of ZF set theory: there exists a set with no elements. Axiom of Empty Set of [Enderton] p. 18. In some textbooks, this is presented as a separate axiom; here we show it can be derived from Separation ax-sep 5248. This version of the Null Set Axiom tells us that at least one empty set exists, but does not tell us that it is unique - we need the Axiom of Extensionality to do that (see nulmo 2737).

This proof, suggested by Jeff Hoffman, uses only ax-4 1841 and ax-gen 1827 from predicate calculus, which are valid in "free logic" i.e. logic holding in an empty domain (see Axiom A5 and Rule R2 of [LeBlanc] p. 277). Thus, our ax-sep 5248 implies the existence of at least one set. Note that Kunen's version of ax-sep 5248 (Axiom 3 of [Kunen] p. 11) does not imply the existence of a set because his is universally closed, i.e., prefixed with universal quantifiers to eliminate all free variables. His existence is provided by a separate axiom stating ∃𝑥𝑥 = 𝑥 (Axiom 0 of [Kunen] p. 10).

See axnulALT 5257 for a proof directly from ax-rep 5231.

This theorem should not be referenced by any proof. Instead, use ax-nul 5259 below so that the uses of the Null Set Axiom can be more easily identified. (Contributed by Jeff Hoffman, 3-Feb-2008.) (Revised by NM, 4-Feb-2008.) (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

Ref	Expression
axnul	⊢ ∃𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥

Distinct variable group:   𝑥,𝑦

Proof of Theorem axnul

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-sep 5248	. 2 ⊢ ∃𝑥∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝑧 ∧ ⊥))
2		fal 1583	. . . . 5 ⊢ ¬ ⊥
3	2	intnan 492	. . . 4 ⊢ ¬ (𝑦 ∈ 𝑧 ∧ ⊥)
4		id 23	. . . 4 ⊢ ((𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝑧 ∧ ⊥)) → (𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝑧 ∧ ⊥)))
5	3, 4	mtbiri 330	. . 3 ⊢ ((𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝑧 ∧ ⊥)) → ¬ 𝑦 ∈ 𝑥)
6	5	alimi 1843	. 2 ⊢ (∀𝑦(𝑦 ∈ 𝑥 ↔ (𝑦 ∈ 𝑧 ∧ ⊥)) → ∀𝑦 ¬ 𝑦 ∈ 𝑥)
7	1, 6	eximii 1869	1 ⊢ ∃𝑥∀𝑦 ¬ 𝑦 ∈ 𝑥

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401  ∀wal 1567  ⊥wfal 1581  ∃wex 1811

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-sep 5248

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812

This theorem is used by: (None)