let A be Ordinal; :: thesis: for y being positive decreasing_infinitely Surreal-Sequence
for r being Sequence of REAL st A c= (dom r) /\ (dom y) holds
Sum (((- r) | A),(y | A)) == - (Sum ((r | A),(y | A)))

let y be positive decreasing_infinitely Surreal-Sequence; :: thesis: for r being Sequence of REAL st A c= (dom r) /\ (dom y) holds
Sum (((- r) | A),(y | A)) == - (Sum ((r | A),(y | A)))

let r be Sequence of REAL ; :: thesis: ( A c= (dom r) /\ (dom y) implies Sum (((- r) | A),(y | A)) == - (Sum ((r | A),(y | A))) )
set mr = - r;
defpred S1[ Ordinal] means ( $1 c= (dom r) /\ (dom y) implies Sum (((- r) | $1),(y | $1)) == - (Sum ((r | $1),(y | $1))) );
A1: for A being Ordinal st ( for C being Ordinal st C in A holds
S1[C] ) holds
S1[A]
proof
let A be Ordinal; :: thesis: ( ( for C being Ordinal st C in A holds
S1[C] ) implies S1[A] )

assume A2: for C being Ordinal st C in A holds
S1[C] ; :: thesis: S1[A]
assume A3: A c= (dom r) /\ (dom y) ; :: thesis: Sum (((- r) | A),(y | A)) == - (Sum ((r | A),(y | A)))
A4: dom (- r) = dom r by VALUED_1:8;
reconsider Sr = [ { ((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 A3, Th61;
reconsider Smr = [ { ((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 A3, A4, Th61;
( Unique_No Sr = Sum ((r | A),(y | A)) & Unique_No Smr = Sum (((- r) | A),(y | A)) ) by A3, A4, Th62;
then A5: ( Sr == Sum ((r | A),(y | A)) & Smr == Sum (((- r) | A),(y | A)) ) by SURREALO:def 10;
A6: - Sr = [(-- (R_ Sr)),(-- (L_ Sr))] by SURREALR:7;
A7: L_ (- Sr) << {Smr}
proof
let x, yy be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not x in L_ (- Sr) or not yy in {Smr} or not yy <= x )
assume A8: ( x in L_ (- Sr) & yy in {Smr} ) ; :: thesis: not yy <= x
consider mx being Surreal such that
A9: ( mx in R_ Sr & x = - mx ) by A6, A8, SURREALR:def 4;
consider B being Element of A, e being positive Real such that
A10: ( mx = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) & B in A ) by A9;
A11: Sum (((- r) | B),(y | B)) == - (Sum ((r | B),(y | B))) by A2, A10, A3, ORDINAL1:def 2;
A12: - (r . B) = (- r) . B by VALUED_1:8;
- ((r . B) + e) = ((- r) . B) - e by A12;
then (- (uReal . ((r . B) + e))) * (y .. B) == (uReal . (((- r) . B) - e)) * (y .. B) by SURREALN:56, SURREALR:54;
then ( (- (Sum ((r | B),(y | B)))) + (- ((uReal . ((r . B) + e)) * (y .. B))) = (- (Sum ((r | B),(y | B)))) + ((- (uReal . ((r . B) + e))) * (y .. B)) & (- (Sum ((r | B),(y | B)))) + ((- (uReal . ((r . B) + e))) * (y .. B)) == (Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) - e)) * (y .. B)) ) by A11, SURREALR:43, SURREALR:58;
then A13: x == (Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) - e)) * (y .. B)) by A10, A9, SURREALR:40;
(Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) - e)) * (y .. B)) < Sum (((- r) | A),(y | A)) by A3, A4, A10, Th69;
then x < Sum (((- r) | A),(y | A)) by A13, SURREALO:9;
then x < Smr by A5, SURREALO:9;
hence not yy <= x by A8, TARSKI:def 1; :: thesis: verum
end;
A14: {Smr} << R_ (- Sr)
proof
let yy, x be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not yy in {Smr} or not x in R_ (- Sr) or not x <= yy )
assume A15: ( yy in {Smr} & x in R_ (- Sr) ) ; :: thesis: not x <= yy
consider mx being Surreal such that
A16: ( mx in L_ Sr & x = - mx ) by A6, A15, SURREALR:def 4;
consider B being Element of A, e being positive Real such that
A17: ( mx = (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) & B in A ) by A16;
A18: Sum (((- r) | B),(y | B)) == - (Sum ((r | B),(y | B))) by A3, A17, A2, ORDINAL1:def 2;
A19: - (r . B) = (- r) . B by VALUED_1:8;
- ((r . B) - e) = ((- r) . B) + e by A19;
then (- (uReal . ((r . B) - e))) * (y .. B) == (uReal . (((- r) . B) + e)) * (y .. B) by SURREALR:54, SURREALN:56;
then ( (- (Sum ((r | B),(y | B)))) + (- ((uReal . ((r . B) - e)) * (y .. B))) = (- (Sum ((r | B),(y | B)))) + ((- (uReal . ((r . B) - e))) * (y .. B)) & (- (Sum ((r | B),(y | B)))) + ((- (uReal . ((r . B) - e))) * (y .. B)) == (Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) + e)) * (y .. B)) ) by A18, SURREALR:43, SURREALR:58;
then A20: x == (Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) + e)) * (y .. B)) by A17, A16, SURREALR:40;
(Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) + e)) * (y .. B)) > Sum (((- r) | A),(y | A)) by A3, A4, A17, Th69;
then x > Sum (((- r) | A),(y | A)) by A20, SURREALO:9;
then x > Smr by A5, SURREALO:9;
hence not x <= yy by A15, TARSKI:def 1; :: thesis: verum
end;
A21: {(- Sr)} << R_ Smr
proof
let yy, x be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not yy in {(- Sr)} or not x in R_ Smr or not x <= yy )
assume A22: ( yy in {(- Sr)} & x in R_ Smr ) ; :: thesis: not x <= yy
consider B being Element of A, e being positive Real such that
A23: ( x = (Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) + e)) * (y .. B)) & B in A ) by A22;
A24: Sum (((- r) | B),(y | B)) == - (Sum ((r | B),(y | B))) by A2, A23, A3, ORDINAL1:def 2;
- (r . B) = (- r) . B by VALUED_1:8;
then - ((r . B) - e) = ((- r) . B) + e ;
then (- (uReal . ((r . B) - e))) * (y .. B) == (uReal . (((- r) . B) + e)) * (y .. B) by SURREALR:54, SURREALN:56;
then x == (- (Sum ((r | B),(y | B)))) + ((- (uReal . ((r . B) - e))) * (y .. B)) by A23, A24, SURREALR:43;
then x == (- (Sum ((r | B),(y | B)))) + (- ((uReal . ((r . B) - e)) * (y .. B))) by SURREALR:58;
then A25: x == - ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) by SURREALR:40;
(Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) < Sum ((r | A),(y | A)) by A3, A23, Th69;
then (Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B)) < Sr by A5, SURREALO:9;
then - ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e)) * (y .. B))) > - Sr by SURREALR:10;
then x > - Sr by A25, SURREALO:9;
hence not x <= yy by A22, TARSKI:def 1; :: thesis: verum
end;
L_ Smr << {(- Sr)}
proof
let x, yy be Surreal; :: according to SURREAL0:def 20 :: thesis: ( not x in L_ Smr or not yy in {(- Sr)} or not yy <= x )
assume A26: ( x in L_ Smr & yy in {(- Sr)} ) ; :: thesis: not yy <= x
consider B being Element of A, e being positive Real such that
A27: ( x = (Sum (((- r) | B),(y | B))) + ((uReal . (((- r) . B) - e)) * (y .. B)) & B in A ) by A26;
A28: Sum (((- r) | B),(y | B)) == - (Sum ((r | B),(y | B))) by A2, A3, A27, ORDINAL1:def 2;
- (r . B) = (- r) . B by VALUED_1:8;
then - ((r . B) + e) = ((- r) . B) - e ;
then (- (uReal . ((r . B) + e))) * (y .. B) == (uReal . (((- r) . B) - e)) * (y .. B) by SURREALR:54, SURREALN:56;
then x == (- (Sum ((r | B),(y | B)))) + ((- (uReal . ((r . B) + e))) * (y .. B)) by A27, A28, SURREALR:43;
then x == (- (Sum ((r | B),(y | B)))) + (- ((uReal . ((r . B) + e)) * (y .. B))) by SURREALR:58;
then A29: x == - ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) by SURREALR:40;
(Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) > Sum ((r | A),(y | A)) by A3, A27, Th69;
then (Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B)) > Sr by A5, SURREALO:9;
then - ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e)) * (y .. B))) < - Sr by SURREALR:10;
then x < - Sr by A29, SURREALO:9;
hence not yy <= x by A26, TARSKI:def 1; :: thesis: verum
end;
then - Sr == Smr by A7, A14, A21, SURREAL0:43;
then A30: - Sr == Sum (((- r) | A),(y | A)) by A5, SURREALO:9;
- (Sum ((r | A),(y | A))) == - Sr by SURREALR:10, A5;
hence Sum (((- r) | A),(y | A)) == - (Sum ((r | A),(y | A))) by A30, SURREALO:9; :: thesis: verum
end;
for A being Ordinal holds S1[A] from ORDINAL1:sch 2(A1);
hence ( A c= (dom r) /\ (dom y) implies Sum (((- r) | A),(y | A)) == - (Sum ((r | A),(y | A))) ) ; :: thesis: verum