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

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, pz being 1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py & x + y = PtCarProduct pz holds
for i being non zero Nat st i <= 1 holds
ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i )

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

assume A3: ( x = PtCarProduct px & y = PtCarProduct py & x + y = PtCarProduct pz ) ; :: thesis: for i being non zero Nat st i <= 1 holds
ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i )

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 ;
ex pzi being Point of (ElmFin (X,1)) st pzi = pz . 1 by A3, Th17;
then reconsider pz1 = pz . 1 as Point of (ElmFin (X,1)) ;
A4: ( x = px . 1 & y = py . 1 & x + y = pz . 1 ) by A3, Def1;
hereby :: thesis: verum
let i be non zero Nat; :: thesis: ( i <= 1 implies ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i ) )

assume A5: i <= 1 ; :: thesis: ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i )

1 <= i by NAT_1:14;
then i = 1 by A5, XXREAL_0:1;
hence ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i ) by A2, A4; :: thesis: verum
end;
end;
A6: 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 A7: 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, pz being n + 1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py & x + y = PtCarProduct pz holds
for i being non zero Nat st i <= n + 1 holds
ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i )

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

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

assume A11: ( x = PtCarProduct px & y = PtCarProduct py & x + y = PtCarProduct pz ) ; :: thesis: for i being non zero Nat st i <= n + 1 holds
ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i )

reconsider px1 = px | n as n -element FinSequence ;
A12: 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 A13: 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 A13;
then A14: ( (SubFin (X,n)) . i = X . i & px1 . i = px . i ) by A9, FUNCT_1:49;
ElmFin (X,i) = ElmFin ((SubFin (X,n)),i) by A8, A13, Th13;
hence ex px1i being Point of (ElmFin ((SubFin (X,n)),i)) st px1i = px1 . i by A14, A8, A13, A11, 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 ;
A15: 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 A16: 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 A16;
then A17: ( (SubFin (X,n)) . i = X . i & py1 . i = py . i ) by A9, FUNCT_1:49;
ElmFin (X,i) = ElmFin ((SubFin (X,n)),i) by A8, A16, Th13;
hence ex py1i being Point of (ElmFin ((SubFin (X,n)),i)) st py1i = py1 . i by A8, A16, A17, A11, Th17, XXREAL_0:2; :: thesis: verum
end;
then reconsider y1 = PtCarProduct py1 as Point of (CarProduct (SubFin (X,n))) by Th16;
reconsider pz1 = pz | n as n -element FinSequence ;
A18: PtCarProduct pz = [(PtCarProduct pz1),(pz . (n + 1))] by Th4;
consider pxy1 being n -element FinSequence such that
A19: x1 + y1 = PtCarProduct pxy1 by Th18;
ex pxi being Point of (ElmFin (X,(n + 1))) st pxi = px . (n + 1) by A11, 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 A11, Th17;
then reconsider pyn = py . (n + 1) as Point of (ElmFin (X,(n + 1))) ;
x + y = [(PtCarProduct pxy1),(pxn + pyn)] by A11, A12, A15, A10, A19, PRVECT_3:18;
then A20: ( PtCarProduct pxy1 = PtCarProduct pz1 & pxn + pyn = pz . (n + 1) ) by A11, A18, XTUPLE_0:1;
then A21: pxy1 = pz1 by Th5;
hereby :: thesis: verum
let i be non zero Nat; :: thesis: ( i <= n + 1 implies ex pxi, pyi being Point of (ElmFin (X,pxi)) st
( pyi = px . pxi & b3 = py . pxi & pyi + b3 = pz . pxi ) )

assume A22: i <= n + 1 ; :: thesis: ex pxi, pyi being Point of (ElmFin (X,pxi)) st
( pyi = px . pxi & b3 = py . pxi & pyi + b3 = pz . pxi )

A23: 1 <= i by NAT_1:14;
per cases ( i <> n + 1 or i = n + 1 ) ;
suppose i <> n + 1 ; :: thesis: ex pxi, pyi being Point of (ElmFin (X,pxi)) st
( pyi = px . pxi & b3 = py . pxi & pyi + b3 = pz . pxi )

then i < n + 1 by A22, XXREAL_0:1;
then A24: i <= n by NAT_1:13;
then A25: i in Seg n by A23;
A26: pz . i = pxy1 . i by A21, A24, FINSEQ_3:112;
A27: ( px . i = px1 . i & py . i = py1 . i ) by FUNCT_1:49, A25;
ElmFin (X,i) = ElmFin ((SubFin (X,n)),i) by A8, A24, Th13;
hence ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i ) by A7, A19, A24, A26, A27; :: thesis: verum
end;
suppose i = n + 1 ; :: thesis: ex pxi, pyi being Point of (ElmFin (X,pxi)) st
( pyi = px . pxi & b3 = py . pxi & pyi + b3 = pz . pxi )

hence ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i ) by A20; :: thesis: verum
end;
end;
end;
end;
for n being non zero Nat holds S1[n] from NAT_1:sch 10(A1, A6);
hence for n being non zero Nat
for X being b1 -element RealNormSpace-Sequence
for x, y, z being Point of (CarProduct X)
for px, py, pz being b1 -element FinSequence st x = PtCarProduct px & y = PtCarProduct py & x + y = PtCarProduct pz holds
for i being non zero Nat st i <= n holds
ex pxi, pyi being Point of (ElmFin (X,i)) st
( pxi = px . i & pyi = py . i & pxi + pyi = pz . i ) ; :: thesis: verum