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

let C be SCI-prop-axioms L -extending Subset of L; :: thesis: for t being Formula of L holds t '->' ('not' ('not' t)) is C -provable
let t be Formula of L; :: thesis: t '->' ('not' ('not' t)) is C -provable
('not' ('not' ('not' t))) '->' ('not' t) is C -provable by Th26;
hence t '->' ('not' ('not' t)) is C -provable by Lm24; :: thesis: verum