Axioms

Axiom of Extensionality

Two sets are equal if they have the same elements

Axiom of Regularity

Every non-empty set contains a member of such that and are disjoint sets

This implies,

Axiom schema of Specification

where is a Propositional Function

Every subset of a set, defined by a Propositional Function is itself a set

Axiom of Pairing

If are sets, then a set which contains as elements

Axiom of Existence

There is a set such that no element is a member of it

Axiom of Union

where is a Family of Sets

The union over the elements of a set exists

Axiom Schema of Replacement

where is a relation on

The image of any set under definable function is also a set

Axiom of Infinity

Guarantees the existence of at least one infinite set

Axiom of Power Set

For every set , there is a set consisting precisely of the subsets of

Axiom of Choice

where is a Family of Sets, and is a Choice Function

Given any collection of sets, each containing at least one element, it is possible to construct a new set by the Choice Function that chooses arbitrary one element from each set.

Equivalents

Hausdorff Maximal Principle

Definition

Every Partially Ordered Set has a maximal chain

Link to original

Zorn's Lemma

Definition

Every non-empty Partially Ordered Set in which every chain has an upper bound contains at least one Maximum

Link to original

Well-Ordering Theorem

Definition

Every set can be well-order

Link to original