let G be non-trivial RealNormSpace-Sequence; :: thesis: for x, y, z, w being Point of (product G)
for i being Element of dom G
for d being Real
for p, q, r being Point of (G . i) st ||.(y - x).|| < d & ||.(z - x).|| < d & p = (proj i) . y & z = (reproj (i,y)) . q & r in [.p,q.] & w = (reproj (i,y)) . r holds
||.(w - x).|| < d

let x, y, z, w be Point of (product G); :: thesis: for i being Element of dom G
for d being Real
for p, q, r being Point of (G . i) st ||.(y - x).|| < d & ||.(z - x).|| < d & p = (proj i) . y & z = (reproj (i,y)) . q & r in [.p,q.] & w = (reproj (i,y)) . r holds
||.(w - x).|| < d

let i be Element of dom G; :: thesis: for d being Real
for p, q, r being Point of (G . i) st ||.(y - x).|| < d & ||.(z - x).|| < d & p = (proj i) . y & z = (reproj (i,y)) . q & r in [.p,q.] & w = (reproj (i,y)) . r holds
||.(w - x).|| < d

let d be Real; :: thesis: for p, q, r being Point of (G . i) st ||.(y - x).|| < d & ||.(z - x).|| < d & p = (proj i) . y & z = (reproj (i,y)) . q & r in [.p,q.] & w = (reproj (i,y)) . r holds
||.(w - x).|| < d

