let X be Extension of SCI-arity ; :: thesis: for L being Polish-ext-set of X
for D being SCI-axioms b1 -extending Subset of L
for t, u being Formula of L st t '==' u is D -provable holds
('not' t) '==' ('not' u) is D -provable

let L be Polish-ext-set of X; :: thesis: for D being SCI-axioms L -extending Subset of L
for t, u being Formula of L st t '==' u is D -provable holds
('not' t) '==' ('not' u) is D -provable

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

let t, u be Formula of L; :: thesis: ( t '==' u is D -provable implies ('not' t) '==' ('not' u) is D -provable )
assume A2: t '==' u is D -provable ; :: thesis: ('not' t) '==' ('not' u) is D -provable
(t '==' u) '->' (('not' t) '==' ('not' u)) is D -provable ;
hence ('not' t) '==' ('not' u) is D -provable by A2, Th20; :: thesis: verum