let r, rE be Sequence of REAL ; :: thesis: for y, yE being positive decreasing_infinitely Surreal-Sequence st dom r = dom y & dom rE = dom yE & rng y c= rng yE & ( for A, B being Ordinal st A in dom y & B in dom yE & y . A = yE . B holds
r . A = rE . B ) & ( for A being Ordinal st A in dom yE & not yE . A in rng y holds
rE . A = 0 ) holds
Sum (r,y) = Sum (rE,yE)

let y, yE be positive decreasing_infinitely Surreal-Sequence; :: thesis: ( dom r = dom y & dom rE = dom yE & rng y c= rng yE & ( for A, B being Ordinal st A in dom y & B in dom yE & y . A = yE . B holds
r . A = rE . B ) & ( for A being Ordinal st A in dom yE & not yE . A in rng y holds
rE . A = 0 ) implies Sum (r,y) = Sum (rE,yE) )

assume that
A1: ( dom r = dom y & dom rE = dom yE & rng y c= rng yE ) and
A2: for A, B being Ordinal st A in dom y & B in dom yE & y . A = yE . B holds
r . A = rE . B and
A3: for A being Ordinal st A in dom yE & not yE . A in rng y holds
rE . A = 0 ; :: thesis: Sum (r,y) = Sum (rE,yE)
per cases ( dom r = {} or dom r <> {} ) ;
suppose A4: dom r = {} ; :: thesis: Sum (r,y) = Sum (rE,yE)
then (dom r) /\ (dom y) = {} ;
then ( Sum (r,y) = (Partial_Sums (r,y)) . {} & (Partial_Sums (r,y)) . {} = Sum ((r | {}),(y | {})) ) by SURREALC:def 21, Th58;
then A5: Sum (r,y) = 0_No by Th67;
rng rE c= {0}
proof
let b be object ; :: according to TARSKI:def 3 :: thesis: ( not b in rng rE or b in {0} )
assume b in rng rE ; :: thesis: b in {0}
then consider o being object such that
A6: ( o in dom rE & rE . o = b ) by FUNCT_1:def 3;
reconsider o = o as Ordinal by A6;
rng y = {} by A1, A4, RELAT_1:42;
then rE . o = 0 by A1, A6, A3;
hence b in {0} by A6, TARSKI:def 1; :: thesis: verum
end;
hence Sum (r,y) = Sum (rE,yE) by A5, Th66; :: thesis: verum
end;
suppose A7: dom r <> {} ; :: thesis: Sum (r,y) = Sum (rE,yE)
defpred S1[ object , object ] means ( y . $1 = yE . $2 & $2 in dom yE );
A8: for e being object st e in dom y holds
ex u being object st S1[e,u]
proof
let e be object ; :: thesis: ( e in dom y implies ex u being object st S1[e,u] )
assume A9: e in dom y ; :: thesis: ex u being object st S1[e,u]
y . e in rng y by A9, FUNCT_1:def 3;
then consider z being object such that
A10: ( z in dom yE & yE . z = y . e ) by A1, FUNCT_1:def 3;
take z ; :: thesis: S1[e,z]
thus S1[e,z] by A10; :: thesis: verum
end;
consider m being Function such that
A11: dom m = dom y and
A12: for e being object st e in dom y holds
S1[e,m . e] from CLASSES1:sch 1(A8);
A13: rng m c= dom yE
proof
let b be object ; :: according to TARSKI:def 3 :: thesis: ( not b in rng m or b in dom yE )
assume b in rng m ; :: thesis: b in dom yE
then ex a being object st
( a in dom m & m . a = b ) by FUNCT_1:def 3;
hence b in dom yE by A11, A12; :: thesis: verum
end;
0 c= dom r ;
then 0 in dom r by ORDINAL1:11, A7, XBOOLE_0:def 8;
then S1[ 0 ,m . 0] by A12, A1;
then reconsider m0 = m . 0 as Ordinal ;
A14: for A, B being Ordinal st ( A in dom y or B in dom yE ) & y . A = yE . B holds
( A in dom y & B in dom yE & B = m . A )
proof
let A, B be Ordinal; :: thesis: ( ( A in dom y or B in dom yE ) & y . A = yE . B implies ( A in dom y & B in dom yE & B = m . A ) )
assume A15: ( ( A in dom y or B in dom yE ) & y . A = yE . B ) ; :: thesis: ( A in dom y & B in dom yE & B = m . A )
thus A16: ( A in dom y & B in dom yE ) :: thesis: B = m . A
proof
per cases ( A in dom y or B in dom yE ) by A15;
suppose A in dom y ; :: thesis: ( A in dom y & B in dom yE )
then y . A = y .. A by Def5;
hence ( A in dom y & B in dom yE ) by A15, FUNCT_1:def 2; :: thesis: verum
end;
suppose B in dom yE ; :: thesis: ( A in dom y & B in dom yE )
then yE . B = yE .. B by Def5;
hence ( A in dom y & B in dom yE ) by A15, FUNCT_1:def 2; :: thesis: verum
end;
end;
end;
( y . A = yE . (m . A) & m . A in dom yE ) by A12, A16;
hence B = m . A by A15, A16, FUNCT_1:def 4; :: thesis: verum
end;
A17: for A, B being Ordinal st A in dom y & B in dom y holds
( A in B iff m . A in m . B )
proof
let A, B be Ordinal; :: thesis: ( A in dom y & B in dom y implies ( A in B iff m . A in m . B ) )
assume A18: ( A in dom y & B in dom y ) ; :: thesis: ( A in B iff m . A in m . B )
A19: ( S1[A,m . A] & S1[B,m . B] ) by A18, A12;
A20: ( y .. A = y . A & y .. B = y . B ) by A18, Def5;
thus ( A in B implies m . A in m . B ) :: thesis: ( m . A in m . B implies A in B ) assume A25: ( m . A in m . B & not A in B ) ; :: thesis: contradiction
then A26: yE .. (m . B) < yE .. (m . A) by A19, Def7, SURREALC:9;
A27: ( yE .. (m . B) = y . B & yE .. (m . A) = y . A ) by A19, Def5;
A28: B <> A by A25;
B in A by A25, ORDINAL1:16, A28;
then y .. A < y .. B by A18, A20, SURREALC:def 16, SURREALC:9;
hence contradiction by A20, A27, A26, SURREALO:6; :: thesis: verum
end;
A29: for B, mB being Ordinal st B in dom y & mB = m . B holds
( sup (m .: B) c= mB & Sum ((rE | mB),(yE | mB)) = Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) )
proof
let B, mB be Ordinal; :: thesis: ( B in dom y & mB = m . B implies ( sup (m .: B) c= mB & Sum ((rE | mB),(yE | mB)) = Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) ) )
assume A30: ( B in dom y & mB = m . B ) ; :: thesis: ( sup (m .: B) c= mB & Sum ((rE | mB),(yE | mB)) = Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) )
A31: m . B in dom yE by A30, A12;
set S = sup (m .: B);
for A being Ordinal st A in m .: B holds
A in mB
proof
let A be Ordinal; :: thesis: ( A in m .: B implies A in mB )
assume A32: A in m .: B ; :: thesis: A in mB
ex x being object st
( x in dom m & x in B & A = m . x ) by A32, FUNCT_1:def 6;
hence A in mB by A30, A17, A11; :: thesis: verum
end;
then A33: sup (m .: B) c= mB by ORDINAL2:20;
A34: mB c= (dom yE) /\ (dom rE) by A1, A30, A12, ORDINAL1:def 2;
for C being Ordinal st sup (m .: B) c= C & C in mB holds
rE . C = 0
proof
let C be Ordinal; :: thesis: ( sup (m .: B) c= C & C in mB implies rE . C = 0 )
assume that
A35: ( sup (m .: B) c= C & C in mB ) and
A36: rE . C <> 0 ; :: thesis: contradiction
C in dom yE by A30, A31, A35, ORDINAL1:10;
then yE . C in rng y by A3, A36;
then consider a being object such that
A37: ( a in dom y & yE . C = y . a ) by FUNCT_1:def 3;
reconsider a = a as Ordinal by A37;
A38: C = m . a by A14, A37;
then a in B by A17, A37, A30, A35;
then m . a in m .: B by A11, A37, FUNCT_1:def 6;
then C in sup (m .: B) by A38, ORDINAL2:19;
then C in C by A35;
hence contradiction ; :: thesis: verum
end;
hence ( sup (m .: B) c= mB & Sum ((rE | mB),(yE | mB)) = Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) ) by A33, A34, Th72; :: thesis: verum
end;
defpred S2[ Ordinal] means ( $1 c= dom y implies Sum ((r | $1),(y | $1)) = Sum ((rE | (sup (m .: $1))),(yE | (sup (m .: $1)))) );
A39: for A being Ordinal st ( for C being Ordinal st C in A holds
S2[C] ) holds
S2[A]
proof
let A be Ordinal; :: thesis: ( ( for C being Ordinal st C in A holds
S2[C] ) implies S2[A] )

