let E1, E2 be Congruence of L; :: thesis: ( ( for t, u being Formula of L holds
( [t,u] in E1 iff t '==' u is D -provable ) ) & ( for t, u being Formula of L holds
( [t,u] in E2 iff t '==' u is D -provable ) ) implies E1 = E2 )

assume that
A1: for t, u being Formula of L holds
( [t,u] in E1 iff t '==' u is D -provable ) and
A2: for t, u being Formula of L holds
( [t,u] in E2 iff t '==' u is D -provable ) ; :: thesis: E1 = E2
for t, u being Formula of L holds
( [t,u] in E1 iff [t,u] in E2 )
proof
let t, u be Formula of L; :: thesis: ( [t,u] in E1 iff [t,u] in E2 )
( [t,u] in E1 iff t '==' u is D -provable ) by A1;
hence ( [t,u] in E1 iff [t,u] in E2 ) by A2; :: thesis: verum
end;
hence E1 = E2 by RELSET_1:def 2; :: thesis: verum