defpred S1[ object , object ] means ex v, w being Formula of L st
( v = $1 & w = $2 & v '==' w is D -provable );
A1: for a being object st a in L holds
S1[a,a]
proof
let a be object ; :: thesis: ( a in L implies S1[a,a] )
assume a in L ; :: thesis: S1[a,a]
then reconsider t = a as Formula of L ;
t '==' t is D -provable ;
hence S1[a,a] ; :: thesis: verum
end;
A10: for a, b being object st S1[a,b] holds
S1[b,a]
proof
let a, b be object ; :: thesis: ( S1[a,b] implies S1[b,a] )
assume S1[a,b] ; :: thesis: S1[b,a]
then consider v, w being Formula of L such that
A12: ( v = a & w = b ) and
A13: v '==' w is D -provable ;
w '==' v is D -provable by A13, Th63;
hence S1[b,a] by A12; :: thesis: verum
end;
A20: for a, b, c being object st S1[a,b] & S1[b,c] holds
S1[a,c]
proof
let a, b, c be object ; :: thesis: ( S1[a,b] & S1[b,c] implies S1[a,c] )
assume ( S1[a,b] & S1[b,c] ) ; :: thesis: S1[a,c]
then consider t, u, v, w being Formula of L such that
A22: t = a and
A23: u = b and
A24: t '==' u is D -provable and
A25: v = b and
A26: w = c and
A27: v '==' w is D -provable ;
t '==' w is D -provable by A23, A24, A25, A27, Th68;
hence S1[a,c] by A22, A26; :: thesis: verum
end;
consider E being Equivalence_Relation of L such that
A30: for a, b being object holds
( [a,b] in E iff ( a in L & b in L & S1[a,b] ) ) from EQREL_1:sch 1(A1, A10, A20);
take E ; :: thesis: ( E is Congruence of L & ( for t, u being Formula of L holds
( [t,u] in E iff t '==' u is D -provable ) ) )

A31: for p, q being Formula of L holds
( [p,q] in E iff p '==' q is D -provable )
proof
let p, q be Formula of L; :: thesis: ( [p,q] in E iff p '==' q is D -provable )
thus ( [p,q] in E implies p '==' q is D -provable ) :: thesis: ( p '==' q is D -provable implies [p,q] in E )
proof
assume [p,q] in E ; :: thesis: p '==' q is D -provable
then consider r, s being Formula of L such that
A32: ( r = p & s = q & r '==' s is D -provable ) by A30;
thus p '==' q is D -provable by A32; :: thesis: verum
end;
thus ( p '==' q is D -provable implies [p,q] in E ) by A30; :: thesis: verum
end;
thus E is Congruence of L :: thesis: for t, u being Formula of L holds
( [t,u] in E iff t '==' u is D -provable )
proof
let t be Formula of L; :: according to SUSZKO_1:def 47 :: thesis: for u, v, w being Formula of L st [t,u] in E & [v,w] in E holds
( [('not' t),('not' u)] in E & [(t '&' v),(u '&' w)] in E & [(t 'or' v),(u 'or' w)] in E & [(t '->' v),(u '->' w)] in E & [(t '<->' v),(u '<->' w)] in E & [(t '==' v),(u '==' w)] in E )

let u, v, w be Formula of L; :: thesis: ( [t,u] in E & [v,w] in E implies ( [('not' t),('not' u)] in E & [(t '&' v),(u '&' w)] in E & [(t 'or' v),(u 'or' w)] in E & [(t '->' v),(u '->' w)] in E & [(t '<->' v),(u '<->' w)] in E & [(t '==' v),(u '==' w)] in E ) )
assume ( [t,u] in E & [v,w] in E ) ; :: thesis: ( [('not' t),('not' u)] in E & [(t '&' v),(u '&' w)] in E & [(t 'or' v),(u 'or' w)] in E & [(t '->' v),(u '->' w)] in E & [(t '<->' v),(u '<->' w)] in E & [(t '==' v),(u '==' w)] in E )
then A33: ( t '==' u is D -provable & v '==' w is D -provable ) by A31;
then ('not' t) '==' ('not' u) is D -provable by Th61;
hence [('not' t),('not' u)] in E by A31; :: thesis: ( [(t '&' v),(u '&' w)] in E & [(t 'or' v),(u 'or' w)] in E & [(t '->' v),(u '->' w)] in E & [(t '<->' v),(u '<->' w)] in E & [(t '==' v),(u '==' w)] in E )
( (t '&' v) '==' (u '&' w) is D -provable & (t 'or' v) '==' (u 'or' w) is D -provable & (t '->' v) '==' (u '->' w) is D -provable & (t '<->' v) '==' (u '<->' w) is D -provable & (t '==' v) '==' (u '==' w) is D -provable ) by A33, Th66;
hence ( [(t '&' v),(u '&' w)] in E & [(t 'or' v),(u 'or' w)] in E & [(t '->' v),(u '->' w)] in E & [(t '<->' v),(u '<->' w)] in E & [(t '==' v),(u '==' w)] in E ) by A31; :: thesis: verum
end;
thus for t, u being Formula of L holds
( [t,u] in E iff t '==' u is D -provable ) by A31; :: thesis: verum