Let
be a set,
and
a parameter. Then a new set
can be formed by selecting from
all the values of
and
for which a given formula
is true.
Axiom: The axiom of Schema of Separation
![]()
![]()
The formula
must be written using
or
in terms of first order predicate logic using connectives
,
,
,
and
and quantifiers
and
.
It follows from the Schema of Separation that we can define the intersection between two set and that this is a set.
Definition: Let
and
be sets. The intersection is:
![]()
The set of the intersection is formed from elements that are in both
and
.
Definition: Let
and
be sets. The difference between
and
is:
![]()
The difference between two sets is a set that has all the elements that are in
but are not in
.
Definition: Let
and
be sets. The union of two sets is:
![]()
The union of two sets is a set that has all the elements that are in
and are in
.
Definition: Let
be a set. There exists an empty set
.
![]()
This defines a set that has no elements
.
The above definitions, as extensions to the Schema of Separation, construct new sets. But they still do so from existing sets. To help solve this situation we need the Axiom of Pairing.
