let i, j, k, n be non zero Nat; :: thesis: for X being n -element RealNormSpace-Sequence st i <= j & j <= k & k <= n holds
(ProdFinSeq (SubFin (X,j))) . i = (ProdFinSeq (SubFin (X,k))) . i

let X be n -element RealNormSpace-Sequence; :: thesis: ( i <= j & j <= k & k <= n implies (ProdFinSeq (SubFin (X,j))) . i = (ProdFinSeq (SubFin (X,k))) . i )
assume that
A1: i <= j and
A2: j <= k and
A3: k <= n ; :: thesis: (ProdFinSeq (SubFin (X,j))) . i = (ProdFinSeq (SubFin (X,k))) . i
( 1 <= j & 1 <= k ) by NAT_1:14;
then A4: ( 1 in Seg j & 1 in Seg k ) ;
defpred S1[ Nat] means ( 1 <= $1 & $1 <= j implies (ProdFinSeq (SubFin (X,j))) . $1 = (ProdFinSeq (SubFin (X,k))) . $1 );
A5: S1[ 0 ] ;
A6: for m being Nat st S1[m] holds
S1[m + 1]
proof
let m be Nat; :: thesis: ( S1[m] implies S1[m + 1] )
assume A7: S1[m] ; :: thesis: S1[m + 1]
assume A8: ( 1 <= m + 1 & m + 1 <= j ) ; :: thesis: (ProdFinSeq (SubFin (X,j))) . (m + 1) = (ProdFinSeq (SubFin (X,k))) . (m + 1)
then A9: m < j by NAT_1:13;
A10: m + 1 <= k by A8, A2, XXREAL_0:2;
then A11: ( m + 1 in Seg j & m + 1 in Seg k ) by A8;
( SubFin (X,j) = X | j & SubFin (X,k) = X | k ) by A2, A3, Def6, XXREAL_0:2;
then A12: ( (SubFin (X,j)) . (m + 1) = X . (m + 1) & (SubFin (X,k)) . (m + 1) = X . (m + 1) ) by A11, FUNCT_1:49;
per cases ( m = 0 or m <> 0 ) ;
suppose m = 0 ; :: thesis: (ProdFinSeq (SubFin (X,j))) . (m + 1) = (ProdFinSeq (SubFin (X,k))) . (m + 1)
then ( (ProdFinSeq (SubFin (X,j))) . (m + 1) = (SubFin (X,j)) . 1 & (ProdFinSeq (SubFin (X,k))) . (m + 1) = (SubFin (X,k)) . 1 ) by Def4;
then ( (ProdFinSeq (SubFin (X,j))) . (m + 1) = (X | j) . 1 & (ProdFinSeq (SubFin (X,k))) . (m + 1) = (X | k) . 1 ) by A2, A3, Def6, XXREAL_0:2;
then ( (ProdFinSeq (SubFin (X,j))) . (m + 1) = X . 1 & (ProdFinSeq (SubFin (X,k))) . (m + 1) = X . 1 ) by A4, FUNCT_1:49;
hence (ProdFinSeq (SubFin (X,j))) . (m + 1) = (ProdFinSeq (SubFin (X,k))) . (m + 1) ; :: thesis: verum
end;
suppose A13: m <> 0 ; :: thesis: (ProdFinSeq (SubFin (X,j))) . (m + 1) = (ProdFinSeq (SubFin (X,k))) . (m + 1)
then reconsider m1 = m as non zero Nat ;
reconsider j1 = j - 1 as non zero Nat by A13, A8, NAT_1:13, NAT_1:14, NAT_1:20;
1 <= m by A13, NAT_1:14;
then 1 < j by A9, XXREAL_0:2;
then 1 < k by A2, XXREAL_0:2;
then reconsider k1 = k - 1 as non zero Nat by NAT_1:20;
m1 < k1 + 1 by A10, NAT_1:13;
then A14: ex X1, X2 being RealNormSpace st
( X1 = (ProdFinSeq (SubFin (X,(k1 + 1)))) . m1 & X2 = (SubFin (X,(k1 + 1))) . (m1 + 1) & (ProdFinSeq (SubFin (X,(k1 + 1)))) . (m1 + 1) = [:X1,X2:] ) by Def4;
ex Y1, Y2 being RealNormSpace st
( Y1 = (ProdFinSeq (SubFin (X,(j1 + 1)))) . m1 & Y2 = (SubFin (X,(j1 + 1))) . (m1 + 1) & (ProdFinSeq (SubFin (X,(j1 + 1)))) . (m1 + 1) = [:Y1,Y2:] ) by A9, Def4;
hence (ProdFinSeq (SubFin (X,j))) . (m + 1) = (ProdFinSeq (SubFin (X,k))) . (m + 1) by A7, A8, A12, A14, NAT_1:13, NAT_1:14; :: thesis: verum
end;
end;
end;
A15: for m being Nat holds S1[m] from NAT_1:sch 2(A5, A6);
1 <= i by NAT_1:14;
hence (ProdFinSeq (SubFin (X,j))) . i = (ProdFinSeq (SubFin (X,k))) . i by A1, A15; :: thesis: verum