assume A40: for C being Ordinal st C in A holds
S2[C] ; :: thesis: S2[A]
set SAL = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } ;
set SAR = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } ;
assume A41: A c= dom y ; :: thesis: Sum ((r | A),(y | A)) = Sum ((rE | (sup (m .: A))),(yE | (sup (m .: A))))
then A42: A c= (dom r) /\ (dom y) by A1;
then reconsider SA = [ { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } , { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } ] as Surreal by Th61;
A43: ( Sum ((r | A),(y | A)) = Unique_No SA & Unique_No SA == SA ) by A42, Th62, SURREALO:def 10;
set MA = sup (m .: A);
set SML = { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } ;
set SMR = { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } ;
A44: sup (m .: A) c= dom yE
proof
m .: A c= rng m by RELAT_1:111;
then for C being Ordinal st C in m .: A holds
C in dom yE by A13;
hence sup (m .: A) c= dom yE by ORDINAL2:20; :: thesis: verum
end;
then A45: sup (m .: A) c= (dom rE) /\ (dom yE) by A1;
then reconsider SMA = [ { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } , { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } ] as Surreal by Th61;
A46: ( Sum ((rE | (sup (m .: A))),(yE | (sup (m .: A)))) = Unique_No SMA & Unique_No SMA == SMA ) by A45, Th62, SURREALO:def 10;
A47: for x being Surreal st x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } holds
ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & x <= a )
proof
let x be Surreal; :: thesis: ( x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } implies ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & x <= a ) )

