let F1, F2 be Function of [:A,B:],REAL; :: thesis: ( ( for a, b being Ordinal st a in A & b in B holds
F1 . (a,b) = (r . a) * (s . b) ) & ( for a, b being Ordinal st a in A & b in B holds
F2 . (a,b) = (r . a) * (s . b) ) implies F1 = F2 )

assume that
A5: for a, b being Ordinal st a in A & b in B holds
F1 . (a,b) = (r . a) * (s . b) and
A6: for a, b being Ordinal st a in A & b in B holds
F2 . (a,b) = (r . a) * (s . b) ; :: thesis: F1 = F2
A7: ( dom F1 = [:A,B:] & [:A,B:] = dom F2 ) by FUNCT_2:def 1;
for x, y being object st x in A & y in B holds
F1 . (x,y) = F2 . (x,y)
proof
let x, y be object ; :: thesis: ( x in A & y in B implies F1 . (x,y) = F2 . (x,y) )
assume A8: ( x in A & y in B ) ; :: thesis: F1 . (x,y) = F2 . (x,y)
F1 . (x,y) = (r . x) * (s . y) by A5, A8;
hence F1 . (x,y) = F2 . (x,y) by A8, A6; :: thesis: verum
end;
hence F1 = F2 by A7, FUNCT_3:6; :: thesis: verum