defpred S1[ non zero Nat] means for X being $1 -element RealNormSpace-Sequence
for x, y being Point of (CarProduct X)
for px, py being $1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py holds
ex pxy being $1 -element FinSequence st x + y = PtCarProduct pxy;
A1: S1[1]
proof
let X be 1 -element RealNormSpace-Sequence; :: thesis: for x, y being Point of (CarProduct X)
for px, py being 1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py holds
ex pxy being 1 -element FinSequence st x + y = PtCarProduct pxy

set X1 = ElmFin (X,1);
ElmFin (X,1) = X . 1 by Def3;
then A2: CarProduct X = ElmFin (X,1) by Def4;
let x, y be Point of (CarProduct X); :: thesis: for px, py being 1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py holds
ex pxy being 1 -element FinSequence st x + y = PtCarProduct pxy

let px, py be 1 -element FinSequence; :: thesis: ( x = PtCarProduct px & y = PtCarProduct py implies ex pxy being 1 -element FinSequence st x + y = PtCarProduct pxy )
assume A3: ( x = PtCarProduct px & y = PtCarProduct py ) ; :: thesis: ex pxy being 1 -element FinSequence st x + y = PtCarProduct pxy
A4: PtCarProduct px = px . 1 by Def1;
ex pxi being Point of (ElmFin (X,1)) st pxi = px . 1 by A3, Th17;
then reconsider px1 = px . 1 as Point of (ElmFin (X,1)) ;
ex pyi being Point of (ElmFin (X,1)) st pyi = py . 1 by A3, Th17;
then reconsider py1 = py . 1 as Point of (ElmFin (X,1)) ;
reconsider pxy = <*(px1 + py1)*> as 1 -element FinSequence ;
take pxy ; :: thesis: x + y = PtCarProduct pxy
(PtProdFinSeq pxy) . 1 = pxy . 1 by Def1;
hence x + y = PtCarProduct pxy by A2, A3, A4, Def1; :: thesis: verum
end;
A5: 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 A6: S1[n] ; :: thesis: S1[n + 1]
let X be n + 1 -element RealNormSpace-Sequence; :: thesis: for x, y being Point of (CarProduct X)
for px, py being n + 1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py holds
ex pxy being n + 1 -element FinSequence st x + y = PtCarProduct pxy

set Xn1 = SubFin (X,n);
set Xn11 = ElmFin (X,(n + 1));
A7: n <= n + 1 by NAT_1:11;
A8: ( SubFin (X,n) = X | n & ElmFin (X,(n + 1)) = X . (n + 1) ) by Def3, Def6, NAT_1:11;
A9: CarProduct X = [:(CarProduct (SubFin (X,n))),(ElmFin (X,(n + 1))):] by Th10;
let x, y be Point of (CarProduct X); :: thesis: for px, py being n + 1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py holds
ex pxy being n + 1 -element FinSequence st x + y = PtCarProduct pxy

let px, py be n + 1 -element FinSequence; :: thesis: ( x = PtCarProduct px & y = PtCarProduct py implies ex pxy being n + 1 -element FinSequence st x + y = PtCarProduct pxy )
assume A10: ( x = PtCarProduct px & y = PtCarProduct py ) ; :: thesis: ex pxy being n + 1 -element FinSequence st x + y = PtCarProduct pxy
reconsider px1 = px | n as n -element FinSequence ;
A11: 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 A12: 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 A12;
then A13: ( (SubFin (X,n)) . i = X . i & px1 . i = px . i ) by A8, FUNCT_1:49;
ElmFin (X,i) = ElmFin ((SubFin (X,n)),i) by A7, A12, Th13;
hence ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i by A13, A7, A12, A10, Th17, XXREAL_0:2; :: thesis: verum
end;
then reconsider x1 = PtCarProduct px1 as Point of (CarProduct (SubFin (X,n))) by Th16;
reconsider py1 = py | n as n -element FinSequence ;
A14: PtCarProduct py = [(PtCarProduct py1),(py . (n + 1))] by Th4;
for i being non zero Nat st i <= n holds
ex py1i being Point of (ElmFin ((SubFin (X,n)),i)) st py1i = py1 . i
proof
let i be non zero Nat; :: thesis: ( i <= n implies ex py1i being Point of (ElmFin ((SubFin (X,n)),i)) st py1i = py1 . i )
assume A15: i <= n ; :: thesis: ex py1i being Point of (ElmFin ((SubFin (X,n)),i)) st py1i = py1 . i
1 <= i by NAT_1:14;
then i in Seg n by A15;
then A16: ( (SubFin (X,n)) . i = X . i & py1 . i = py . i ) by A8, FUNCT_1:49;
ElmFin (X,i) = ElmFin ((SubFin (X,n)),i) by A7, A15, Th13;
hence ex py1i being Point of (ElmFin ((SubFin (X,n)),i)) st py1i = py1 . i by A7, A15, A16, A10, Th17, XXREAL_0:2; :: thesis: verum
end;
then reconsider y1 = PtCarProduct py1 as Point of (CarProduct (SubFin (X,n))) by Th16;
consider pxy1 being n -element FinSequence such that
A17: x1 + y1 = PtCarProduct pxy1 by A6;
ex pxi being Point of (ElmFin (X,(n + 1))) st pxi = px . (n + 1) by A10, Th17;
then reconsider pxn = px . (n + 1) as Point of (ElmFin (X,(n + 1))) ;
ex pyi being Point of (ElmFin (X,(n + 1))) st pyi = py . (n + 1) by A10, Th17;
then reconsider pyn = py . (n + 1) as Point of (ElmFin (X,(n + 1))) ;
A18: x + y = [(PtCarProduct pxy1),(pxn + pyn)] by A10, A11, A14, A17, A9, PRVECT_3:18;
reconsider pxy = pxy1 ^ <*(pxn + pyn)*> as n + 1 -element FinSequence ;
take pxy ; :: thesis: x + y = PtCarProduct pxy
A19: len pxy1 = n by CARD_1:def 7;
then A20: pxy . (n + 1) = pxn + pyn by FINSEQ_1:42;
dom pxy1 = Seg n by A19, FINSEQ_1:def 3;
then pxy1 = pxy | n by FINSEQ_1:21;
hence x + y = PtCarProduct pxy by A20, A18, Th4; :: thesis: verum
end;
for n being non zero Nat holds S1[n] from NAT_1:sch 10(A1, A5);
hence for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence
for x, y being Point of (CarProduct X)
for px, py being b1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py holds
ex pxy being b1 -element FinSequence st x + y = PtCarProduct pxy ; :: thesis: verum