assume x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } ; :: thesis: ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & x <= a )

then consider B being Element of A, e being positive Real such that
A48: ( x = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) & B in A ) ;
S1[B,m . B] by A41, A48, A12;
then reconsider mB = m . B as Ordinal ;
A50: ( Sum ((r | B),(y | B)) = Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) & Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) = Sum ((rE | mB),(yE | mB)) ) by A40, A48, A41, ORDINAL1:def 2, A29;
A51: mB in dom yE by A41, A48, A12;
( y .. B = y . B & y . B = yE . mB & yE . mB = yE .. mB ) by A41, A48, A12, Def5;
then A52: x = (Sum ((rE | mB),(yE | mB))) + ((uReal . ((rE . mB) - e)) * (yE .. mB)) by A48, A50, A2, A51, A41;
mB in m .: A by A48, A41, A11, FUNCT_1:def 6;
then mB in sup (m .: A) by ORDINAL2:19;
then x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } by A52;
hence ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & x <= a ) ; :: thesis: verum
end;
for x being Surreal st x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } holds
ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x )
proof
let x be Surreal; :: thesis: ( x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } implies ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x ) )

assume x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } ; :: thesis: ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x )

then consider B being Element of sup (m .: A), e being positive Real such that
A53: ( x = (Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B)) & B in sup (m .: A) ) ;
set X = { C where C is Element of m .: A : ( B c= C & C in m .: A ) } ;
set I = inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } ;
inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } in { C where C is Element of m .: A : ( B c= C & C in m .: A ) }
proof
consider c being Ordinal such that
A54: ( c in m .: A & B c= c ) by A53, ORDINAL2:21;
c in { C where C is Element of m .: A : ( B c= C & C in m .: A ) } by A54;
hence inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } in { C where C is Element of m .: A : ( B c= C & C in m .: A ) } by ORDINAL2:17; :: thesis: verum
end;
then consider C being Element of m .: A such that
A55: ( inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } = C & B c= C & C in m .: A ) ;
reconsider C = C as Ordinal by A55;
consider D being object such that
A56: ( D in dom m & D in A & m . D = C ) by A55, FUNCT_1:def 6;
reconsider D = D as Ordinal by A56;
A57: S1[D,C] by A56, A12, A11;
A58: ( Sum ((r | D),(y | D)) = Sum ((rE | (sup (m .: D))),(yE | (sup (m .: D)))) & Sum ((rE | (sup (m .: D))),(yE | (sup (m .: D)))) = Sum ((rE | C),(yE | C)) ) by A40, A56, A11, ORDINAL1:def 2, A29;
A59: ( y .. D = y . D & y . D = yE . C & yE . C = yE .. C ) by A56, A11, A12, Def5;
A60: r . D = rE . C by A2, A57, A56, A11;
per cases ( B = C or B <> C ) ;
suppose B = C ; :: thesis: ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x )

