let A be Ordinal; :: thesis: for r being Sequence of REAL
for y being positive decreasing_infinitely Surreal-Sequence st succ A c= (dom r) /\ (dom y) & ( for ry being Surreal st ry = [ { ((uReal . ((r . A) - e1)) * (y .. A)) where e1 is positive Real : verum } , { ((uReal . ((r . A) + e2)) * (y .. A)) where e2 is positive Real : verum } ] holds
ry == (uReal . (r . A)) * (y .. A) ) holds
Sum ((r | (succ A)),(y | (succ A))) == (Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A))

let r be Sequence of REAL ; :: thesis: for y being positive decreasing_infinitely Surreal-Sequence st succ A c= (dom r) /\ (dom y) & ( for ry being Surreal st ry = [ { ((uReal . ((r . A) - e1)) * (y .. A)) where e1 is positive Real : verum } , { ((uReal . ((r . A) + e2)) * (y .. A)) where e2 is positive Real : verum } ] holds
ry == (uReal . (r . A)) * (y .. A) ) holds
Sum ((r | (succ A)),(y | (succ A))) == (Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A))

let y be positive decreasing_infinitely Surreal-Sequence; :: thesis: ( succ A c= (dom r) /\ (dom y) & ( for ry being Surreal st ry = [ { ((uReal . ((r . A) - e1)) * (y .. A)) where e1 is positive Real : verum } , { ((uReal . ((r . A) + e2)) * (y .. A)) where e2 is positive Real : verum } ] holds
ry == (uReal . (r . A)) * (y .. A) ) implies Sum ((r | (succ A)),(y | (succ A))) == (Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)) )

