let f1, f2 be UnOp of F1(); :: thesis: ( ( for a being Element of F1() holds f1 . a = F2(a) ) & ( for a being Element of F1() holds f2 . a = F2(a) ) implies f1 = f2 ) assume that A1:
for a being Element of F1() holds f1 . a = F2(a)
and A2:
for a being Element of F1() holds f2 . a = F2(a)
; :: thesis: f1 = f2