let X be Extension of SCI-arity ; for L being Polish-ext-set of X
for B being Subset of L
for t, u being Formula of L st t is B -provable & t '->' u is B -provable holds
u is B -provable
let L be Polish-ext-set of X; for B being Subset of L
for t, u being Formula of L st t is B -provable & t '->' u is B -provable holds
u is B -provable
let B be Subset of L; for t, u being Formula of L st t is B -provable & t '->' u is B -provable holds
u is B -provable
let t, u be Formula of L; ( t is B -provable & t '->' u is B -provable implies u is B -provable )
set R = SCI-rules L;
assume that
A1:
t is B -provable
and
A2:
t '->' u is B -provable
; u is B -provable
set S = {t,(t '->' u)};
for a being object st a in {t,(t '->' u)} holds
a in L
then
{t,(t '->' u)} c= L
;
then reconsider S = {t,(t '->' u)} as Formula-finset of L ;
( t is B, SCI-rules L -provable & t '->' u is B, SCI-rules L -provable )
by A1, A2;
then A10:
for a being object st a in S holds
B, SCI-rules L |- a
by TARSKI:def 2;
[S,u] in SCI-rules L
;
then
u is B, SCI-rules L -provable
by A10, PROOFS_1:11;
hence
u is B -provable
; verum