let F, G be Membership_Func of C; :: thesis: ( ( for c being Element of C holds F . c = 1 - (h . c) ) & ( for c being Element of C holds G . c = 1 - (h . c) ) implies F = G )
assume that
A14: for c being Element of C holds F . c = 1 - (h . c) and
A15: for c being Element of C holds G . c = 1 - (h . c) ; :: thesis: F = G
A16: for c being Element of C st c in C holds
F . c = G . c

proof

let c be Element of C; :: thesis: ( c in C implies F . c = G . c )
F . c = 1 - (h . c) by A14;
hence ( c in C implies F . c = G . c ) by A15; :: thesis: verum

end;

( C = dom F & C = dom G ) by FUNCT_2:def 1;
hence F = G by A16, PARTFUN1:5; :: thesis: verum