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
( ('not' t) '->' ('not' u) is C -provable iff u '->' 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
( ('not' t) '->' ('not' u) is C -provable iff u '->' t is C -provable )

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

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