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) '->' (('not' u) '->' ('not' t)) 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) '->' (('not' u) '->' ('not' t)) 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) '->' (('not' u) '->' ('not' t)) is C -provable
let t, u be Formula of L; :: thesis: (t '->' u) '->' (('not' u) '->' ('not' t)) is C -provable
A1: (('not' ('not' t)) '->' ('not' ('not' u))) '->' (('not' u) '->' ('not' t)) is C -provable ;
('not' ('not' t)) '->' t is C -provable by Th26;
then A2: (t '->' u) '->' (('not' ('not' t)) '->' u) is C -provable by Lm26;
u '->' ('not' ('not' u)) is C -provable by Th27;
then (('not' ('not' t)) '->' u) '->' (('not' ('not' t)) '->' ('not' ('not' u))) is C -provable by Lm21;
then (t '->' u) '->' (('not' ('not' t)) '->' ('not' ('not' u))) is C -provable by A2, Th21;
hence (t '->' u) '->' (('not' u) '->' ('not' t)) is C -provable by A1, Th21; :: thesis: verum