A1: len X = n by CARD_1:def 7;
1 <= n by NAT_1:14;
then 1 in Seg n ;
then A2: 1 in dom X by A1, FINSEQ_1:def 3;
defpred S1[ Nat, set , set ] means ( ex Pi, Xi1 being RealNormSpace st
( Pi = $2 & Xi1 = X . ($1 + 1) ) implies ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = $2 & Xi1 = X . ($1 + 1) & Pi1 = $3 & Pi1 = [:Pi,Xi1:] ) );
A3: for i being Nat st 1 <= i & i < n holds
for x being set ex y being set st S1[i,x,y]
proof
let i be Nat; :: thesis: ( 1 <= i & i < n implies for x being set ex y being set st S1[i,x,y] )
assume ( 1 <= i & i < n ) ; :: thesis: for x being set ex y being set st S1[i,x,y]
let x be set ; :: thesis: ex y being set st S1[i,x,y]
now :: thesis: ( ex Pi, Xi1 being RealNormSpace st
( Pi = x & Xi1 = X . (i + 1) ) implies ex y being RealNormSpace ex y being set st S1[i,x,y] )
assume ex Pi, Xi1 being RealNormSpace st
( Pi = x & Xi1 = X . (i + 1) ) ; :: thesis: ex y being RealNormSpace ex y being set st S1[i,x,y]
then consider Pi, Xi1 being RealNormSpace such that
A4: ( Pi = x & Xi1 = X . (i + 1) ) ;
reconsider y = [:Pi,Xi1:] as RealNormSpace ;
take y = y; :: thesis: ex y being set st S1[i,x,y]
ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = x & Xi1 = X . (i + 1) & Pi1 = y & Pi1 = [:Pi,Xi1:] ) by A4;
hence ex y being set st S1[i,x,y] ; :: thesis: verum
end;
hence ex y being set st S1[i,x,y] ; :: thesis: verum
end;
consider P being FinSequence such that
A5: ( len P = n & ( P . 1 = X . 1 or n = 0 ) & ( for i being Nat st 1 <= i & i < n holds
S1[i,P . i,P . (i + 1)] ) ) from RECDEF_1:sch 3(A3);
reconsider P = P as n -element FinSequence by A5, CARD_1:def 7;
defpred S2[ Nat] means ( 1 <= $1 & $1 < n implies ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . $1 & Xi1 = X . ($1 + 1) & P . ($1 + 1) = Pi1 & Pi1 = [:Pi,Xi1:] ) );
A6: S2[ 0 ] ;
A7: for i being Nat st S2[i] holds
S2[i + 1]
proof
let i be Nat; :: thesis: ( S2[i] implies S2[i + 1] )
assume A8: S2[i] ; :: thesis: S2[i + 1]
assume A9: ( 1 <= i + 1 & i + 1 < n ) ; :: thesis: ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) & P . ((i + 1) + 1) = Pi1 & Pi1 = [:Pi,Xi1:] )

then A10: (i + 1) + 1 <= n by NAT_1:13;
A11: i + 0 < i + 1 by XREAL_1:8;
1 <= (i + 1) + 1 by NAT_1:12;
then (i + 1) + 1 in Seg n by A10;
then (i + 1) + 1 in dom X by A1, FINSEQ_1:def 3;
then X . ((i + 1) + 1) in rng X by FUNCT_1:3;
then reconsider Xi1 = X . ((i + 1) + 1) as RealNormSpace by PRVECT_2:def 10;
per cases ( i = 0 or i <> 0 ) ;
suppose A12: i = 0 ; :: thesis: ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) & P . ((i + 1) + 1) = Pi1 & Pi1 = [:Pi,Xi1:] )

X . 1 in rng X by A2, FUNCT_1:def 3;
then reconsider Pi = P . 1 as RealNormSpace by A5, PRVECT_2:def 10;
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) ) by A12;
hence ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) & Pi1 = P . ((i + 1) + 1) & Pi1 = [:Pi,Xi1:] ) by A5, A9; :: thesis: verum
end;
suppose i <> 0 ; :: thesis: ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) & P . ((i + 1) + 1) = Pi1 & Pi1 = [:Pi,Xi1:] )