let p, q, r be Point of (G . i); :: thesis: ( ||.(y - x).|| < d & ||.(z - x).|| < d & p = (proj i) . y & z = (reproj (i,y)) . q & r in [.p,q.] & w = (reproj (i,y)) . r implies ||.(w - x).|| < d )
assume that
A2: ( ||.(y - x).|| < d & ||.(z - x).|| < d ) and
A3: ( p = (proj i) . y & z = (reproj (i,y)) . q ) and
A4: r in [.p,q.] and
A5: w = (reproj (i,y)) . r ; :: thesis: ||.(w - x).|| < d
set wx = w - x;
set yx = y - x;
set zx = z - x;
reconsider xi = (proj i) . x as Point of (G . i) ;
r in { (((1 - t) * p) + (t * q)) where t is Real : ( 0 <= t & t <= 1 ) } by A4, RLTOPSP1:def 2;
then consider t being Real such that
a6: ( r = ((1 - t) * p) + (t * q) & 0 <= t & t <= 1 ) ;
A6: ( r = p + (t * (q - p)) & 0 <= t & t <= 1 ) by a6, LmX;
reconsider wx0 = w - x, yx0 = y - x, zx0 = z - x as Element of product (carr G) by LM001;
reconsider Nwx = normsequence (G,wx0) as len G -element FinSequence of REAL ;
reconsider Nyx = normsequence (G,yx0) as len G -element FinSequence of REAL ;
reconsider Nzx = normsequence (G,zx0) as len G -element FinSequence of REAL ;
set tyz = ((1 - t) * (y - x)) + (t * (z - x));
reconsider tyz0 = ((1 - t) * (y - x)) + (t * (z - x)) as Element of product (carr G) by LM001;
reconsider Ntyz = normsequence (G,tyz0) as len G -element FinSequence of REAL ;
A7: 1 = (1 - t) + t ;
r = p + ((t * q) - (t * p)) by A6, RLVECT_1:34
.= (p + (- (t * p))) + (t * q) by RLVECT_1:def 3
.= ((1 * p) - (t * p)) + (t * q) by RLVECT_1:def 8
.= ((1 - t) * p) + (t * q) by RLVECT_1:35 ;
then A8: r - xi = (((1 - t) * p) + (t * q)) - (1 * xi) by RLVECT_1:def 8
.= (((1 - t) * p) + (t * q)) - (((1 - t) * xi) + (t * xi)) by A7, RLVECT_1:def 6
.= ((((1 - t) * p) + (t * q)) - (t * xi)) - ((1 - t) * xi) by RLVECT_1:27
.= (((1 - t) * p) + ((t * q) - (t * xi))) - ((1 - t) * xi) by RLVECT_1:28
.= ((t * q) - (t * xi)) + (((1 - t) * p) - ((1 - t) * xi)) by RLVECT_1:def 3
.= (t * (q - xi)) + (((1 - t) * p) - ((1 - t) * xi)) by RLVECT_1:34
.= (t * (q - xi)) + ((1 - t) * (p - xi)) by RLVECT_1:34 ;
reconsider Swx = w - x as len G -element FinSequence ;
reconsider Syz = ((1 - t) * (y - x)) + (t * (z - x)) as len G -element FinSequence ;
A9: ( dom Swx = Seg (len G) & dom Syz = Seg (len G) ) by FINSEQ_1:89;
Q2: for k being Nat st k in dom Swx holds
Swx . k = Syz . k
proof
let k be Nat; :: thesis: ( k in dom Swx implies Swx . k = Syz . k )
assume k in dom Swx ; :: thesis: Swx . k = Syz . k
then reconsider k0 = k as Element of dom G by A9, FINSEQ_1:def 3;
per cases ( k = i or k <> i ) ;
suppose B0: k = i ; :: thesis: Swx . k = Syz . k
then Swx . k = (proj i) . wx0 by Def1;
then B2: Swx . k = ((proj i) . w) - ((proj i) . x) by YTh9M;
B3: (proj i) . z = q by A3, XTh39;
Syz . k = (proj i) . tyz0 by B0, Def1;
then Syz . k = ((proj i) . ((1 - t) * (y - x))) + ((proj i) . (t * (z - x))) by YTh9;
then Syz . k = ((1 - t) * ((proj i) . (y - x))) + ((proj i) . (t * (z - x))) by YTh16;
then Syz . k = ((1 - t) * ((proj i) . (y - x))) + (t * ((proj i) . (z - x))) by YTh16;
then Syz . k = ((1 - t) * (((proj i) . y) - ((proj i) . x))) + (t * ((proj i) . (z - x))) by YTh9M;
then Syz . k = ((1 - t) * (p - xi)) + (t * (q - xi)) by A3, B3, YTh9M;
hence Swx . k = Syz . k by B2, A8, A5, XTh39; :: thesis: verum
end;
suppose k <> i ; :: thesis: Swx . k = Syz . k
then B4: ( (proj k0) . y = (proj k0) . w & (proj k0) . z = (proj k0) . y ) by A3, A5, XTh40a;
Swx . k = (proj k0) . wx0 by Def1;
then B5: Swx . k = ((proj k0) . w) - ((proj k0) . x) by YTh9M;
Syz . k = (proj k0) . tyz0 by Def1
.= ((proj k0) . ((1 - t) * (y - x))) + ((proj k0) . (t * (z - x))) by YTh9
.= ((1 - t) * ((proj k0) . (y - x))) + ((proj k0) . (t * (z - x))) by YTh16
.= ((1 - t) * ((proj k0) . (y - x))) + (t * ((proj k0) . (z - x))) by YTh16 ;
then Syz . k = ((1 - t) * (((proj k0) . y) - ((proj k0) . x))) + (t * ((proj k0) . (z - x))) by YTh9M;
then Syz . k = ((1 - t) * (((proj k0) . y) - ((proj k0) . x))) + (t * (((proj k0) . y) - ((proj k0) . x))) by B4, YTh9M;
then Syz . k = (((1 - t) * ((proj k0) . y)) - ((1 - t) * ((proj k0) . x))) + (t * (((proj k0) . y) - ((proj k0) . x))) by RLVECT_1:34;
then Syz . k = (((1 - t) * ((proj k0) . y)) - ((1 - t) * ((proj k0) . x))) + ((t * ((proj k0) . y)) - (t * ((proj k0) . x))) by RLVECT_1:34;
then Syz . k = ((((1 - t) * ((proj k0) . y)) - ((1 - t) * ((proj k0) . x))) + (t * ((proj k0) . y))) - (t * ((proj k0) . x)) by RLVECT_1:def 3;
then Syz . k = (((1 - t) * ((proj k0) . y)) - (((1 - t) * ((proj k0) . x)) - (t * ((proj k0) . y)))) - (t * ((proj k0) . x)) by RLVECT_1:29;
then Syz . k = (((1 - t) * ((proj k0) . y)) + ((t * ((proj k0) . y)) + (- ((1 - t) * ((proj k0) . x))))) - (t * ((proj k0) . x)) by RLVECT_1:33;
then Syz . k = ((((1 - t) * ((proj k0) . y)) + (t * ((proj k0) . y))) + (- ((1 - t) * ((proj k0) . x)))) - (t * ((proj k0) . x)) by RLVECT_1:def 3;
then Syz . k = ((((1 - t) + t) * ((proj k0) . y)) + (- ((1 - t) * ((proj k0) . x)))) - (t * ((proj k0) . x)) by RLVECT_1:def 6;
then Syz . k = (((proj k0) . y) + (- ((1 - t) * ((proj k0) . x)))) - (t * ((proj k0) . x)) by RLVECT_1:def 8;
then Syz . k = ((proj k0) . y) + ((- ((1 - t) * ((proj k0) . x))) - (t * ((proj k0) . x))) by RLVECT_1:28;
then Syz . k = ((proj k0) . y) + (- ((t * ((proj k0) . x)) + ((1 - t) * ((proj k0) . x)))) by RLVECT_1:30;
then Syz . k = ((proj k0) . y) + (- ((t + (1 - t)) * ((proj k0) . x))) by RLVECT_1:def 6;
hence Swx . k = Syz . k by B5, B4, RLVECT_1:def 8; :: thesis: verum
end;
end;
end;
P2: ( len Nwx = len G & len Ntyz = len G ) by CARD_1:def 7;
for k being Element of NAT st k in Seg (len Nwx) holds
( 0 <= Nwx . k & Nwx . k <= Ntyz . k )
proof
let k be Element of NAT ; :: thesis: ( k in Seg (len Nwx) implies ( 0 <= Nwx . k & Nwx . k <= Ntyz . k ) )
assume Q3: k in Seg (len Nwx) ; :: thesis: ( 0 <= Nwx . k & Nwx . k <= Ntyz . k )
then reconsider k1 = k as Element of dom G by P2, FINSEQ_1:def 3;
reconsider wxk = wx0 . k1 as Element of (G . k1) ;
Q1: Nwx . k = ||.wxk.|| by PRVECT_2:def 11;
wx0 . k1 = Syz . k by Q2, Q3, P2, A9;
hence ( 0 <= Nwx . k & Nwx . k <= Ntyz . k ) by Q1, PRVECT_2:def 11; :: thesis: verum
end;
then P3: |.Nwx.| <= |.Ntyz.| by P2, PRVECT_2:2;
P4: ||.(w - x).|| = (productnorm G) . (w - x) by PRVECT_2:def 13;
||.(((1 - t) * (y - x)) + (t * (z - x))).|| = (productnorm G) . (((1 - t) * (y - x)) + (t * (z - x))) by PRVECT_2:def 13
.= |.(normsequence (G,tyz0)).| by PRVECT_2:def 12 ;
then P5: ||.(w - x).|| <= ||.(((1 - t) * (y - x)) + (t * (z - x))).|| by P3, P4, PRVECT_2:def 12;
P7: ||.(((1 - t) * (y - x)) + (t * (z - x))).|| <= ((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) by NORMSP_1:5;
1 - t >= 0 by A6, XREAL_1:48;
then P8: ( abs (1 - t) = 1 - t & abs t = t ) by A6, ABSVALUE:def 1;
((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) < d
proof
per cases ( t = 1 or t = 0 or ( t <> 1 & t <> 0 ) ) ;
suppose ( t = 1 or t = 0 ) ; :: thesis: ((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) < d
hence ((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) < d by A2, P8; :: thesis: verum
end;
suppose ( t <> 1 & t <> 0 ) ; :: thesis: ((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) < d
then ( 0 < t & t < 1 ) by A6, XXREAL_0:1;
then ( 0 < t & 1 - t > 0 ) by XREAL_1:50;
then ( (abs (1 - t)) * ||.(y - x).|| < (1 - t) * d & (abs t) * ||.(z - x).|| < t * d ) by A2, P8, XREAL_1:68;
then ((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) < ((1 - t) * d) + (t * d) by XREAL_1:8;
hence ((abs (1 - t)) * ||.(y - x).||) + ((abs t) * ||.(z - x).||) < d ; :: thesis: verum
end;
end;
end;
then ||.(((1 - t) * (y - x)) + (t * (z - x))).|| < d by P7, XXREAL_0:2;
hence ||.(w - x).|| < d by P5, XXREAL_0:2; :: thesis: verum