let A be Ordinal; for a, c being Surreal
for s being Sequence of REAL
for z being strictly_decreasing Surreal-Sequence
for S, T being non empty Ordinal
for r being Real st dom z c= T & A in dom z & a == c + (z .. A) holds
Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A)
let a, c be Surreal; for s being Sequence of REAL
for z being strictly_decreasing Surreal-Sequence
for S, T being non empty Ordinal
for r being Real st dom z c= T & A in dom z & a == c + (z .. A) holds
Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A)
let s be Sequence of REAL ; for z being strictly_decreasing Surreal-Sequence
for S, T being non empty Ordinal
for r being Real st dom z c= T & A in dom z & a == c + (z .. A) holds
Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A)
let z be strictly_decreasing Surreal-Sequence; for S, T being non empty Ordinal
for r being Real st dom z c= T & A in dom z & a == c + (z .. A) holds
Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A)
let S, T be non empty Ordinal; for r being Real st dom z c= T & A in dom z & a == c + (z .. A) holds
Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A)
let r be Real; ( dom z c= T & A in dom z & a == c + (z .. A) implies Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A) )
assume that
A1:
dom z c= T
and
A2:
A in dom z
and
A3:
a == c + (z .. A)
; Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) = r * (s . A)
set Y = <%c%>;
A4:
dom <%c%> = Segm 1
by AFINSQ_1:33;
A5:
( 1 = succ {} & succ {} c= S )
by ORDINAL3:8, ORDINAL1:21;
A6:
0 in succ {}
by ORDINAL1:6;
then
( <%c%> .. 0 = <%c%> . 0 & <%c%> . 0 = c )
by A4, Def5;
then A7:
[0,A] in (<%c%>,z,S,T) += a
by A3, A1, A2, A4, A5, A6, Def16;
reconsider OO = [0,A] as Element of [:S,T:] by A1, A2, A5, A6, ZFMISC_1:87;
(<%c%>,z,S,T) += a c= {[0,A]}
proof
A8:
(
<%c%>,
z,
S,
T)
+= a c= [:S,T:]
by FINSUB_1:def 5;
let a1 be
object ;
TARSKI:def 3 ( not a1 in (<%c%>,z,S,T) += a or a1 in {[0,A]} )
assume A9:
a1 in (
<%c%>,
z,
S,
T)
+= a
;
a1 in {[0,A]}
then consider i,
j being
object such that A10:
(
i in S &
j in T &
a1 = [i,j] )
by A8, ZFMISC_1:def 2;
reconsider i =
i,
j =
j as
Ordinal by A10;
A11:
(
i in dom <%c%> &
j in dom z &
(<%c%> .. i) + (z .. j) == a )
by A1, A4, A5, A9, A10, Def16;
A12:
i = {}
by A11, A4, A5, ORDINAL1:8;
then
(
<%c%> .. i = <%c%> . i &
<%c%> . i = c )
by A11, Def5;
then
c + (z .. j) == c + (z .. A)
by A3, A11, SURREALO:4;
then A13:
z .. j == z .. A
by SURREALR:44;
(
z .. j = z . j &
z . j in rng z &
z .. A = z . A &
z . A in rng z )
by A2, A11, Def5, FUNCT_1:def 3;
then
j = A
by A2, A11, A13, Def11, FUNCT_1:def 4;
hence
a1 in {[0,A]}
by A10, A12, TARSKI:def 1;
verum
end;
then
(<%c%>,z,S,T) += a = {.OO.}
by A7, ZFMISC_1:33;
hence Partial_Sums (<%c%>,z,<%r%>,s,a,S,T) =
(Product (<%r%>,s,S,T)) . OO
by SETWISEO:17
.=
(Product (<%r%>,s,S,T)) . (0,A)
by BINOP_1:def 1
.=
(<%r%> . 0) * (s . A)
by Def15, A1, A2, A5, A6
.=
r * (s . A)
;
verum