defpred S1[ Nat, set , set ] means $3 = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . ($1 + 1)),(dom S)))),(modetrans $2));
A1: for n being Nat st 1 <= n & n < len I holds
for x being set ex y being set st S1[n,x,y]
proof
let n be Nat; :: thesis: ( 1 <= n & n < len I implies for x being set ex y being set st S1[n,x,y] )
assume ( 1 <= n & n < len I ) ; :: thesis: for x being set ex y being set st S1[n,x,y]
let x be set ; :: thesis: ex y being set st S1[n,x,y]
take y = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (n + 1)),(dom S)))),(modetrans x)); :: thesis: S1[n,x,y]
thus S1[n,x,y] ; :: thesis: verum
end;
consider p being FinSequence such that
A2: ( len p = len I & ( p . 1 = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . 1),(dom S)))),T) or len I = 0 ) & ( for n being Nat st 1 <= n & n < len I holds
S1[n,p . n,p . (n + 1)] ) ) from RECDEF_1:sch 3(A1);
for x being set st x in rng p holds
x is RealNormSpace
proof
let x be set ; :: thesis: ( x in rng p implies x is RealNormSpace )
assume x in rng p ; :: thesis: x is RealNormSpace
then consider i being object such that
A5: ( i in dom p & x = p . i ) by FUNCT_1:def 3;
reconsider i = i as Nat by A5;
A6: ( 1 <= i & i <= len p ) by A5, FINSEQ_3:25;
per cases ( i = 1 or i <> 1 ) ;
end;
end;
then reconsider p = p as RealNormSpace-Sequence by A2, PRVECT_2:def 10;
take p ; :: thesis: ( dom p = dom I & p . 1 = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . 1),(dom S)))),T) & ( for i being Nat st 1 <= i & i < len I holds
p . (i + 1) = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (i + 1)),(dom S)))),(modetrans (p . i))) ) )

thus ( dom p = dom I & p . 1 = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . 1),(dom S)))),T) & ( for i being Nat st 1 <= i & i < len I holds
p . (i + 1) = R_NormSpace_of_BoundedLinearOperators ((S . (In ((I . (i + 1)),(dom S)))),(modetrans (p . i))) ) ) by A2, FINSEQ_3:29; :: thesis: verum