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 st u is C \/ {t} -provable holds
t '->' 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 st u is C \/ {t} -provable holds
t '->' u is C -provable

let C be SCI-prop-axioms L -extending Subset of L; :: thesis: for t, u being Formula of L st u is C \/ {t} -provable holds
t '->' u is C -provable

let t, u be Formula of L; :: thesis: ( u is C \/ {t} -provable implies t '->' u is C -provable )
set D = C \/ {t};
set R = SCI-rules L;
defpred S1[ object ] means ex v being Formula of L st
( $1 = v & t '->' v is C -provable );
A4: for a being object st a in C \/ {t} holds
S1[a]
proof
let a be object ; :: thesis: ( a in C \/ {t} implies S1[a] )
assume A5: a in C \/ {t} ; :: thesis: S1[a]
then a is C \/ {t} -axiomatic ;
then A6: ( a is C -axiomatic or a = t ) by PROOFS_1:6;
reconsider v = a as Formula of L by A5;
t '->' v is C -provable by A6;
hence S1[a] ; :: thesis: verum
end;
A10: for y being set
for a being object st [y,a] in SCI-rules L & ( for b being object st b in y holds
S1[b] ) holds
S1[a]
proof
let y be set ; :: thesis: for a being object st [y,a] in SCI-rules L & ( for b being object st b in y holds
S1[b] ) holds
S1[a]

let a be object ; :: thesis: ( [y,a] in SCI-rules L & ( for b being object st b in y holds
S1[b] ) implies S1[a] )

assume that
A12: [y,a] in SCI-rules L and
A13: for b being object st b in y holds
S1[b] ; :: thesis: S1[a]
consider v, w being Formula of L such that
A14: [y,a] = [{v,(v '->' w)},w] by A12;
A15: ( y = {v,(v '->' w)} & a = w ) by A14, XTUPLE_0:1;
( v in y & v '->' w in y ) by A15, TARSKI:def 2;
then A17: ( S1[v] & S1[v '->' w] ) by A13;
(t '->' (v '->' w)) '->' ((t '->' v) '->' (t '->' w)) is C -provable ;
then (t '->' v) '->' (t '->' w) is C -provable by A17, Th20;
hence S1[a] by A15, A17, Th20; :: thesis: verum
end;
A20: for a being object st C \/ {t}, SCI-rules L |- a holds
S1[a] from PROOFS_1:sch 3(A4, A10);
assume u is C \/ {t} -provable ; :: thesis: t '->' u is C -provable
then S1[u] by A20, PROOFS_1:def 11;
hence t '->' u is C -provable ; :: thesis: verum