Zermelo-Fraenkel Axioms

The Zermelo-Fraenkel axioms are the basis for Zermelo-Fraenkel set theory. In the following (Jech 1997, p. 1),  exists stands for exists,  forall means for all,  in stands for "is an element of," emptyset for the empty set, => for implies,  ^ for AND,  v for OR, and = for "is equivalent to."

1. Axiom of Extensionality: If X and Y have the same elements, then X=Y.

  forall u(u in X=u in Y)=>X=Y.
(1)

2. Axiom of the Unordered Pair: For any a and b there exists a set {a,b} that contains exactly a and b. (also called Axiom of Pairing)

  forall a  forall b  exists c  forall x(x in c=(x=a v x=b)).
(2)

3. Axiom of Subsets: If phi is a property (with parameter p), then for any X and p there exists a set Y={u in X:phi(u,p)} that contains all those u in X that have the property phi. (also called Axiom of Separation or Axiom of Comprehension)

  forall X  forall p  exists Y  forall u(u in Y=(u in X ^ phi(u,p))).
(3)

4. Axiom of the Sum Set: For any X there exists a set Y= union X, the union of all elements of X. (also called Axiom of Union)

  forall X  exists Y  forall u(u in Y= exists z(z in X ^ u in z)).
(4)

5. Axiom of the Power Set: For any X there exists a set Y=P(X), the set of all subsets of X.

  forall X  exists Y  forall u(u in Y=u subset= X).
(5)

6. Axiom of Infinity: There exists an infinite set.

  exists S[emptyset in S ^ ( forall x in S)[x union {x} in S]].
(6)

7. Axiom of Replacement: If F is a function, then for any X there exists a set Y=F[X]={F(x):x in X}.

  forall x  forall y  forall z[phi(x,y,p) ^ phi(x,z,p)=>y=z] 
 => forall X  exists Y  forall y[y in Y=( exists x in X)phi(x,y,p)].
(7)

8. Axiom of Foundation: Every nonempty set has an  in -minimal element. (also called Axiom of Regularity)

  forall S[S!=emptyset=>( exists x in S)S intersection x=emptyset].
(8)

9. Axiom of Choice: Every family of nonempty sets has a choice function.

  forall x in a exists A(x,y)=> exists y forall x in aA(x,y(x)).
(9)

The system of axioms 1-8 is called Zermelo-Fraenkel set theory, denoted "ZF." The system of axioms 1-8 minus the axiom of replacement (i.e., axioms 1-6 plus 8) is called Zermelo set theory, denoted "Z." The set of axioms 1-9 with the axiom of choice is usually denoted "ZFC."

Unfortunately, there seems to be some disagreement in the literature about just what axioms constitute "Zermelo set theory." Mendelson (1997) does not include the axioms of choice or foundation in Zermelo set theory, but does include the axiom of replacement. Enderton (1977) includes the axioms of choice and foundation, but does not include the axiom of replacement. Itô includes an Axiom of the empty set, which can be gotten from (6) and (3), via  exists X(X=X) and emptyset={u:u!=u}.

Abian (1969) proved consistency and independence of four of the Zermelo-Fraenkel axioms.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.