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, v being Formula of L st t '->' (('not' u) '->' ('not' v)) is C -provable holds
t '->' (v '->' 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, v being Formula of L st t '->' (('not' u) '->' ('not' v)) is C -provable holds
t '->' (v '->' u) is C -provable

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

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