thus
A --> z is Function-like
A --> z is Relation-like proof
let x be
set ;
FUNCT_1:def 1 for b1, b2 being set holds
( not [x,b1] in A --> z or not [x,b2] in A --> z or b1 = b2 )let y1,
y2 be
set ;
( not [x,y1] in A --> z or not [x,y2] in A --> z or y1 = y2 )
assume that A1:
[x,y1] in A --> z
and A2:
[x,y2] in A --> z
;
y1 = y2
y1 in {z}
by A1, ZFMISC_1:87;
then A3:
y1 = z
by TARSKI:def 1;
y2 in {z}
by A2, ZFMISC_1:87;
hence
y1 = y2
by A3, TARSKI:def 1;
verum
end;
thus
for x being set st x in A --> z holds
ex y1, y2 being set st [y1,y2] = x
by RELAT_1:def 1; RELAT_1:def 1 verum