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 st 'not' t is C -provable holds
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 st 'not' t is C -provable holds
t '->' u is C -provable

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

let t, u be Formula of L; :: thesis: ( 'not' t is C -provable implies t '->' u is C -provable )
assume 'not' t is C -provable ; :: thesis: t '->' u is C -provable
then ('not' u) '->' ('not' t) is C -provable ;
hence t '->' u is C -provable by Lm24; :: thesis: verum