let m be non zero Nat; :: thesis: for f being PartFunc of REAL,REAL holds XFS2FS ((Step_ (f,m)) | (Segm (m + 1))) = <*(f . 0)*> ^ (step_ (f,(m -' 1)))
let f be PartFunc of REAL,REAL; :: thesis: XFS2FS ((Step_ (f,m)) | (Segm (m + 1))) = <*(f . 0)*> ^ (step_ (f,(m -' 1)))
reconsider m1 = m + 1 as Nat ;
reconsider mm1 = m -' 1 as Nat ;
A1: mm1 + 1 = m by NAT_1:14, XREAL_1:235;
reconsider p = (Step_ (f,m)) | (Segm m1) as XFinSequence of REAL ;
A2: dom (step_ (f,mm1)) = Seg (mm1 + 1) by Def14;
dom <*(f . 0)*> = Seg 1 by FINSEQ_1:def 8;
then A3: len <*(f . 0)*> = 1 by FINSEQ_1:def 3;
A4: dom (Shift (p,1)) = Seg m1 by DBLSEQ_2:45;
A5: len (<*(f . 0)*> ^ (step_ (f,mm1))) = (len <*(f . 0)*>) + (len (step_ (f,mm1))) by FINSEQ_1:22
.= (1 + mm1) + 1 by A2, FINSEQ_1:def 3, A3
.= m1 by NAT_1:14, XREAL_1:235 ;
then A6: dom (<*(f . 0)*> ^ (step_ (f,mm1))) = Seg m1 by FINSEQ_1:def 3;
A7: Shift (((Step_ (f,m)) | (Segm m1)),1) = XFS2FS p by RVSUM_4:def 12;
for x being Nat st x in dom (Shift (((Step_ (f,m)) | (Segm m1)),1)) holds
(Shift (((Step_ (f,m)) | (Segm m1)),1)) . x = (<*(f . 0)*> ^ (step_ (f,mm1))) . x
proof
let x be Nat; :: thesis: ( x in dom (Shift (((Step_ (f,m)) | (Segm m1)),1)) implies (Shift (((Step_ (f,m)) | (Segm m1)),1)) . x = (<*(f . 0)*> ^ (step_ (f,mm1))) . x )
assume A8: x in dom (Shift (((Step_ (f,m)) | (Segm m1)),1)) ; :: thesis: (Shift (((Step_ (f,m)) | (Segm m1)),1)) . x = (<*(f . 0)*> ^ (step_ (f,mm1))) . x
then A9: ( 1 <= x & x <= m + 1 ) by A4, FINSEQ_1:1;
then reconsider x1 = x - 1 as Nat ;
A11: m < m + 1 by XREAL_1:29;
A12: x - 1 <= (m + 1) - 1 by A9, XREAL_1:9;
then A13: x1 < m + 1 by A11, XXREAL_0:2;
A14: (Shift (((Step_ (f,m)) | (Segm m1)),1)) . x = (Shift (((Step_ (f,m)) | (Segm m1)),1)) . (x1 + 1)
.= ((Step_ (f,m)) | (Segm m1)) . x1 by A13, NAT_1:44, VALUED_1:def 12
.= (Step_ (f,m)) . x1 by A13, NAT_1:44, FUNCT_1:49
.= f . (x1 / m) by Def19 ;
(<*(f . 0)*> ^ (step_ (f,mm1))) . x = f . (x1 / m)
proof
per cases ( x = 1 or x <> 1 ) ;
suppose x = 1 ; :: thesis: (<*(f . 0)*> ^ (step_ (f,mm1))) . x = f . (x1 / m)
hence (<*(f . 0)*> ^ (step_ (f,mm1))) . x = f . (x1 / m) ; :: thesis: verum
end;
suppose A16: x <> 1 ; :: thesis: (<*(f . 0)*> ^ (step_ (f,mm1))) . x = f . (x1 / m)
( 1 <= x & x <= m + 1 ) by A8, A4, FINSEQ_1:1;
then 1 < x by A16, XXREAL_0:1;
then 1 - 1 < x1 by XREAL_1:8;
then ( 1 <= x1 & x1 <= m ) by A12, NAT_1:14;
then x1 in Seg m ;
then A19: x1 in dom (step_ (f,mm1)) by Def14, A1;
( len <*(f . 0)*> < x & x <= len (<*(f . 0)*> ^ (step_ (f,mm1))) ) by A16, XXREAL_0:1, A9, A3, A5;
then (<*(f . 0)*> ^ (step_ (f,mm1))) . x = (step_ (f,mm1)) . (x - 1) by A3, FINSEQ_1:24
.= f . (x1 / (mm1 + 1)) by A19, Def14 ;
hence (<*(f . 0)*> ^ (step_ (f,mm1))) . x = f . (x1 / m) by NAT_1:14, XREAL_1:235; :: thesis: verum
end;
end;
end;
hence (Shift (((Step_ (f,m)) | (Segm m1)),1)) . x = (<*(f . 0)*> ^ (step_ (f,mm1))) . x by A14; :: thesis: verum
end;
hence XFS2FS ((Step_ (f,m)) | (Segm (m + 1))) = <*(f . 0)*> ^ (step_ (f,(m -' 1))) by A7, A6, DBLSEQ_2:45; :: thesis: verum