then x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } by A53, A56, A59, A58, A60;
hence ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x ) ; :: thesis: verum
end;
suppose A61: B <> C ; :: thesis: ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x )

then A62: B in C by A55, ORDINAL1:11, XBOOLE_0:def 8;
then A63: y .. D infinitely< yE .. B by A59, A57, Def7;
A64: rE . B = 0
proof
assume rE . B <> 0 ; :: thesis: contradiction
then yE . B in rng y by A44, A53, A3;
then consider E being object such that
A65: ( E in dom y & y . E = yE . B ) by FUNCT_1:def 3;
reconsider E = E as Ordinal by A65;
A66: m . E = B by A14, A65;
then E in D by A62, A56, A65, A11, A17;
then E in A by A56, ORDINAL1:10;
then m . E in m .: A by A65, A11, FUNCT_1:def 6;
then B in { C where C is Element of m .: A : ( B c= C & C in m .: A ) } by A66;
hence contradiction by A61, A55, ORDINAL2:14; :: thesis: verum
end;
C c= (dom rE) /\ (dom yE) by A1, A56, A12, A11, ORDINAL1:def 2;
then Sum ((rE | C),(yE | C)) is Sum ((rE | B),(yE | B)),yE .. B,rE . B _Term by A62, Th68;
then |.((Sum ((r | D),(y | D))) - ((Sum ((rE | B),(yE | B))) + (0_No * (yE .. B)))).| infinitely< yE .. B by A64, SURREALN:47, A58, SURREALC:def 14;
then |.((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))).| infinitely< (uReal . (e / 2)) * (yE .. B) by SURREALC:13;
then ( (Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B))) <= |.((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))).| & |.((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))).| < (uReal . (e / 2)) * (yE .. B) ) by SURREALC:9, SURREALC:34;
then A68: (Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B))) <= (uReal . (e / 2)) * (yE .. B) by SURREALO:9;
y .. D is positive by Def6, A56, A11;
then A69: 0_No <= y .. D ;
y .. D infinitely< (uReal . (e / 2)) * (yE .. B) by SURREALC:13, A63;
then (uReal . ((r . D) + e)) * (y .. D) < (uReal . (e / 2)) * (yE .. B) by A69, SURREALC:20;
then ( (((uReal . ((r . D) + e)) * (y .. D)) + (Sum ((r | D),(y | D)))) - (Sum ((rE | B),(yE | B))) = ((uReal . ((r . D) + e)) * (y .. D)) + ((Sum ((r | D),(y | D))) + (- (Sum ((rE | B),(yE | B))))) & ((uReal . ((r . D) + e)) * (y .. D)) + ((Sum ((r | D),(y | D))) + (- (Sum ((rE | B),(yE | B))))) < ((uReal . (e / 2)) * (yE .. B)) + ((uReal . (e / 2)) * (yE .. B)) ) by A68, SURREALR:37, SURREALR:44;
then ( ((uReal . ((r . D) + e)) * (y .. D)) + (Sum ((r | D),(y | D))) < (((uReal . (e / 2)) * (yE .. B)) + ((uReal . (e / 2)) * (yE .. B))) + (Sum ((rE | B),(yE | B))) & (((uReal . (e / 2)) * (yE .. B)) + ((uReal . (e / 2)) * (yE .. B))) + (Sum ((rE | B),(yE | B))) = ((uReal . (e / 2)) * (yE .. B)) + (((uReal . (e / 2)) * (yE .. B)) + (Sum ((rE | B),(yE | B)))) & ((uReal . (e / 2)) * (yE .. B)) + (((uReal . (e / 2)) * (yE .. B)) + (Sum ((rE | B),(yE | B)))) == (Sum ((rE | B),(yE | B))) + ((uReal . ((e / 2) + (e / 2))) * (yE .. B)) ) by Th30, SURREALR:37, SURREALR:41;
then A70: (Sum ((r | D),(y | D))) + ((uReal . ((r . D) + e)) * (y .. D)) <= x by A53, A64, SURREALO:9;
(Sum ((r | D),(y | D))) + ((uReal . ((r . D) + e)) * (y .. D)) in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } by A56;
hence ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & a <= x ) by A70; :: thesis: verum
end;
end;
end;
then A71: SA <= SMA by A47, SURREAL0:44;
A72: for x being Surreal st x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } holds
ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & a <= x )
proof
let x be Surreal; :: thesis: ( x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } implies ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & a <= x ) )

