defpred S1[ set , set ] means for k being Nat st k = $1 holds
ex Fr being XFinSequence of st
( dom Fr = k + 1 & ( for n being Nat st n in k + 1 holds
Fr . n = (seq1 . n) * (seq2 . (k -' n)) ) & Sum Fr = $2 );
A1:
for x being set st x in NAT holds
ex y being set st
( y in REAL & S1[x,y] )
proof
let x be
set ;
( x in NAT implies ex y being set st
( y in REAL & S1[x,y] ) )
assume
x in NAT
;
ex y being set st
( y in REAL & S1[x,y] )
then reconsider k =
x as
Element of
NAT ;
defpred S2[
set ,
set ]
means for
i being
Nat st
i = $1 holds
$2
= (seq1 . i) * (seq2 . (k -' i));
A2:
for
i being
Nat st
i in k + 1 holds
ex
z being
Element of
REAL st
S2[
i,
z]
proof
let i be
Nat;
( i in k + 1 implies ex z being Element of REAL st S2[i,z] )
assume
i in k + 1
;
ex z being Element of REAL st S2[i,z]
take
(seq1 . i) * (seq2 . (k -' i))
;
S2[i,(seq1 . i) * (seq2 . (k -' i))]
thus
S2[
i,
(seq1 . i) * (seq2 . (k -' i))]
;
verum
end;
consider Fr being
XFinSequence of
such that A3:
dom Fr = k + 1
and A4:
for
i being
Nat st
i in k + 1 holds
S2[
i,
Fr . i]
from STIRL2_1:sch 5(A2);
take
Sum Fr
;
( Sum Fr in REAL & S1[x, Sum Fr] )
for
n being
Nat st
n in k + 1 holds
Fr . n = (seq1 . n) * (seq2 . (k -' n))
by A4;
hence
(
Sum Fr in REAL &
S1[
x,
Sum Fr] )
by A3, XREAL_0:def 1;
verum
end;
consider seq3 being Real_Sequence such that
A5:
for x being set st x in NAT holds
S1[x,seq3 . x]
from FUNCT_2:sch 1(A1);
for k being Nat ex Fr being XFinSequence of st
( dom Fr = k + 1 & ( for n being Nat st n in k + 1 holds
Fr . n = (seq1 . n) * (seq2 . (k -' n)) ) & Sum Fr = seq3 . k )
hence
ex b1 being Real_Sequence st
for k being Nat ex Fr being XFinSequence of st
( dom Fr = k + 1 & ( for n being Nat st n in k + 1 holds
Fr . n = (seq1 . n) * (seq2 . (k -' n)) ) & Sum Fr = b1 . k )
; verum