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

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