assume that
A1: succ A c= (dom r) /\ (dom y) and
A2: for ry being Surreal st ry = [ { ((uReal . ((r . A) - e1)) * (y .. A)) where e1 is positive Real : verum } , { ((uReal . ((r . A) + e2)) * (y .. A)) where e2 is positive Real : verum } ] holds
ry == (uReal . (r . A)) * (y .. A) ; :: thesis: Sum ((r | (succ A)),(y | (succ A))) == (Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A))
set rA = r . A;
set yA = y .. A;
A3: A in succ A by ORDINAL1:6;
then A4: A in dom y by A1, XBOOLE_0:def 4;
then A5: y .. A = y . A by Def5;
A6: y .. A is positive by A4, A5, SURREALC:def 15;
A7: 0_No <= y .. A by A6;
reconsider ry = [ { ((uReal . ((r . A) - e1)) * (y .. A)) where e1 is positive Real : verum } , { ((uReal . ((r . A) + e2)) * (y .. A)) where e2 is positive Real : verum } ] as Surreal by A6, Th51;
A8: ry == (uReal . (r . A)) * (y .. A) by A2;
reconsider SryA = [ { ((0_No + (Sum ((r | A),(y | A)))) + ((uReal . ((r . A) - e1)) * (y .. A))) where e1 is positive Real : verum } , { ((0_No + (Sum ((r | A),(y | A)))) + ((uReal . ((r . A) + e2)) * (y .. A))) where e2 is positive Real : verum } ] as Surreal by A1, Th59;
reconsider SryA1 = [ { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) where B is Element of succ A, e is positive Real : B in succ A } , { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of succ A, e is positive Real : B in succ A } ] as Surreal by A1, Th61;
A9: ( Sum ((r | (succ A)),(y | (succ A))) = Unique_No SryA1 & Unique_No SryA1 == SryA1 ) by A1, Th62, SURREALO:def 10;
A10: ( Sum ((r | (succ A)),(y | (succ A))) = Unique_No SryA & Unique_No SryA == SryA ) by A1, Th60, SURREALO:def 10;
then A11: SryA == SryA1 by A9, SURREALO:9;
reconsider SryB = [ { ((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 A1, A3, ORDINAL1:def 2, Th61;
A12: ( Sum ((r | A),(y | A)) = Unique_No SryB & Unique_No SryB == SryB ) by A1, A3, ORDINAL1:def 2, Th62, SURREALO:def 10;
A13: L_ SryA << {(SryB + ry)}
proof
let L, R be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not L in L_ SryA or not R in {(SryB + ry)} or not R <= L )
assume A14: ( L in L_ SryA & R in {(SryB + ry)} ) ; :: thesis: not R <= L
A15: R = SryB + ry by A14, TARSKI:def 1;
consider e being positive Real such that
A16: L = (Sum ((r | A),(y | A))) + ((uReal . ((r . A) - e)) * (y .. A)) by A14;
A17: ( L_ ry << {ry} & ry in {ry} ) by SURREALO:11, TARSKI:def 1;
(uReal . ((r . A) - e)) * (y .. A) in L_ ry ;
hence not R <= L by A15, A12, A16, A17, SURREALR:44; :: thesis: verum
end;
A18: {(SryB + ry)} << R_ SryA
proof
let L, R be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not L in {(SryB + ry)} or not R in R_ SryA or not R <= L )
assume A19: ( L in {(SryB + ry)} & R in R_ SryA ) ; :: thesis: not R <= L
A20: L = SryB + ry by A19, TARSKI:def 1;
consider e being positive Real such that
A21: R = (Sum ((r | A),(y | A))) + ((uReal . ((r . A) + e)) * (y .. A)) by A19;
A22: ( {ry} << R_ ry & ry in {ry} ) by SURREALO:11, TARSKI:def 1;
(uReal . ((r . A) + e)) * (y .. A) in R_ ry ;
hence not R <= L by A20, A12, A21, A22, SURREALR:44; :: thesis: verum
end;
A23: SryB + ry = [(((L_ SryB) ++ {ry}) \/ ({SryB} ++ (L_ ry))),(((R_ SryB) ++ {ry}) \/ ({SryB} ++ (R_ ry)))] by SURREALR:28;
A24: L_ (SryB + ry) << {SryA}
proof
let L, R be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not L in L_ (SryB + ry) or not R in {SryA} or not R <= L )
assume A25: ( L in L_ (SryB + ry) & R in {SryA} ) ; :: thesis: not R <= L
A26: R == SryA1 by A11, A25, TARSKI:def 1;
per cases ( L in (L_ SryB) ++ {ry} or L in {SryB} ++ (L_ ry) ) by A23, A25, XBOOLE_0:def 3;
suppose L in (L_ SryB) ++ {ry} ; :: thesis: not R <= L
then consider L1, L2 being Surreal such that
A27: ( L1 in L_ SryB & L2 in {ry} & L = L1 + L2 ) by SURREALR:def 8;
consider B being Element of A, e being positive Real such that
A28: ( L1 = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) & B in A ) by A27;
set yB = y .. B;
set SB = Sum ((r | B),(y | B));
set E = uReal . (e / 2);
(e / 2) + (e / 2) = e ;
then ( ((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B)) == ((uReal . (e / 2)) + (uReal . (e / 2))) * (y .. B) & ((uReal . (e / 2)) + (uReal . (e / 2))) * (y .. B) == (y .. B) * (uReal . e) ) by SURREALN:55, SURREALR:54, SURREALR:67;
then ((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B)) == (y .. B) * (uReal . e) by SURREALO:9;
then ( (- ((uReal . (e / 2)) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B))) = - (((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B))) & - (((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B))) == - ((y .. B) * (uReal . e)) ) by SURREALR:40, SURREALR:10;
then A29: ( ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + (- ((uReal . e) * (y .. B))) == ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((- ((uReal . (e / 2)) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B)))) & ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((- ((uReal . (e / 2)) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B)))) = (((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . (e / 2)) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B))) ) by SURREALR:37, SURREALR:43;
L1 == ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . e) * (y .. B)) by Th30, A28;
then A30: L1 == (((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . (e / 2)) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B))) by A29, SURREALO:9;
((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . (e / 2)) * (y .. B)) == (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B)) by Th30;
then (((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . (e / 2)) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B))) == ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B))) by SURREALR:43;
then A31: L1 == ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B))) by A30, SURREALO:9;
y .. B = y . B by A4, A28, ORDINAL1:10, Def5;
then y .. A infinitely< y .. B by A28, A4, A5, SURREALC:def 16;
then y .. A infinitely< (uReal . (e / 2)) * (y .. B) by SURREALC:13;
then (uReal . (r . A)) * (y .. A) < (uReal . (e / 2)) * (y .. B) by A7, SURREALC:20;
then A32: ry < (uReal . (e / 2)) * (y .. B) by A8, SURREALO:9;
( L1 + ry == (((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B)))) + ry & (((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + (- ((uReal . (e / 2)) * (y .. B)))) + ry = ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + ((- ((uReal . (e / 2)) * (y .. B))) + ry) ) by A31, SURREALR:37, SURREALR:43;
then A33: L == ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + (ry - ((uReal . (e / 2)) * (y .. B))) by A27, TARSKI:def 1;
ry - ((uReal . (e / 2)) * (y .. B)) < 0_No by A32, SURREALR:46;
then ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + (ry - ((uReal . (e / 2)) * (y .. B))) < ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B))) + 0_No by SURREALR:44;
then A34: L <= (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B)) by A33, SURREALO:9;
A in succ A by ORDINAL1:6;
then B in succ A by A28, ORDINAL1:10;
then ( (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - (e / 2))) * (y .. B)) in L_ SryA1 & L_ SryA1 << {SryA1} & SryA1 in {SryA1} ) by SURREALO:11, TARSKI:def 1;
then L < SryA1 by A34, SURREALO:9;
hence L < R by A26, SURREALO:9; :: thesis: verum
end;
suppose L in {SryB} ++ (L_ ry) ; :: thesis: not R <= L
then consider L1, L2 being Surreal such that
A35: ( L1 in {SryB} & L2 in L_ ry & L = L1 + L2 ) by SURREALR:def 8;
A36: L1 = SryB by A35, TARSKI:def 1;
consider e2 being positive Real such that
A37: L2 = (uReal . ((r . A) - e2)) * (y .. A) by A35;
A38: L == (Sum ((r | A),(y | A))) + ((uReal . ((r . A) - e2)) * (y .. A)) by A36, A35, A37, A12, SURREALR:43;
A in succ A by ORDINAL1:6;
then A39: (Sum ((r | A),(y | A))) + ((uReal . ((r . A) - e2)) * (y .. A)) in L_ SryA1 ;
( SryA1 in {SryA1} & L_ SryA1 << {SryA1} ) by SURREALO:11, TARSKI:def 1;
then SryA1 > L by A38, A39, SURREALO:9;
hence L < R by A26, SURREALO:9; :: thesis: verum
end;
end;
end;
A40: {SryA} << R_ (SryB + ry)
proof
let L, R be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not L in {SryA} or not R in R_ (SryB + ry) or not R <= L )
assume A41: ( L in {SryA} & R in R_ (SryB + ry) ) ; :: thesis: not R <= L
A42: L == SryA1 by A11, A41, TARSKI:def 1;
per cases ( R in (R_ SryB) ++ {ry} or R in {SryB} ++ (R_ ry) ) by A23, A41, XBOOLE_0:def 3;
suppose R in (R_ SryB) ++ {ry} ; :: thesis: not R <= L
then consider R1, R2 being Surreal such that
A43: ( R1 in R_ SryB & R2 in {ry} & R = R1 + R2 ) by SURREALR:def 8;
A44: R2 = ry by A43, TARSKI:def 1;
consider B being Element of A, e being positive Real such that
A45: ( R1 = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) & B in A ) by A43;
set yB = y .. B;
set SB = Sum ((r | B),(y | B));
set E = uReal . (e / 2);
(e / 2) + (e / 2) = e ;
then ( ((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B)) == ((uReal . (e / 2)) + (uReal . (e / 2))) * (y .. B) & ((uReal . (e / 2)) + (uReal . (e / 2))) * (y .. B) == (y .. B) * (uReal . e) ) by SURREALR:54, SURREALR:67, SURREALN:55;
then ((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B)) == (y .. B) * (uReal . e) by SURREALO:9;
then A46: ( ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . e) * (y .. B)) == ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + (((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B))) & ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + (((uReal . (e / 2)) * (y .. B)) + ((uReal . (e / 2)) * (y .. B))) = (((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B)) ) by SURREALR:37, SURREALR:43;
R1 == ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . e) * (y .. B)) by Th30, A45;
then A47: R1 == (((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B)) by A46, SURREALO:9;
((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B)) == (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B)) by Th30;
then (((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B))) + ((uReal . (e / 2)) * (y .. B)) == ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + ((uReal . (e / 2)) * (y .. B)) by SURREALR:43;
then A48: R1 == ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + ((uReal . (e / 2)) * (y .. B)) by A47, SURREALO:9;
y .. B = y . B by Def5, A4, A45, ORDINAL1:10;
then y .. A infinitely< y .. B by A45, A4, A5, SURREALC:def 16;
then y .. A infinitely< (uReal . (e / 2)) * (y .. B) by SURREALC:13;
then A49: (uReal . (- (r . A))) * (y .. A) < (uReal . (e / 2)) * (y .. B) by A7, SURREALC:20;
A50: ( (uReal . (- (r . A))) * (y .. A) == (- (uReal . (r . A))) * (y .. A) & (- (uReal . (r . A))) * (y .. A) = - ((uReal . (r . A)) * (y .. A)) ) by SURREALN:56, SURREALR:54, SURREALR:58;
- ry == - ((uReal . (r . A)) * (y .. A)) by A8, SURREALR:10;
then (uReal . (- (r . A))) * (y .. A) == - ry by A50, SURREALO:9;
then A51: - ry < (uReal . (e / 2)) * (y .. B) by A49, SURREALO:9;
A52: ( R1 + ry == (((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + ((uReal . (e / 2)) * (y .. B))) + ry & (((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + ((uReal . (e / 2)) * (y .. B))) + ry = ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + (((uReal . (e / 2)) * (y .. B)) + ry) ) by A48, SURREALR:37, SURREALR:43;
ry - (- ((uReal . (e / 2)) * (y .. B))) > 0_No by A51, SURREALR:45, SURREALR:10;
then ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + (ry + ((uReal . (e / 2)) * (y .. B))) > ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B))) + 0_No by SURREALR:44;
then R > (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B)) by A52, A43, A44, SURREALO:9;
then A53: R >= (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B)) by SURREALO:6;
A in succ A by ORDINAL1:6;
then B in succ A by A45, ORDINAL1:10;
then ( (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + (e / 2))) * (y .. B)) in R_ SryA1 & SryA1 in {SryA1} & {SryA1} << R_ SryA1 ) by SURREALO:11, TARSKI:def 1;
then SryA1 < R by A53, SURREALO:9;
hence L < R by A42, SURREALO:9; :: thesis: verum
end;
suppose R in {SryB} ++ (R_ ry) ; :: thesis: not R <= L
then consider R1, R2 being Surreal such that
A54: ( R1 in {SryB} & R2 in R_ ry & R = R1 + R2 ) by SURREALR:def 8;
A55: R1 = SryB by A54, TARSKI:def 1;
consider e2 being positive Real such that
A56: R2 = (uReal . ((r . A) + e2)) * (y .. A) by A54;
A57: R == (Sum ((r | A),(y | A))) + ((uReal . ((r . A) + e2)) * (y .. A)) by A55, A54, A56, A12, SURREALR:43;
A in succ A by ORDINAL1:6;
then A58: (Sum ((r | A),(y | A))) + ((uReal . ((r . A) + e2)) * (y .. A)) in { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) where B is Element of succ A, e is positive Real : B in succ A } ;
( SryA1 in {SryA1} & {SryA1} << R_ SryA1 ) by SURREALO:11, TARSKI:def 1;
then SryA1 < R by A57, A58, SURREALO:9;
hence L < R by A42, SURREALO:9; :: thesis: verum
end;
end;
end;
SryA == SryB + ry by A13, A18, A24, A40, SURREAL0:43;
then ( Sum ((r | (succ A)),(y | (succ A))) == SryB + ry & SryB + ry == (Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)) ) by A10, A12, A8, SURREALO:9, SURREALR:43;
hence Sum ((r | (succ A)),(y | (succ A))) == (Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)) by SURREALO:9; :: thesis: verum