defpred S1[ non zero Nat] means for X being $1 -element RealNormSpace-Sequence
for r being Real
for x being Point of (CarProduct X)
for px, prx being $1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= $1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i );
A1: S1[1]
proof
let X be 1 -element RealNormSpace-Sequence; :: thesis: for r being Real
for x being Point of (CarProduct X)
for px, prx being 1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

set X1 = ElmFin (X,1);
ElmFin (X,1) = X . 1 by Def3;
then A2: CarProduct X = ElmFin (X,1) by Def4;
let r be Real; :: thesis: for x being Point of (CarProduct X)
for px, prx being 1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

let x be Point of (CarProduct X); :: thesis: for px, prx being 1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

let px, prx be 1 -element FinSequence; :: thesis: ( x = PtCarProduct px & r * x = PtCarProduct prx implies for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) )

assume A3: ( x = PtCarProduct px & r * x = PtCarProduct prx ) ; :: thesis: for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

then ex pxi being Point of (ElmFin (X,1)) st pxi = px . 1 by Th17;
then reconsider px1 = px . 1 as Point of (ElmFin (X,1)) ;
ex prxi being Point of (ElmFin (X,1)) st prxi = prx . 1 by A3, Th17;
then reconsider prx1 = prx . 1 as Point of (ElmFin (X,1)) ;
A4: ( x = px . 1 & r * x = prx . 1 ) by A3, Def1;
A5: now :: thesis: for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )
let i be non zero Nat; :: thesis: ( i <= 1 implies ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) )

assume A6: i <= 1 ; :: thesis: ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

1 <= i by NAT_1:14;
then i = 1 by A6, XXREAL_0:1;
hence ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) by A2, A4; :: thesis: verum
end;
thus for i being non zero Nat st i <= 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) by A5; :: thesis: verum
end;
A7: for n being non zero Nat st S1[n] holds
S1[n + 1]
proof
let n be non zero Nat; :: thesis: ( S1[n] implies S1[n + 1] )
assume A8: S1[n] ; :: thesis: S1[n + 1]
let X be n + 1 -element RealNormSpace-Sequence; :: thesis: for r being Real
for x being Point of (CarProduct X)
for px, prx being n + 1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

set n1 = n + 1;
set Xn1 = SubFin (X,n);
set Xn11 = ElmFin (X,(n + 1));
A9: n <= n + 1 by NAT_1:11;
A10: ( SubFin (X,n) = X | n & ElmFin (X,(n + 1)) = X . (n + 1) ) by Def6, Def3, NAT_1:11;
A11: CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):] by Th10;
let r be Real; :: thesis: for x being Point of (CarProduct X)
for px, prx being n + 1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

let x be Point of (CarProduct X); :: thesis: for px, prx being n + 1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

let px, prx be n + 1 -element FinSequence; :: thesis: ( x = PtCarProduct px & r * x = PtCarProduct prx implies for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) )

assume A12: ( x = PtCarProduct px & r * x = PtCarProduct prx ) ; :: thesis: for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

reconsider px1 = px | n as n -element FinSequence ;
A13: PtCarProduct px = [(PtCarProduct px1),(px . (n + 1))] by Th4;
for i being non zero Nat st i <= n holds
ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i
proof
let i be non zero Nat; :: thesis: ( i <= n implies ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i )
assume A14: i <= n ; :: thesis: ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i
1 <= i by NAT_1:14;
then i in Seg n by A14;
then A15: ( (SubFin (X,n)) . i = X . i & px1 . i = px . i ) by A10, FUNCT_1:49;
ElmFin ((SubFin (X,n)),i) = ElmFin (X,i) by A9, A14, Th13;
hence ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i by A12, A15, A9, A14, Th17, XXREAL_0:2; :: thesis: verum
end;
then reconsider x1 = PtCarProduct px1 as Point of (CarProduct (SubFin (X,n))) by Th16;
reconsider prx1 = prx | n as n -element FinSequence ;
A16: PtCarProduct prx = [(PtCarProduct prx1),(prx . (n + 1))] by Th4;
consider prx2 being n -element FinSequence such that
A17: r * x1 = PtCarProduct prx2 by Th20;
ex pxi being Point of (ElmFin (X,(n + 1))) st pxi = px . (n + 1) by A12, Th17;
then reconsider pxn = px . (n + 1) as Point of (ElmFin (X,(n + 1))) ;
r * x = [(PtCarProduct prx2),(r * pxn)] by A13, A12, A17, A11, PRVECT_3:18;
then A18: ( PtCarProduct prx1 = PtCarProduct prx2 & prx . (n + 1) = r * pxn ) by A12, A16, XTUPLE_0:1;
for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )
proof
let i be non zero Nat; :: thesis: ( i <= n + 1 implies ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) )

assume A19: i <= n + 1 ; :: thesis: ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

A20: 1 <= i by NAT_1:14;
per cases ( i <> n + 1 or i = n + 1 ) ;
suppose i <> n + 1 ; :: thesis: ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

then i < n + 1 by A19, XXREAL_0:1;
then A21: i <= n by NAT_1:13;
then A22: i in Seg n by A20;
A23: prx . i = prx1 . i by A21, FINSEQ_3:112;
A24: px . i = px1 . i by A22, FUNCT_1:49;
ElmFin (X,i) = ElmFin ((SubFin (X,n)),i) by A9, A21, Th13;
hence ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) by A8, A17, A18, A21, A23, A24; :: thesis: verum
end;
suppose i = n + 1 ; :: thesis: ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i )

hence ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) by A18; :: thesis: verum
end;
end;
end;
hence for i being non zero Nat st i <= n + 1 holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) ; :: thesis: verum
end;
for n being non zero Nat holds S1[n] from NAT_1:sch 10(A1, A7);
hence for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence
for r being Real
for x being Point of (CarProduct X)
for px, prx being b1 -element FinSequence st x = PtCarProduct px & r * x = PtCarProduct prx holds
for i being non zero Nat st i <= n holds
ex pxi being Point of (ElmFin (X,i)) st
( pxi = px . i & r * pxi = prx . i ) ; :: thesis: verum