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

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