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 holds (t '==' u) '->' (u '==' t) 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 holds (t '==' u) '->' (u '==' t) is D -provable

let D be SCI-axioms L -extending Subset of L; :: thesis: for t, u being Formula of L holds (t '==' u) '->' (u '==' t) is D -provable
let t, u be Formula of L; :: thesis: (t '==' u) '->' (u '==' t) is D -provable
set F1 = ((t '==' u) '&' (t '==' t)) '->' ((t '==' t) '==' (u '==' t));
((t '==' u) '&' (t '==' t)) '->' ((t '==' t) '==' (u '==' t)) in SCI-id-axioms L by Def10i;
then A1: ((t '==' u) '&' (t '==' t)) '->' ((t '==' t) '==' (u '==' t)) is D -provable ;
A2: t '==' t is D -provable ;
then (t '==' u) '->' ((t '==' u) '&' (t '==' t)) is D -provable ;
then A3: (t '==' u) '->' ((t '==' t) '==' (u '==' t)) is D -provable by A1, Th21;
((t '==' t) '==' (u '==' t)) '->' ((t '==' t) '->' (u '==' t)) is D -provable ;
then (t '==' u) '->' ((t '==' t) '->' (u '==' t)) is D -provable by A3, Th21;
then (t '==' t) '->' ((t '==' u) '->' (u '==' t)) is D -provable by Th24;
hence (t '==' u) '->' (u '==' t) is D -provable by A2, Th20; :: thesis: verum