assume x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } ; :: thesis: ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & a <= x )

then consider B being Element of A, e being positive Real such that
A73: ( x = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) & B in A ) ;
A74: S1[B,m . B] by A41, A73, A12;
then reconsider mB = m . B as Ordinal ;
A75: ( Sum ((r | B),(y | B)) = Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) & Sum ((rE | (sup (m .: B))),(yE | (sup (m .: B)))) = Sum ((rE | mB),(yE | mB)) ) by A40, A73, A41, ORDINAL1:def 2, A29;
( y .. B = y . B & y . B = yE . mB & yE . mB = yE .. mB ) by A41, A73, A12, Def5;
then A76: x = (Sum ((rE | mB),(yE | mB))) + ((uReal . ((rE . mB) + e)) * (yE .. mB)) by A73, A75, A2, A74, A41;
mB in m .: A by A73, A41, A11, FUNCT_1:def 6;
then mB in sup (m .: A) by ORDINAL2:19;
then x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } by A76;
hence ex a being Surreal st
( a in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) + e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } & a <= x ) ; :: thesis: verum
end;
for x being Surreal st x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } holds
ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a )
proof
let x be Surreal; :: thesis: ( x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } implies ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a ) )

assume x in { ((Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B))) where B is Element of sup (m .: A), e is positive Real : B in sup (m .: A) } ; :: thesis: ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a )

then consider B being Element of sup (m .: A), e being positive Real such that
A77: ( x = (Sum ((rE | B),(yE | B))) + ((uReal . ((rE . B) - e)) * (yE .. B)) & B in sup (m .: A) ) ;
set X = { C where C is Element of m .: A : ( B c= C & C in m .: A ) } ;
set I = inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } ;
inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } in { C where C is Element of m .: A : ( B c= C & C in m .: A ) }
proof
consider c being Ordinal such that
A78: ( c in m .: A & B c= c ) by A77, ORDINAL2:21;
c in { C where C is Element of m .: A : ( B c= C & C in m .: A ) } by A78;
hence inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } in { C where C is Element of m .: A : ( B c= C & C in m .: A ) } by ORDINAL2:17; :: thesis: verum
end;
then consider C being Element of m .: A such that
A79: ( inf { C where C is Element of m .: A : ( B c= C & C in m .: A ) } = C & B c= C & C in m .: A ) ;
reconsider C = C as Ordinal by A79;
consider D being object such that
A80: ( D in dom m & D in A & m . D = C ) by A79, FUNCT_1:def 6;
reconsider D = D as Ordinal by A80;
A81: S1[D,C] by A80, A11, A12;
A82: ( Sum ((r | D),(y | D)) = Sum ((rE | (sup (m .: D))),(yE | (sup (m .: D)))) & Sum ((rE | (sup (m .: D))),(yE | (sup (m .: D)))) = Sum ((rE | C),(yE | C)) ) by A40, A80, A11, ORDINAL1:def 2, A29;
A83: ( y .. D = y . D & y . D = yE . C & yE . C = yE .. C ) by A80, A11, A12, Def5;
A84: r . D = rE . C by A2, A80, A11, A81;
per cases ( B = C or B <> C ) ;
suppose B = C ; :: thesis: ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a )

