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

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

let t, u, v be Formula of L; :: thesis: ( t '->' (u '->' v) is C -provable iff t '->' (('not' v) '->' ('not' u)) is C -provable )
thus ( t '->' (u '->' v) is C -provable implies t '->' (('not' v) '->' ('not' u)) is C -provable ) :: thesis: ( t '->' (('not' v) '->' ('not' u)) is C -provable implies t '->' (u '->' v) is C -provable )
proof
set F1 = v '->' ('not' ('not' v));
set F2 = u '->' ('not' ('not' v));
assume A1: t '->' (u '->' v) is C -provable ; :: thesis: t '->' (('not' v) '->' ('not' u)) is C -provable
A2: v '->' ('not' ('not' v)) is C -provable ;
(u '->' (v '->' ('not' ('not' v)))) '->' ((u '->' v) '->' (u '->' ('not' ('not' v)))) is C -provable ;
then (u '->' v) '->' (u '->' ('not' ('not' v))) is C -provable by A2, Th20;
then t '->' (u '->' ('not' ('not' v))) is C -provable by A1, Th21;
then A4: u '->' (t '->' ('not' ('not' v))) is C -provable by Th24;
('not' ('not' u)) '->' u is C -provable ;
then ('not' ('not' u)) '->' (t '->' ('not' ('not' v))) is C -provable by A4, Th21;
then t '->' (('not' ('not' u)) '->' ('not' ('not' v))) is C -provable by Th24;
hence t '->' (('not' v) '->' ('not' u)) is C -provable by Lm25; :: thesis: verum
end;
thus ( t '->' (('not' v) '->' ('not' u)) is C -provable implies t '->' (u '->' v) is C -provable ) by Lm25; :: thesis: verum