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 x, y being Equivalence_Class of D st x is D -provable holds
( x 'or' y is D -provable & y 'or' x is D -provable )

let L be Polish-ext-set of X; :: thesis: for D being SCI-axioms L -extending Subset of L
for x, y being Equivalence_Class of D st x is D -provable holds
( x 'or' y is D -provable & y 'or' x is D -provable )

let D be SCI-axioms L -extending Subset of L; :: thesis: for x, y being Equivalence_Class of D st x is D -provable holds
( x 'or' y is D -provable & y 'or' x is D -provable )

let x, y be Equivalence_Class of D; :: thesis: ( x is D -provable implies ( x 'or' y is D -provable & y 'or' x is D -provable ) )
consider t being Formula of L such that
A1: x = D -class t by Th81;
consider u being Formula of L such that
A2: y = D -class u by Th81;
A3: x 'or' y = D -class (t 'or' u) by A1, A2, Def103;
assume x is D -provable ; :: thesis: ( x 'or' y is D -provable & y 'or' x is D -provable )
then A4: t is D -provable by A1, Th90;
hence x 'or' y is D -provable by A3; :: thesis: y 'or' x is D -provable
y 'or' x = D -class (u 'or' t) by A1, A2, Def103;
hence y 'or' x is D -provable by A4; :: thesis: verum