let X be Extension of SCI-arity ; :: thesis: for L being Polish-ext-set of X
for D being SCI-axioms b1 -extending Subset of L
for t, u being Formula of L holds
( t '<->' u is D -provable iff ( t '->' u is D -provable & u '->' t is D -provable ) )

let L be Polish-ext-set of X; :: thesis: for D being SCI-axioms L -extending Subset of L
for t, u being Formula of L holds
( t '<->' u is D -provable iff ( t '->' u is D -provable & u '->' t is D -provable ) )

let D be SCI-axioms L -extending Subset of L; :: thesis: for t, u being Formula of L holds
( t '<->' u is D -provable iff ( t '->' u is D -provable & u '->' t is D -provable ) )

let t, u be Formula of L; :: thesis: ( t '<->' u is D -provable iff ( t '->' u is D -provable & u '->' t is D -provable ) )
thus ( t '<->' u is D -provable implies ( t '->' u is D -provable & u '->' t is D -provable ) ) :: thesis: ( t '->' u is D -provable & u '->' t is D -provable implies t '<->' u is D -provable )
proof
assume A1: t '<->' u is D -provable ; :: thesis: ( t '->' u is D -provable & u '->' t is D -provable )
(t '<->' u) '->' ((t '->' u) '&' (u '->' t)) is D -provable ;
then (t '->' u) '&' (u '->' t) is D -provable by A1, Th20;
hence ( t '->' u is D -provable & u '->' t is D -provable ) by Th43; :: thesis: verum
end;
assume A10: ( t '->' u is D -provable & u '->' t is D -provable ) ; :: thesis: t '<->' u is D -provable
((t '->' u) '&' (u '->' t)) '->' (t '<->' u) is D -provable ;
hence t '<->' u is D -provable by A10, Th20; :: thesis: verum