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

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

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

let t, u be Formula of L; :: thesis: ( (t '&' u) '->' t is C -provable & (t '&' u) '->' u is C -provable )
set F = 'not' (t '->' ('not' u));
A1: (t '&' u) '->' ('not' (t '->' ('not' u))) is C -provable ;
('not' t) '->' (t '->' ('not' u)) is C -provable ;
then ('not' (t '->' ('not' u))) '->' t is C -provable by Th28;
hence (t '&' u) '->' t is C -provable by A1, Th21; :: thesis: (t '&' u) '->' u is C -provable
('not' u) '->' (t '->' ('not' u)) in SCI-prop-axioms L by Def10p;
then ('not' (t '->' ('not' u))) '->' u is C -provable by Lm20, Th28;
hence (t '&' u) '->' u is C -provable by A1, Th21; :: thesis: verum