let a be Nat; for ft being FinSequence of REAL st a in dom ft holds
(Product (Del (ft,a))) * (ft . a) = Product ft
let ft be FinSequence of REAL ; ( a in dom ft implies (Product (Del (ft,a))) * (ft . a) = Product ft )
defpred S1[ Nat] means ( $1 in dom ft implies (ft . $1) * (Product (Del (ft,$1))) = Product ft );
A1:
for a being Nat st S1[a] holds
S1[a + 1]
proof
let a be
Nat;
( S1[a] implies S1[a + 1] )
assume
S1[
a]
;
S1[a + 1]
now S1[a + 1]per cases
( a = 0 or ( a > 0 & a < len ft ) or a >= len ft )
;
suppose
(
a > 0 &
a < len ft )
;
S1[a + 1]then
(
a + 1
>= 1 &
a + 1
<= len ft )
by NAT_1:11, NAT_1:13;
then A3:
a + 1
in dom ft
by FINSEQ_3:25;
then consider fs1,
fs2 being
FinSequence such that A4:
ft = (fs1 ^ <*(ft . (a + 1))*>) ^ fs2
and A5:
len fs1 = (a + 1) - 1
and
len fs2 = (len ft) - (a + 1)
by Lm10;
A6:
Del (
ft,
(a + 1))
= fs1 ^ fs2
by A3, A4, A5, Lm11;
reconsider fs2 =
fs2 as
FinSequence of
REAL by A4, FINSEQ_1:36;
reconsider fs1 =
fs1 as
FinSequence of
REAL by A6, FINSEQ_1:36;
Product ft =
(Product (fs1 ^ <*(ft . (a + 1))*>)) * (Product fs2)
by A4, RVSUM_1:97
.=
((Product fs1) * (Product <*(ft . (a + 1))*>)) * (Product fs2)
by RVSUM_1:97
.=
((ft . (a + 1)) * (Product fs1)) * (Product fs2)
.=
(ft . (a + 1)) * ((Product fs1) * (Product fs2))
;
hence
S1[
a + 1]
by A6, RVSUM_1:97;
verum end; end; end;
hence
S1[
a + 1]
;
verum
end;
A7:
S1[ 0 ]
by FINSEQ_3:25;
for a being Nat holds S1[a]
from NAT_1:sch 2(A7, A1);
hence
( a in dom ft implies (Product (Del (ft,a))) * (ft . a) = Product ft )
; verum