The union of a set n with a set containing the set n is denoted by: n∪{n}={n,{n}}
If we abbreviate this particular union operation using the prime symbol, we get the notation: n′=n∪{n}={n,{n}}
If n=∅ then
n′=∅′=∅∪{∅}={∅,{∅}}
By applying the axiom of pairing, ∀x∀y∃z(x∈z∧y∈z), we see that a set {n} is a valid set, because the axiom of pairing states that if x and y are sets then there is a set, z, that contains them as its elements.
then there exists a set X such that the empty set is a member of X and, whenever a set y is a member of X, then y′=y∪{y} is also a member of X.
∃X[∅∈X∧∀y(y∈X→y′∈X)]
Less formally, it states that there exists a set having infinitely many members.
It must be established, however, that these members are all different, because if two elements are the same, the sequence will loop around in a finite cycle of sets. The axiom of regularity prevents this from happening.
The minimal set X satisfying the axiom of infinity is the von Neumann ordinal ω, which can also be thought of as the set of natural numbers N.