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

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

let t, u, v be Formula of L; :: thesis: ( (t 'or' u) '->' v is C -provable iff ( t '->' v is C -provable & u '->' v is C -provable ) )
thus ( (t 'or' u) '->' v is C -provable implies ( t '->' v is C -provable & u '->' v is C -provable ) ) :: thesis: ( t '->' v is C -provable & u '->' v is C -provable implies (t 'or' u) '->' v is C -provable )
proof
assume A1: (t 'or' u) '->' v is C -provable ; :: thesis: ( t '->' v is C -provable & u '->' v is C -provable )
t '->' (t 'or' u) is C -provable ;
hence t '->' v is C -provable by A1, Th21; :: thesis: u '->' v is C -provable
u '->' (t 'or' u) is C -provable ;
hence u '->' v is C -provable by A1, Th21; :: thesis: verum
end;
assume that
A10: t '->' v is C -provable and
A11: u '->' v is C -provable ; :: thesis: (t 'or' u) '->' v is C -provable
A12: (t 'or' u) '->' (('not' t) '->' u) is C -provable ;
A13: (('not' t) '->' u) '->' (('not' t) '->' v) is C -provable by A11, Lm21;
('not' v) '->' ('not' t) is C -provable by A10, Th30;
then (('not' t) '->' v) '->' (('not' v) '->' v) is C -provable by Lm26;
then (('not' t) '->' u) '->' (('not' v) '->' v) is C -provable by A13, Th21;
then A15: (t 'or' u) '->' (('not' v) '->' v) is C -provable by A12, Th21;
(('not' v) '->' v) '->' v is C -provable by Th46;
hence (t 'or' u) '->' v is C -provable by A15, Th21; :: thesis: verum