Proof. Let
be a disjoint family of nonempty sets. Let
be a choice function. Let
with . Since
is a disjoint family of sets,
. Since is a choice function,
and
. Thus,
. Hence,
. It follows that is injective.
Let
. Then is a set.
Let
. Since is injective,
.
"proof of Zermelo's postulate" is owned by Wkbj79.