§ Axiom of Choice and Zorn's Lemma
I have not seen this "style" of proof before of AoC/Zorn's lemma
by thinking of partial functions (A→B) as monotone functions
on (A∪⊥→B).
§ Zorn's Lemma implies Axiom of Choice
If we are given Zorn's lemma and the set Ai, to build a choice
function, we consider the collection of functions (f:∏iAi→→Ai∪⊥)
such that either f(Ai)=⊥ or f(Ai)∈Ai. This can be endowed with
a partial order / join semilattice structure using the "flat" lattice, where
⊥<x for all x, and ⊥⊔x=x.
For every chain of functions, we have a least upper bound, since a chain
of functions is basically a collection of functions fi where each function
fi+1 is "more defined" than fi.
Hence we can always get a maximal element F, which has a value defined
at each F(Ai). Otherwise, if we have F(Ai)=⊥, the element
is not maximal, since it is dominated by a larger function which is defined
at Ai.
Hence, we've constructed a choice function by applying Zorn's Lemma.
Thus, Zorn's Lemma implies Axiom of Choice.