let f1, f2 be Function; :: thesis: ( dom f1 = [:X,Y:] & ( for x, y being set st x in X & y in Y holds
f1 . x,y = y ) & dom f2 = [:X,Y:] & ( for x, y being set st x in X & y in Y holds
f2 . x,y = y ) implies f1 = f2 )
assume that
A5: dom f1 = [:X,Y:] and
A6: for x, y being set st x in X & y in Y holds
f1 . x,y = y and
A7: dom f2 = [:X,Y:] and
A8: for x, y being set st x in X & y in Y holds
f2 . x,y = y ; :: thesis: f1 = f2
for x, y being set st x in X & y in Y holds
f1 . x,y = f2 . x,y

proof

let x, y be set ; :: thesis: ( x in X & y in Y implies f1 . x,y = f2 . x,y )
assume ( x in X & y in Y ) ; :: thesis: f1 . x,y = f2 . x,y
then ( f1 . x,y = y & f2 . x,y = y ) by A6, A8;
hence f1 . x,y = f2 . x,y ; :: thesis: verum

end;

hence f1 = f2 by A5, A7, Th6; :: thesis: verum