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 '&' 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 '&' 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 '&' u)) is C -provable
let t, u be Formula of L; :: thesis: t '->' (u '->' (t '&' u)) is C -provable
set G = t '->' ('not' u);
('not' (t '->' ('not' u))) '->' (t '&' u) is L -prop-axiomatic ;
then A1: ('not' (t '&' u)) '->' ('not' ('not' (t '->' ('not' u)))) is C -provable by Lm20, Th30;
('not' ('not' (t '->' ('not' u)))) '->' (t '->' ('not' u)) is C -provable ;
then ('not' (t '&' u)) '->' (t '->' ('not' u)) is C -provable by Th21, A1;
then t '->' (('not' (t '&' u)) '->' ('not' u)) is C -provable by Th24;
hence t '->' (u '->' (t '&' u)) is C -provable by Th36; :: thesis: verum