then consider Pi0, Xi10, Pi being RealNormSpace such that
A13: ( Pi0 = P . i & Xi10 = X . (i + 1) & P . (i + 1) = Pi & Pi = [:Pi0,Xi10:] ) by A8, A9, A11, XXREAL_0:2, NAT_1:14;
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) ) by A13;
hence ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . (i + 1) & Xi1 = X . ((i + 1) + 1) & Pi1 = P . ((i + 1) + 1) & Pi1 = [:Pi,Xi1:] ) by A5, A9; :: thesis: verum
end;
end;
end;
A14: for i being Nat holds S2[i] from NAT_1:sch 2(A6, A7);
defpred S3[ Nat] means ( 1 <= $1 & $1 <= n implies P . $1 is RealNormSpace );
A15: S3[ 0 ] ;
A16: for i being Nat st S3[i] holds
S3[i + 1]
proof
let i be Nat; :: thesis: ( S3[i] implies S3[i + 1] )
assume S3[i] ; :: thesis: S3[i + 1]
assume A17: ( 1 <= i + 1 & i + 1 <= n ) ; :: thesis: P . (i + 1) is RealNormSpace
A18: i + 0 < i + 1 by XREAL_1:8;
per cases ( i = 0 or i <> 0 ) ;
suppose i <> 0 ; :: thesis: P . (i + 1) is RealNormSpace
then ( 1 <= i & i < n ) by A17, A18, XXREAL_0:2, NAT_1:14;
then ex Pi, Xi1, Pi1 being RealNormSpace st
( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = Pi1 & Pi1 = [:Pi,Xi1:] ) by A14;
hence P . (i + 1) is RealNormSpace ; :: thesis: verum
end;
end;
end;
A20: for i being Nat holds S3[i] from NAT_1:sch 2(A15, A16);
now :: thesis: for y being set st y in rng P holds
y is RealNormSpace
let y be set ; :: thesis: ( y in rng P implies y is RealNormSpace )
assume y in rng P ; :: thesis: y is RealNormSpace
then consider i being object such that
A21: ( i in dom P & y = P . i ) by FUNCT_1:def 3;
reconsider i = i as Nat by A21;
i in Seg (len P) by A21, FINSEQ_1:def 3;
then ( 1 <= i & i <= n ) by A5, FINSEQ_1:1;
hence y is RealNormSpace by A20, A21; :: thesis: verum
end;
then reconsider P = P as n -element RealNormSpace-Sequence by PRVECT_2:def 10;
n in Seg n by FINSEQ_1:3;
then n in dom P by A5, FINSEQ_1:def 3;
then P . n in rng P by FUNCT_1:3;
then reconsider y = P . n as RealNormSpace by PRVECT_2:def 10;
take P ; :: thesis: ( P . 1 = X . 1 & ( for i being non zero Nat st i < n holds
ex X1, X2 being RealNormSpace st
( X1 = P . i & X2 = X . (i + 1) & P . (i + 1) = [:X1,X2:] ) ) )

thus P . 1 = X . 1 by A5; :: thesis: for i being non zero Nat st i < n holds
ex X1, X2 being RealNormSpace st
( X1 = P . i & X2 = X . (i + 1) & P . (i + 1) = [:X1,X2:] )

hereby :: thesis: verum
let i be non zero Nat; :: thesis: ( i < n implies ex Pi, Xi1 being RealNormSpace st
( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = [:Pi,Xi1:] ) )

assume A22: i < n ; :: thesis: ex Pi, Xi1 being RealNormSpace st
( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = [:Pi,Xi1:] )

0 + 1 <= i by NAT_1:13;
then consider Pi, Xi1, Pi1 being RealNormSpace such that
A23: ( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = Pi1 & Pi1 = [:Pi,Xi1:] ) by A14, A22;
take Pi = Pi; :: thesis: ex Xi1 being RealNormSpace st
( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = [:Pi,Xi1:] )

take Xi1 = Xi1; :: thesis: ( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = [:Pi,Xi1:] )
thus ( Pi = P . i & Xi1 = X . (i + 1) & P . (i + 1) = [:Pi,Xi1:] ) by A23; :: thesis: verum
end;