 Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  axnul Structured version   Visualization version   GIF version

Theorem axnul 4716
 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 4709. 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 zfnuleu 4714). This proof, suggested by Jeff Hoffman, uses only ax-4 1728 and ax-gen 1713 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 4709 implies the existence of at least one set. Note that Kunen's version of ax-sep 4709 (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 4715 for a proof directly from ax-rep 4699. This theorem should not be referenced by any proof. Instead, use ax-nul 4717 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.
StepHypRef Expression
1 ax-sep 4709 . 2 𝑥𝑦(𝑦𝑥 ↔ (𝑦𝑧 ∧ ⊥))
2 fal 1482 . . . . 5 ¬ ⊥
32intnan 951 . . . 4 ¬ (𝑦𝑧 ∧ ⊥)
4 id 22 . . . 4 ((𝑦𝑥 ↔ (𝑦𝑧 ∧ ⊥)) → (𝑦𝑥 ↔ (𝑦𝑧 ∧ ⊥)))
53, 4mtbiri 316 . . 3 ((𝑦𝑥 ↔ (𝑦𝑧 ∧ ⊥)) → ¬ 𝑦𝑥)
65alimi 1730 . 2 (∀𝑦(𝑦𝑥 ↔ (𝑦𝑧 ∧ ⊥)) → ∀𝑦 ¬ 𝑦𝑥)
71, 6eximii 1754 1 𝑥𝑦 ¬ 𝑦𝑥
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 195   ∧ wa 383  ∀wal 1473  ⊥wfal 1480  ∃wex 1695 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-sep 4709 This theorem depends on definitions:  df-bi 196  df-an 385  df-tru 1478  df-fal 1481  df-ex 1696 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator