 More detailed coverage of this topic can be found in the readable text by K.

Hrbacek
and T. Jech “Introduction to Set Theory,” 2nd Edition Revised and Expanded, in Pure and
Applied Mathematics, A Series of Monographs and Textbooks, Marcel Dekker (1984).
> Topologic, algebraic, and analytic properties of these objects are then derived from
various properties of sets, which can be themselves in their turn obtained as consequences The “standard” axioms of set theory
of the axioms of ZFC.” are called the Zermelo-Frankel
Axioms with Choice, or “ZFC Axioms”
Ernst Zermelo (July 27, 1871 – May 21, 1953) published his axiomatic system in 1908.
for short. Quoting from Hrbacek and
Jech (Chapter 12, The Axiomatic Set
Theory)

Theorem 0.8.1. Equipollence is an equivalence relation on the class S of all sets.  Axiom of Existence. There
exists a set which has no
Definition 0.8.2. The cardinal number (or cardinality) of a set A, denoted |A|, is
the equivalence class of A under the equivalence relation of equipollence. |A| is
elements.
an infinite or finite cardinal according as to whether A is an infinite or finite set.  Axiom of Extensionality. If
every element of X is an
Definition 0.8.3. Let α and β be cardinal numbers. The sum α+β is the cardinal element of Y and every
number |A ∪ B|, where A and B are disjoint sets such that |A| = α and |B| = β. element of Y is an element of
The product αβ is the cardinal number |A × B|. X, then X = Y .
Definition 0.8.4. Let α, β be cardinal numbers and A, B sets such that |A| = α, |B|  Axiom Schema of
= β. α is less than or equal to β, denoted α ≤ β or β ≥ α, if A is equipollent with a Comprehension. Let P(x) be a
subset of β (that is, there is an injective map A → B). α is strictly less than β, property of x. For any A,
denoted α < β or β > α, if α ≤ β and α 6= β. there is a B such that x ∈ B is
and only if x ∈ A and P(x)
Theorem 0.8.5. If A is a set and P(A) is the power set, then |A| < |P(A)|.
holds.
Theorem 0.8.6. Schroeder-Bernstein Theorem. If A and B are sets such that |A| ≤  Axiom of Pair. For any A and
|B| and |B| ≤ |A|, then |A| = |B|. B, there is C such that x ∈ C if
and only if x = A or x = B.
Theorem 0.8.7. The class of all cardinal numbers is linearly ordered by ≤. The is
 Axiom of Union. For any S,
called the Law of Tracheotomy.
there is U such that x ∈ U if
Theorem 0.8.8. Every infinite set has a denumerable subset. In particular ℵ0 ≤ α and only if x ∈ A for some A ∈
for every infinite cardinal number α. S.
 Axiom of Power Set. For any
Lemma 0.8.9. If A is an infinite set and F is a finite set then |A ∪ F| = |A|. In
S, there is P such that X ∈ P if
particular, α + n = α for every infinite cardinal number α and every finite
cardinal number n. and only if X ⊆ S. 0.8.
Cardinal Numbers 2
Theorem 0.8.10. If α and β are cardinal numbers such that β ≤ α and α is infinite,  Axiom of Infinity. An
then α + β = α. inductive set exists.
 Axiom Schema of
Theorem 0.8.11. If α and β are cardinal numbers such that 0 6= β ≤ α and α is
infinite, then αβ = α; in particular, αℵ0 = α and if β is finite then ℵ0β = ℵ0. Replacement. let P(x, y) be a
property such that for every x
Theorem 0.8.12. Let A be a set and for each integer n ≥ 1 let An = A×A×· · ·×A (n there is a unique y for which
factors). (i) If A is finite, then |An | = |A| n , and if A is infinite then |An | = |A|. (ii) P(x, y) holds. For every A
|∪n∈NAn | = ℵ0|A|. there is B such that for every
Corollary 0.8.13. If A is an infinite set and F(A) is the set of all finite subsets of A, x ∈ A there is y ∈ B for which
then |F(A)| = |A| P(x, y) holds.
 Axiom of Choice. Every
system of sets has a choice
function.