Hi Richard,
The axiom of choice doesn't come into this.
Given
f ∈ A ⇸ B
a ∈ A
b1, b2 ∈ B
then the predicate
(a, b1) ∈ f ∧ (a, b2) ∈ f
constrains b1 and b2 to be equal. If something constrains b1 and b2 to be unequal, that contradiction would give false. Possibly the entire schema would reduce to false.
Function application in Z requires a function only at the point of application. For example,
{(0, 1), (1, 2), (1, 3)} 0 = 1
but
{(0, 1), (1, 2), (1, 3)} 1
is not defined (there is no arbitrary choice between 2 or 3). If such a situation occurs, it is possible that the author meant to use relational image, for example
{(0, 1), (1, 2), (1, 3)} ⦇ {1} ⦈ = {2, 3}
Phil
P.S. There are Z unicode characters above. Hopefully they are appearing correctly for you!