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

let C be SCI-prop-axioms L -extending Subset of L; :: thesis: for t being Formula of L holds (('not' t) '->' t) '->' t is C -provable
let t be Formula of L; :: thesis: (('not' t) '->' t) '->' t is C -provable
set u = the C -provable Formula of L;
(('not' t) '->' (t '->' ('not' the C -provable Formula of L))) '->' ((('not' t) '->' t) '->' (('not' t) '->' ('not' the C -provable Formula of L))) is C -provable ;
then (('not' t) '->' t) '->' (('not' t) '->' ('not' the C -provable Formula of L)) is C -provable by Th20;
then A2: (('not' t) '->' t) '->' ( the C -provable Formula of L '->' t) is C -provable by Lm25;
( the C -provable Formula of L '->' t) '->' t is C -provable ;
hence (('not' t) '->' t) '->' t is C -provable by A2, Th21; :: thesis: verum