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

let C be SCI-prop-axioms L -extending Subset of L; :: thesis: for t, u being Formula of L holds
( t '->' (t 'or' u) is C -provable & u '->' (t 'or' u) is C -provable )

let t, u be Formula of L; :: thesis: ( t '->' (t 'or' u) is C -provable & u '->' (t 'or' u) is C -provable )
A1: (('not' t) '->' u) '->' (t 'or' u) is C -provable ;
t '->' (('not' t) '->' u) is C -provable ;
hence t '->' (t 'or' u) is C -provable by A1, Th21; :: thesis: u '->' (t 'or' u) is C -provable
u '->' (('not' t) '->' u) is C -provable ;
hence u '->' (t 'or' u) is C -provable by A1, Th21; :: thesis: verum