then x in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } by A77, A80, A83, A82, A84;
hence ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a ) ; :: thesis: verum
end;
suppose A85: B <> C ; :: thesis: ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a )

then A86: B in C by A79, ORDINAL1:11, XBOOLE_0:def 8;
then A87: y .. D infinitely< yE .. B by A83, A81, Def7;
A88: rE . B = 0
proof
assume rE . B <> 0 ; :: thesis: contradiction
then yE . B in rng y by A44, A77, A3;
then consider E being object such that
A89: ( E in dom y & y . E = yE . B ) by FUNCT_1:def 3;
reconsider E = E as Ordinal by A89;
A90: m . E = B by A14, A89;
then E in D by A80, A86, A89, A11, A17;
then E in A by A80, ORDINAL1:10;
then m . E in m .: A by A89, A11, FUNCT_1:def 6;
then B in { C where C is Element of m .: A : ( B c= C & C in m .: A ) } by A90;
hence contradiction by A85, A79, ORDINAL2:14; :: thesis: verum
end;
C c= (dom rE) /\ (dom yE) by A1, A80, A11, A12, ORDINAL1:def 2;
then Sum ((rE | C),(yE | C)) is Sum ((rE | B),(yE | B)),yE .. B,rE . B _Term by A86, Th68;
then |.((Sum ((r | D),(y | D))) - ((Sum ((rE | B),(yE | B))) + (0_No * (yE .. B)))).| infinitely< yE .. B by A88, A82, SURREALC:def 14, SURREALN:47;
then |.((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))).| infinitely< (uReal . (e / 2)) * (yE .. B) by SURREALC:13;
then ( - ((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))) <= |.((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))).| & |.((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))).| < (uReal . (e / 2)) * (yE .. B) ) by Lm2, SURREALC:9;
then - ((Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B)))) <= - (- ((uReal . (e / 2)) * (yE .. B))) by SURREALO:9;
then ( (Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B))) >= - ((uReal . (- (- (e / 2)))) * (yE .. B)) & - ((uReal . (- (- (e / 2)))) * (yE .. B)) == (uReal . (- (e / 2))) * (yE .. B) ) by Th33, SURREALR:10;
then A91: (Sum ((r | D),(y | D))) - (Sum ((rE | B),(yE | B))) >= (uReal . (- (e / 2))) * (yE .. B) by SURREALO:9;
y .. D is positive by Def6, A80, A11;
then A92: 0_No <= y .. D ;
y .. D infinitely< (uReal . (e / 2)) * (yE .. B) by SURREALC:13, A87;
then ( - ((uReal . (- (- ((r . D) - e)))) * (y .. D)) == (uReal . (- ((r . D) - e))) * (y .. D) & (uReal . (- ((r . D) - e))) * (y .. D) < (uReal . (e / 2)) * (yE .. B) ) by Th33, A92, SURREALC:20;
then ( - ((uReal . ((r . D) - e)) * (y .. D)) < (uReal . (e / 2)) * (yE .. B) & (uReal . (e / 2)) * (yE .. B) == - ((uReal . (- (e / 2))) * (yE .. B)) ) by Th33, SURREALO:9;
then - ((uReal . ((r . D) - e)) * (y .. D)) < - ((uReal . (- (e / 2))) * (yE .. B)) by SURREALO:9;
then (uReal . ((r . D) - e)) * (y .. D) > (uReal . (- (e / 2))) * (yE .. B) by SURREALR:10;
then ( (((uReal . ((r . D) - e)) * (y .. D)) + (Sum ((r | D),(y | D)))) - (Sum ((rE | B),(yE | B))) = ((uReal . ((r . D) - e)) * (y .. D)) + ((Sum ((r | D),(y | D))) + (- (Sum ((rE | B),(yE | B))))) & ((uReal . ((r . D) - e)) * (y .. D)) + ((Sum ((r | D),(y | D))) + (- (Sum ((rE | B),(yE | B))))) > ((uReal . (- (e / 2))) * (yE .. B)) + ((uReal . (- (e / 2))) * (yE .. B)) ) by A91, SURREALR:37, SURREALR:44;
then ( ((uReal . ((r . D) - e)) * (y .. D)) + (Sum ((r | D),(y | D))) > (((uReal . (- (e / 2))) * (yE .. B)) + ((uReal . (- (e / 2))) * (yE .. B))) + (Sum ((rE | B),(yE | B))) & (((uReal . (- (e / 2))) * (yE .. B)) + ((uReal . (- (e / 2))) * (yE .. B))) + (Sum ((rE | B),(yE | B))) = ((uReal . (- (e / 2))) * (yE .. B)) + (((uReal . (- (e / 2))) * (yE .. B)) + (Sum ((rE | B),(yE | B)))) & ((uReal . (- (e / 2))) * (yE .. B)) + (((uReal . (- (e / 2))) * (yE .. B)) + (Sum ((rE | B),(yE | B)))) == (Sum ((rE | B),(yE | B))) + ((uReal . ((- (e / 2)) + (- (e / 2)))) * (yE .. B)) ) by Th30, SURREALR:37, SURREALR:42;
then ((uReal . ((r . D) - e)) * (y .. D)) + (Sum ((r | D),(y | D))) > (Sum ((rE | B),(yE | B))) + ((uReal . (- e)) * (yE .. B)) by SURREALO:9;
then A93: (Sum ((r | D),(y | D))) + ((uReal . ((r . D) - e)) * (y .. D)) >= x by A77, A88, SURREALO:6;
(Sum ((r | D),(y | D))) + ((uReal . ((r . D) - e)) * (y .. D)) in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } by A80;
hence ex a being Surreal st
( a in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of A, e is positive Real : B in A } & x <= a ) by A93; :: thesis: verum
end;
end;
end;
then A94: SMA <= SA by A72, SURREAL0:44;
SMA == Sum ((r | A),(y | A)) by A71, A94, A43, SURREALO:9;
then Sum ((rE | (sup (m .: A))),(yE | (sup (m .: A)))) == Sum ((r | A),(y | A)) by A46, SURREALO:9;
hence Sum ((r | A),(y | A)) = Sum ((rE | (sup (m .: A))),(yE | (sup (m .: A)))) by SURREALO:50; :: thesis: verum
end;
set S = sup (m .: (dom y));
for A being Ordinal holds S2[A] from ORDINAL1:sch 2(A39);
then A95: Sum ((r | (dom y)),(y | (dom y))) = Sum ((rE | (sup (m .: (dom y)))),(yE | (sup (m .: (dom y))))) ;
A96: m .: (dom y) = rng m by A11, RELAT_1:113;
then for A being Ordinal st A in m .: (dom y) holds
A in dom yE by A13;
then A97: sup (m .: (dom y)) c= dom yE by ORDINAL2:20;
A98: dom yE c= (dom yE) /\ (dom rE) by A1;
for C being Ordinal st sup (m .: (dom y)) c= C & C in dom yE holds
rE . C = 0
proof
let C be Ordinal; :: thesis: ( sup (m .: (dom y)) c= C & C in dom yE implies rE . C = 0 )
assume A99: ( sup (m .: (dom y)) c= C & C in dom yE ) ; :: thesis: rE . C = 0
assume rE . C <> 0 ; :: thesis: contradiction
then yE . C in rng y by A3, A99;
then consider a being object such that
A100: ( a in dom y & y . a = yE . C ) by FUNCT_1:def 3;
reconsider a = a as Ordinal by A100;
m . a = C by A100, A14;
then C in rng m by A100, A11, FUNCT_1:def 3;
then C in sup (m .: (dom y)) by A96, ORDINAL2:19;
then C in C by A99;
hence contradiction ; :: thesis: verum
end;
then Sum ((rE | (sup (m .: (dom y)))),(yE | (sup (m .: (dom y))))) = Sum ((rE | (dom yE)),(yE | (dom yE))) by A98, A97, Th72;
hence Sum (r,y) = Sum (rE,yE) by A1, A95; :: thesis: verum
end;
end;