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 x, y being Equivalence_Class of D holds
( x '&' y is D -provable iff ( x is D -provable & y is D -provable ) )

let L be Polish-ext-set of X; :: thesis: for D being SCI-axioms L -extending Subset of L
for x, y being Equivalence_Class of D holds
( x '&' y is D -provable iff ( x is D -provable & y is D -provable ) )

let D be SCI-axioms L -extending Subset of L; :: thesis: for x, y being Equivalence_Class of D holds
( x '&' y is D -provable iff ( x is D -provable & y is D -provable ) )

let x, y be Equivalence_Class of D; :: thesis: ( x '&' y is D -provable iff ( x is D -provable & y is D -provable ) )
consider t being Formula of L such that
A1: x = D -class t by Th81;
consider u being Formula of L such that
A2: y = D -class u by Th81;
A3: x '&' y = D -class (t '&' u) by A1, A2, Def102;
thus ( x '&' y is D -provable implies ( x is D -provable & y is D -provable ) ) :: thesis: ( x is D -provable & y is D -provable implies x '&' y is D -provable )
proof
assume x '&' y is D -provable ; :: thesis: ( x is D -provable & y is D -provable )
then t '&' u is D -provable by A3, Th90;
then ( t is D -provable & u is D -provable ) by Th43;
hence ( x is D -provable & y is D -provable ) by A1, A2; :: thesis: verum
end;
assume ( x is D -provable & y is D -provable ) ; :: thesis: x '&' y is D -provable
then ( t is D -provable & u is D -provable ) by A1, A2, Th90;
hence x '&' y is D -provable by A3; :: thesis: verum