let r, s be Sequence of REAL ; :: thesis: for y, z, yz being strictly_decreasing Surreal-Sequence
for S, T being non empty Ordinal
for A, Y, Z being Ordinal st dom y c= S & dom z c= T & A in dom yz & yz .. A > (y .. Y) + (z .. Z) holds
(Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = 0

let y, z, yz be strictly_decreasing Surreal-Sequence; :: thesis: for S, T being non empty Ordinal
for A, Y, Z being Ordinal st dom y c= S & dom z c= T & A in dom yz & yz .. A > (y .. Y) + (z .. Z) holds
(Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = 0

let S, T be non empty Ordinal; :: thesis: for A, Y, Z being Ordinal st dom y c= S & dom z c= T & A in dom yz & yz .. A > (y .. Y) + (z .. Z) holds
(Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = 0

let A, Y, Z be Ordinal; :: thesis: ( dom y c= S & dom z c= T & A in dom yz & yz .. A > (y .. Y) + (z .. Z) implies (Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = 0 )
assume that
A1: ( dom y c= S & dom z c= T ) and
A2: ( A in dom yz & yz .. A > (y .. Y) + (z .. Z) ) ; :: thesis: (Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = 0
set yY = y /^ Y;
set zZ = z /^ Z;
A3: (Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = Partial_Sums ((y /^ Y),(z /^ Z),r,s,(yz .. A),S,T) by A2, Def19;
((y /^ Y),(z /^ Z),S,T) += (yz .. A) = {}. [:S,T:]
proof
assume ((y /^ Y),(z /^ Z),S,T) += (yz .. A) <> {}. [:S,T:] ; :: thesis: contradiction
then consider ij being object such that
A4: ij in ((y /^ Y),(z /^ Z),S,T) += (yz .. A) by XBOOLE_0:def 1;
((y /^ Y),(z /^ Z),S,T) += (yz .. A) c= [:S,T:] by FINSUB_1:def 5;
then consider i, j being object such that
A5: ( i in S & j in T & [i,j] = ij ) by A4, ZFMISC_1:def 2;
reconsider i = i, j = j as Ordinal by A5;
( dom (y /^ Y) c= dom y & dom (z /^ Z) c= dom z ) by Th6;
then ( dom (y /^ Y) c= S & dom (z /^ Z) c= T ) by A1;
then A6: ( i in dom (y /^ Y) & j in dom (z /^ Z) & ((y /^ Y) .. i) + ((z /^ Z) .. j) == yz .. A ) by A4, A5, Def16;
then A7: ( (y /^ Y) .. i = (y /^ Y) . i & (z /^ Z) .. j = (z /^ Z) . j ) by Def5;
A8: ( (y /^ Y) . i = y . (Y +^ i) & Y +^ i in dom y & (z /^ Z) . j = z . (Z +^ j) & Z +^ j in dom z ) by A6, Th8;
then A9: ( y . (Y +^ i) = y .. (Y +^ i) & z . (Z +^ j) = z .. (Z +^ j) ) by Def5;
A10: y .. Y >= y .. (Y +^ i)
proof
per cases ( i = 0 or i <> 0 ) ;
end;
end;
A12: z .. Z >= z .. (Z +^ j)
proof
per cases ( j = 0 or j <> 0 ) ;
end;
end;
(y .. Y) + (z .. Z) >= ((y /^ Y) .. i) + ((z /^ Z) .. j) by A8, A7, A9, A10, A12, SURREALR:43;
hence contradiction by A2, A6, SURREALO:4; :: thesis: verum
end;
hence (Sum ((y /^ Y),(z /^ Z),yz,r,s,S,T)) . A = 0 by A3, BINOP_2:2, SETWISEO:31; :: thesis: verum