Axiom ZF1 - Sets with the same members are equal - (Extensionality).
If x and y are sets then x y z (zx zy ).
Axiom ZF2 - The "Empty Set" is a set. We write it as
There exists a set such that x((x)).
Note by ZF1 is unique.
Axiom ZF3 - Set Formation - Unordered Pairs.
If x,y are sets then there exists a set z such that
a (az (a x or a y)).
We write this unique set as {x,y} . Note that {x,x} which is the same as {x} is not the set x.
Axiom ZF4 - Set Formation - Selection.
If z,y,y, ..., y are sets and is a proposition
containing variables and a free variable
and doesn't contain other free variables then
there exits a set y such that
x(xy (xz and ) ).
Note that this avoids Russell's Paradox since we require x to be a member of a "known set." Again, it is unique.
Translation:We write y{xz \ }.
Axiom ZF5 - Set Formation - Union.
If x is a set then there exists a set y such that
a (ay (z( zx and az) ).
Translation: We write yx , or some variant thereof
Axiom ZF6 - Set Formation - Power set.
If x is a set then there exists a set z such that
y( yz ( a (ay ay ) ).
Translation: ( a (ay ay ) is just a definition of inclusion yx
Axiom ZF7 - There is an infinite set
There exists a set m such that m and x(xy (({x,{x}})m).
Translation:({x,{x}} is the set containing all the members of x and the set x itself.
Axiom ZF8 - Replacement( Functional Image)
Let be a proposition that does not contain the symbol b then
xyy( (xy and xy) yy ) abc ( cb d(da and \Phi dc)) ).
Translation: If, given any set x, there is a unique set y such that xy, then, given any set a, there is a set b such that, given any set c, c is a member of b if and only if there is a set d such that d is a member of a and \Phi holds for d and c.
Axiom ZF9 - There are not Russell's Paradox like Sets (Regularity).
If x is a set and x then y (yx and a ((ax and ay)).
Translation: Every non-empty set contains a member that does not any members in common with it.
Note a( (ax and ay)). can be read xy. This can be shown to rule out the Russell set.