let r be Sequence of REAL ; :: thesis: for y being positive decreasing_infinitely Surreal-Sequence
for A being Ordinal st A c= (dom r) /\ (dom y) holds
for Sl, Sr being set st Sl = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } & Sr = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } holds
( Sl is surreal-membered & Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )

let y be positive decreasing_infinitely Surreal-Sequence; :: thesis: for A being Ordinal st A c= (dom r) /\ (dom y) holds
for Sl, Sr being set st Sl = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } & Sr = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } holds
( Sl is surreal-membered & Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )

let A be Ordinal; :: thesis: ( A c= (dom r) /\ (dom y) implies for Sl, Sr being set st Sl = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } & Sr = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } holds
( Sl is surreal-membered & Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr ) )

assume A1: A c= (dom r) /\ (dom y) ; :: thesis: for Sl, Sr being set st Sl = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } & Sr = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } holds
( Sl is surreal-membered & Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )

let Sl, Sr be set ; :: thesis: ( Sl = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } & Sr = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } implies ( Sl is surreal-membered & Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr ) )
assume A2: ( Sl = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } & Sr = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } ) ; :: thesis: ( Sl is surreal-membered & Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )
now :: thesis: for o being object st o in Sl holds
o is surreal
let o be object ; :: thesis: ( o in Sl implies o is surreal )
assume o in Sl ; :: thesis: o is surreal
then ex B being Element of A ex e being positive Real st
( o = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) & B in A ) by A2;
hence o is surreal ; :: thesis: verum
end;
hence Sl is surreal-membered ; :: thesis: ( Sr is surreal-membered & Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )
now :: thesis: for o being object st o in Sr holds
o is surreal
let o be object ; :: thesis: ( o in Sr implies o is surreal )
assume o in Sr ; :: thesis: o is surreal
then ex B being Element of A ex e being positive Real st
( o = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) & B in A ) by A2;
hence o is surreal ; :: thesis: verum
end;
hence Sr is surreal-membered ; :: thesis: ( Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )
set SA = Sum ((r | A),(y | A));
A3: (Partial_Sums (r,y)) . A = Sum ((r | A),(y | A)) by A1, Th58;
( A in succ ((dom r) /\ (dom y)) & succ ((dom r) /\ (dom y)) = dom (Partial_Sums (r,y)) ) by A1, ORDINAL1:22, SURREALC:def 20;
then A4: Partial_Sums (r,y),y,r simplest_on_position A by SURREALC:def 20;
then A5: ( ( 0 = A implies Sum ((r | A),(y | A)) = 0_No ) & ( 0 <> A implies ( Sum ((r | A),(y | A)) in_meets_terms Partial_Sums (r,y),y,r,A & ( for x being uSurreal st x in_meets_terms Partial_Sums (r,y),y,r,A & x <> Sum ((r | A),(y | A)) holds
born (Sum ((r | A),(y | A))) in born x ) ) ) ) by A3, SURREALC:def 18;
per cases ( A = 0 or A <> 0 ) ;
suppose A6: A = 0 ; :: thesis: ( Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )
A7: Sl = {}
proof
assume Sl <> {} ; :: thesis: contradiction
then consider o being object such that
A8: o in Sl by XBOOLE_0:def 1;
ex B being Element of A ex e1 being positive Real st
( o = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B)) & B in A ) by A8, A2;
hence contradiction by A6; :: thesis: verum
end;
Sr = {}
proof
assume Sr <> {} ; :: thesis: contradiction
then consider o being object such that
A9: o in Sr by XBOOLE_0:def 1;
ex B being Element of A ex e1 being positive Real st
( o = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e1)) * (y .. B)) & B in A ) by A9, A2;
hence contradiction by A6; :: thesis: verum
end;
hence ( Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr ) by A7; :: thesis: verum
end;
suppose A10: A <> 0 ; :: thesis: ( Sl << {(Sum ((r | A),(y | A)))} & {(Sum ((r | A),(y | A)))} << Sr )
then A11: Sum ((r | A),(y | A)) in_meets_terms Partial_Sums (r,y),y,r,A by A4, A3, SURREALC:def 18;
thus Sl << {(Sum ((r | A),(y | A)))} :: thesis: {(Sum ((r | A),(y | A)))} << Sr
proof
let l, ss be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not l in Sl or not ss in {(Sum ((r | A),(y | A)))} or not ss <= l )
assume A12: ( l in Sl & ss in {(Sum ((r | A),(y | A)))} ) ; :: thesis: not ss <= l
consider B being Element of A, e being positive Real such that
A13: ( l = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) & B in A ) by A12, A2;
A14: ( B c= (dom r) /\ (dom y) & B in dom y ) by A1, A13, ORDINAL1:def 2, XBOOLE_0:def 4;
A15: Sum ((r | B),(y | B)) = (Partial_Sums (r,y)) . B by Th58, A1, A13, ORDINAL1:def 2;
y .. B = y . B by A14, Def5;
then |.((Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B)))).| infinitely< y .. B by A10, A5, A15, SURREALC:def 17, SURREALC:def 14;
then |.((Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B)))).| infinitely< (uReal . e) * (y .. B) by SURREALC:13;
then |.((Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B)))).| < (uReal . e) * (y .. B) by SURREALC:9;
then - ((uReal . e) * (y .. B)) < (Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) by SURREALC:52;
then A16: ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . e) * (y .. B)) < Sum ((r | A),(y | A)) by SURREALR:42;
(Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) == ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) - ((uReal . e) * (y .. B)) by Th30;
then l < Sum ((r | A),(y | A)) by A13, A16, SURREALO:9;
hence not ss <= l by A12, TARSKI:def 1; :: thesis: verum
end;
thus {(Sum ((r | A),(y | A)))} << Sr :: thesis: verum
proof
let ss, rr be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not ss in {(Sum ((r | A),(y | A)))} or not rr in Sr or not rr <= ss )
assume A17: ( ss in {(Sum ((r | A),(y | A)))} & rr in Sr ) ; :: thesis: not rr <= ss
consider B being Element of A, e being positive Real such that
A18: ( rr = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) & B in A ) by A17, A2;
A19: ( B c= (dom r) /\ (dom y) & B in dom y ) by A1, A18, ORDINAL1:def 2, XBOOLE_0:def 4;
A20: Sum ((r | B),(y | B)) = (Partial_Sums (r,y)) . B by Th58, A1, A18, ORDINAL1:def 2;
y .. B = y . B by A19, Def5;
then |.((Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B)))).| infinitely< y .. B by A11, A18, A20, SURREALC:def 17, SURREALC:def 14;
then |.((Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B)))).| infinitely< (uReal . e) * (y .. B) by SURREALC:13;
then |.((Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B)))).| < (uReal . e) * (y .. B) by SURREALC:9;
then (uReal . e) * (y .. B) > (Sum ((r | A),(y | A))) - ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) by SURREALC:52;
then A21: ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . e) * (y .. B)) > Sum ((r | A),(y | A)) by SURREALR:41;
(Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) == ((Sum ((r | B),(y | B))) + ((uReal . (r . B)) * (y .. B))) + ((uReal . e) * (y .. B)) by Th30;
then rr > Sum ((r | A),(y | A)) by A18, A21, SURREALO:9;
hence not rr <= ss by A17, TARSKI:def 1; :: thesis: verum
end;
end;
end;