let a be Surreal; for r1, r2, r12, s being Sequence of REAL
for y1, y2, y12, z being strictly_decreasing Surreal-Sequence
for S, T being non empty Ordinal st y1 ^ y2 = y12 & r1 ^ r2 = r12 & dom y12 c= S & dom z c= T & dom y1 = dom r1 & dom y2 c= dom r2 holds
Partial_Sums (y12,z,r12,s,a,S,T) = (Partial_Sums (y1,z,r1,s,a,S,T)) + (Partial_Sums (y2,z,r2,s,a,S,T))
let r1, r2, r12, s be Sequence of REAL ; for y1, y2, y12, z being strictly_decreasing Surreal-Sequence
for S, T being non empty Ordinal st y1 ^ y2 = y12 & r1 ^ r2 = r12 & dom y12 c= S & dom z c= T & dom y1 = dom r1 & dom y2 c= dom r2 holds
Partial_Sums (y12,z,r12,s,a,S,T) = (Partial_Sums (y1,z,r1,s,a,S,T)) + (Partial_Sums (y2,z,r2,s,a,S,T))
let y1, y2, y12, z be strictly_decreasing Surreal-Sequence; for S, T being non empty Ordinal st y1 ^ y2 = y12 & r1 ^ r2 = r12 & dom y12 c= S & dom z c= T & dom y1 = dom r1 & dom y2 c= dom r2 holds
Partial_Sums (y12,z,r12,s,a,S,T) = (Partial_Sums (y1,z,r1,s,a,S,T)) + (Partial_Sums (y2,z,r2,s,a,S,T))
let S, T be non empty Ordinal; ( y1 ^ y2 = y12 & r1 ^ r2 = r12 & dom y12 c= S & dom z c= T & dom y1 = dom r1 & dom y2 c= dom r2 implies Partial_Sums (y12,z,r12,s,a,S,T) = (Partial_Sums (y1,z,r1,s,a,S,T)) + (Partial_Sums (y2,z,r2,s,a,S,T)) )
assume that
A1:
( y1 ^ y2 = y12 & r1 ^ r2 = r12 & dom y12 c= S & dom z c= T )
and
A2:
( dom y1 = dom r1 & dom y2 c= dom r2 )
; Partial_Sums (y12,z,r12,s,a,S,T) = (Partial_Sums (y1,z,r1,s,a,S,T)) + (Partial_Sums (y2,z,r2,s,a,S,T))
set S1 = (y1,z,S,T) += a;
set S2 = (y2,z,S,T) += a;
set S12 = (y12,z,S,T) += a;
set AD1 = Product (r1,s,S,T);
set AD2 = Product (r2,s,S,T);
set AD12 = Product (r12,s,S,T);
A3:
( dom y1 c= (dom y1) +^ (dom y2) & (dom y1) +^ (dom y2) = dom y12 & dom y2 c= (dom y1) +^ (dom y2) )
by A1, ORDINAL3:24, ORDINAL4:def 1;
then A4:
( dom y1 c= S & dom y2 c= S )
by A1;
then A5:
Partial_Sums (y1,z,r1,s,a,S,T) = Partial_Sums (y1,z,r12,s,a,S,T)
by Th85, A1, A2;
set SS = ((y12,z,S,T) += a) \ ((y1,z,S,T) += a);
A6:
(y1,z,S,T) += a c= [:S,T:]
by FINSUB_1:def 5;
A7:
((y1,z,S,T) += a) \/ (((y12,z,S,T) += a) \ ((y1,z,S,T) += a)) = ((y12,z,S,T) += a) \/ ((y1,z,S,T) += a)
by XBOOLE_1:39;
(y1,z,S,T) += a c= (y12,z,S,T) += a
proof
let x be
object ;
TARSKI:def 3 ( not x in (y1,z,S,T) += a or x in (y12,z,S,T) += a )
assume A8:
x in (
y1,
z,
S,
T)
+= a
;
x in (y12,z,S,T) += a
consider i,
j being
object such that A9:
(
i in S &
j in T &
x = [i,j] )
by A6, A8, ZFMISC_1:def 2;
reconsider i =
i,
j =
j as
Ordinal by A9;
A10:
(
i in dom y1 &
j in dom z &
(y1 .. i) + (z .. j) == a )
by A4, A9, A1, A8, Def16;
(
y1 .. i = y1 . i &
y1 . i = y12 . i &
y12 . i = y12 .. i )
by A10, A3, Def5, A1, ORDINAL4:def 1;
hence
x in (
y12,
z,
S,
T)
+= a
by A9, A10, A3, A1, Def16;
verum
end;
then A11:
((y1,z,S,T) += a) \/ (((y12,z,S,T) += a) \ ((y1,z,S,T) += a)) = (y12,z,S,T) += a
by A7, XBOOLE_1:12;
A12:
((y12,z,S,T) += a) \ ((y1,z,S,T) += a) misses (y1,z,S,T) += a
by XBOOLE_1:79;
A13:
( ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) c= [:S,T:] & (y2,z,S,T) += a c= [:S,T:] )
by FINSUB_1:def 5;
defpred S1[ object , object ] means for i, j being Ordinal st $1 = [i,j] holds
$2 = [(i -^ (dom y1)),j];
A14:
for e being object st e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) holds
ex u being object st S1[e,u]
proof
let e be
object ;
( e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) implies ex u being object st S1[e,u] )
assume
e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
;
ex u being object st S1[e,u]
then consider i,
j being
object such that A15:
(
i in S &
j in T &
e = [i,j] )
by A13, ZFMISC_1:def 2;
reconsider i =
i,
j =
j as
Ordinal by A15;
take
[(i -^ (dom y1)),j]
;
S1[e,[(i -^ (dom y1)),j]]
let i1,
j1 be
Ordinal;
( e = [i1,j1] implies [(i -^ (dom y1)),j] = [(i1 -^ (dom y1)),j1] )
assume
e = [i1,j1]
;
[(i -^ (dom y1)),j] = [(i1 -^ (dom y1)),j1]
then
(
i1 = i &
j1 = j )
by A15, XTUPLE_0:1;
hence
[(i -^ (dom y1)),j] = [(i1 -^ (dom y1)),j1]
;
verum
end;
consider TR being Function such that
A16:
( dom TR = ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) & ( for e being object st e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) holds
S1[e,TR . e] ) )
from CLASSES1:sch 1(A14);
A17:
for i, j being Ordinal holds
( [i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) iff ( dom y1 c= i & [(i -^ (dom y1)),j] in (y2,z,S,T) += a ) )
proof
let i,
j be
Ordinal;
( [i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) iff ( dom y1 c= i & [(i -^ (dom y1)),j] in (y2,z,S,T) += a ) )
set D =
i -^ (dom y1);
thus
(
[i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) implies (
dom y1 c= i &
[(i -^ (dom y1)),j] in (
y2,
z,
S,
T)
+= a ) )
( dom y1 c= i & [(i -^ (dom y1)),j] in (y2,z,S,T) += a implies [i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) )proof
assume
[i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
;
( dom y1 c= i & [(i -^ (dom y1)),j] in (y2,z,S,T) += a )
then A18:
(
[i,j] in (
y12,
z,
S,
T)
+= a & not
[i,j] in (
y1,
z,
S,
T)
+= a )
by XBOOLE_0:def 5;
then A19:
(
i in dom y12 &
j in dom z &
(y12 .. i) + (z .. j) == a )
by A1, Def16;
then A20:
y12 .. i = y12 . i
by Def5;
A21:
not
i in dom y1
hence
dom y1 c= i
by ORDINAL1:16;
[(i -^ (dom y1)),j] in (y2,z,S,T) += a
A23:
(dom y1) +^ (i -^ (dom y1)) = i
by A21, ORDINAL1:16, Th3;
(
(dom y1) +^ (i -^ (dom y1)) in (dom y1) +^ (dom y2) & not
(dom y1) +^ (i -^ (dom y1)) in (dom y1) +^ (i -^ (dom y1)) )
by A21, ORDINAL1:16, Th3, A3, A19;
then
not
(dom y1) +^ (dom y2) c= (dom y1) +^ (i -^ (dom y1))
;
then A24:
i -^ (dom y1) in dom y2
by ORDINAL1:16, ORDINAL2:33;
then
(
y2 . (i -^ (dom y1)) = y2 .. (i -^ (dom y1)) &
y12 . i = y2 . (i -^ (dom y1)) )
by A1, Def5, A23, ORDINAL4:def 1;
hence
[(i -^ (dom y1)),j] in (
y2,
z,
S,
T)
+= a
by A24, A19, A20, A1, A4, Def16;
verum
end;
assume A25:
(
dom y1 c= i &
[(i -^ (dom y1)),j] in (
y2,
z,
S,
T)
+= a )
;
[i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
then A26:
(
i -^ (dom y1) in dom y2 &
j in dom z &
(y2 .. (i -^ (dom y1))) + (z .. j) == a )
by A1, A4, Def16;
A27:
(dom y1) +^ (i -^ (dom y1)) = i
by Th3, A25;
then A28:
(
y2 . (i -^ (dom y1)) = y2 .. (i -^ (dom y1)) &
y12 . i = y2 . (i -^ (dom y1)) )
by A1, Def5, A26, ORDINAL4:def 1;
A29:
i in dom y12
by A3, A27, A26, ORDINAL2:32;
y12 . i = y12 .. i
by A3, A27, A26, ORDINAL2:32, Def5;
then A30:
[i,j] in (
y12,
z,
S,
T)
+= a
by A26, A28, A29, A1, Def16;
not
[i,j] in (
y1,
z,
S,
T)
+= a
hence
[i,j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
by A30, XBOOLE_0:def 5;
verum
end;
A31:
rng TR c= (y2,z,S,T) += a
proof
let f be
object ;
TARSKI:def 3 ( not f in rng TR or f in (y2,z,S,T) += a )
assume
f in rng TR
;
f in (y2,z,S,T) += a
then consider e being
object such that A32:
(
e in dom TR &
TR . e = f )
by FUNCT_1:def 3;
consider i,
j being
object such that A33:
(
i in S &
j in T &
e = [i,j] )
by A32, A16, A13, ZFMISC_1:def 2;
reconsider i =
i,
j =
j as
Ordinal by A33;
(
TR . [i,j] = [(i -^ (dom y1)),j] &
[(i -^ (dom y1)),j] in (
y2,
z,
S,
T)
+= a )
by A16, A32, A33, A17;
hence
f in (
y2,
z,
S,
T)
+= a
by A32, A33;
verum
end;
(y2,z,S,T) += a c= rng TR
proof
let f be
object ;
TARSKI:def 3 ( not f in (y2,z,S,T) += a or f in rng TR )
assume A34:
f in (
y2,
z,
S,
T)
+= a
;
f in rng TR
then consider i,
j being
object such that A35:
(
i in S &
j in T &
f = [i,j] )
by A13, ZFMISC_1:def 2;
reconsider i =
i,
j =
j as
Ordinal by A35;
set D =
(dom y1) +^ i;
A36:
dom y1 c= (dom y1) +^ i
by ORDINAL3:24;
A37:
((dom y1) +^ i) -^ (dom y1) = i
by ORDINAL3:52;
A38:
[((dom y1) +^ i),j] in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
by ORDINAL3:24, A37, A17, A34, A35;
TR . [((dom y1) +^ i),j] = f
by A35, A37, A16, A36, A17, A34;
hence
f in rng TR
by A38, A16, FUNCT_1:def 3;
verum
end;
then A39:
rng TR = (y2,z,S,T) += a
by A31;
A40:
TR is one-to-one
proof
let x1,
x2 be
object ;
FUNCT_1:def 4 ( not x1 in dom TR or not x2 in dom TR or not TR . x1 = TR . x2 or x1 = x2 )
assume A41:
(
x1 in dom TR &
x2 in dom TR &
TR . x1 = TR . x2 )
;
x1 = x2
consider i1,
j1 being
object such that A42:
(
i1 in S &
j1 in T &
x1 = [i1,j1] )
by A41, A16, A13, ZFMISC_1:def 2;
consider i2,
j2 being
object such that A43:
(
i2 in S &
j2 in T &
x2 = [i2,j2] )
by A41, A16, A13, ZFMISC_1:def 2;
reconsider i1 =
i1,
i2 =
i2,
j1 =
j1,
j2 =
j2 as
Ordinal by A42, A43;
A44:
(
TR . x1 = [(i1 -^ (dom y1)),j1] &
TR . x2 = [(i2 -^ (dom y1)),j2] )
by A16, A41, A42, A43;
then
(
j1 = j2 &
i1 -^ (dom y1) = i2 -^ (dom y1) )
by A41, XTUPLE_0:1;
then
(
i1 = (dom y1) +^ (i2 -^ (dom y1)) &
(dom y1) +^ (i2 -^ (dom y1)) = i2 )
by A17, A42, A43, A16, A41, Th3;
hence
x1 = x2
by A42, A43, A44, A41, XTUPLE_0:1;
verum
end;
dom (Product (r2,s,S,T)) = [:S,T:]
by FUNCT_2:def 1;
then A45:
dom ((Product (r2,s,S,T)) * TR) = dom TR
by A13, A39, RELAT_1:27;
dom (Product (r12,s,S,T)) = [:S,T:]
by FUNCT_2:def 1;
then A46:
dom ((Product (r12,s,S,T)) | (((y12,z,S,T) += a) \ ((y1,z,S,T) += a))) = ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
by A13, RELAT_1:62;
for e being object st e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) holds
((Product (r12,s,S,T)) | (((y12,z,S,T) += a) \ ((y1,z,S,T) += a))) . e = ((Product (r2,s,S,T)) * TR) . e
proof
let e be
object ;
( e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a) implies ((Product (r12,s,S,T)) | (((y12,z,S,T) += a) \ ((y1,z,S,T) += a))) . e = ((Product (r2,s,S,T)) * TR) . e )
assume A47:
e in ((y12,z,S,T) += a) \ ((y1,z,S,T) += a)
;
((Product (r12,s,S,T)) | (((y12,z,S,T) += a) \ ((y1,z,S,T) += a))) . e = ((Product (r2,s,S,T)) * TR) . e
then consider i,
j being
object such that A48:
(
i in S &
j in T &
e = [i,j] )
by A13, ZFMISC_1:def 2;
reconsider i =
i,
j =
j as
Ordinal by A48;
A49:
(
(Product (r12,s,S,T)) . e = (Product (r12,s,S,T)) . (
i,
j) &
(Product (r12,s,S,T)) . (
i,
j)
= (r12 . i) * (s . j) )
by Def15, A48, BINOP_1:def 1;
A50:
(
TR . e = [(i -^ (dom y1)),j] &
[(i -^ (dom y1)),j] in (
y2,
z,
S,
T)
+= a &
dom y1 c= i )
by A16, A47, A48, A17;
then A51:
i -^ (dom y1) in S
by A13, ZFMISC_1:87;
i -^ (dom y1) in dom y2
by A50, A1, A4, Def16;
then A52:
r2 . (i -^ (dom y1)) =
r12 . ((dom y1) +^ (i -^ (dom y1)))
by A1, A2, ORDINAL4:def 1
.=
r12 . i
by A47, A48, A17, Th3
;
((Product (r2,s,S,T)) * TR) . e =
(Product (r2,s,S,T)) . [(i -^ (dom y1)),j]
by A50, FUNCT_1:12, A45, A16, A47
.=
(Product (r2,s,S,T)) . (
(i -^ (dom y1)),
j)
by BINOP_1:def 1
.=
(r2 . (i -^ (dom y1))) * (s . j)
by A51, Def15, A48
;
hence
((Product (r12,s,S,T)) | (((y12,z,S,T) += a) \ ((y1,z,S,T) += a))) . e = ((Product (r2,s,S,T)) * TR) . e
by A47, FUNCT_1:49, A49, A52;
verum
end;
then
(Product (r12,s,S,T)) | (((y12,z,S,T) += a) \ ((y1,z,S,T) += a)) = (Product (r2,s,S,T)) * TR
by A16, A45, A46, FUNCT_1:2;
then
addreal $$ ((((y12,z,S,T) += a) \ ((y1,z,S,T) += a)),(Product (r12,s,S,T))) = addreal $$ (((y2,z,S,T) += a),(Product (r2,s,S,T)))
by A16, A40, A39, SETWOP_2:5;
hence Partial_Sums (y12,z,r12,s,a,S,T) =
addreal . ((addreal $$ (((y1,z,S,T) += a),(Product (r12,s,S,T)))),(addreal $$ (((y2,z,S,T) += a),(Product (r2,s,S,T)))))
by A11, A12, SETWOP_2:4
.=
(Partial_Sums (y1,z,r1,s,a,S,T)) + (Partial_Sums (y2,z,r2,s,a,S,T))
by A5, BINOP_2:def 9
;
verum