HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem axnul 2764
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 2758. This version of the Null Set Axiom tells us that at least one empty set exists, but does not tells us that it is unique - we need the Axiom of Extensionality to do that (see zfnuleu 2762).

This proof, suggested by Jeff Hoffman (3-Feb-2008), does not require the set existence axiom ax-9 1006, unlike some empty set existence proofs (such as the remark in [Kunen] p. 11). However, it uses ax-4 1014, which also presupposes the existence of at least one set, i.e it does not hold in a "free logic" valid in empty domains. Theorem ax4 1013, which shows the redundancy of ax-4 1014, depends on ax-9 1006 for its proof. See axnul2 2763 for a similar proof directly from ax-rep 2748.

This theorem should not be referenced by any proof. Instead, use ax-nul 2765 below so that the uses of the Null Set Axiom can be more easily identified.

Assertion
Ref Expression
axnul |- E.xA.y -. y e. x
Distinct variable group:   x,y

Proof of Theorem axnul
StepHypRef Expression
1 ax-sep 2758 . 2 |- E.xA.y(y e. x <-> (y e. z /\ (y e. y /\ -. y e. y)))
2 pm3.24 669 . . . . . 6 |- -. (y e. y /\ -. y e. y)
32intnan 703 . . . . 5 |- -. (y e. z /\ (y e. y /\ -. y e. y))
4 id 59 . . . . 5 |- ((y e. x <-> (y e. z /\ (y e. y /\ -. y e. y))) -> (y e. x <-> (y e. z /\ (y e. y /\ -. y e. y))))
53, 4mtbiri 729 . . . 4 |- ((y e. x <-> (y e. z /\ (y e. y /\ -. y e. y))) -> -. y e. x)
6519.20i 1033 . . 3 |- (A.y(y e. x <-> (y e. z /\ (y e. y /\ -. y e. y))) -> A.y -. y e. x)
7619.22i 1081 . 2 |- (E.xA.y(y e. x <-> (y e. z /\ (y e. y /\ -. y e. y))) -> E.xA.y -. y e. x)
81, 7ax-mp 7 1 |- E.xA.y -. y e. x
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 153   /\ wa 230  A.wal 995   e. wcel 999  E.wex 1021
This theorem is referenced by:  snex 2806
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 1004  ax-4 1014  ax-5o 1016  ax-sep 2758
This theorem depends on definitions:  df-bi 154  df-or 231  df-an 232  df-ex 1022
Copyright terms: Public domain