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' ('not' 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' ('not' 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' ('not' t)) '->' t is C -provable
let t be Formula of L; :: thesis: ('not' ('not' t)) '->' t is C -provable
set F = 'not' ('not' t);
('not' ('not' t)) '->' (('not' ('not' ('not' ('not' t)))) '->' ('not' ('not' t))) is L -prop-axiomatic ;
then ('not' ('not' t)) '->' (('not' t) '->' ('not' ('not' ('not' t)))) is C -provable by Lm20, Lm25;
then A1: ('not' ('not' t)) '->' (('not' ('not' t)) '->' t) is C -provable by Lm25;
(('not' ('not' t)) '->' (('not' ('not' t)) '->' t)) '->' (('not' ('not' t)) '->' t) is C -provable ;
hence ('not' ('not' t)) '->' t is C -provable by A1, Th20; :: thesis: verum