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

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

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

let y be positive decreasing_infinitely Surreal-Sequence; :: thesis: ( succ A c= (dom r) /\ (dom y) & x = [ { ((Sum ((r | A),(y | A))) + ((uReal . ((r . A) - e1)) * (y .. A))) where e1 is positive Real : verum } , { ((Sum ((r | A),(y | A))) + ((uReal . ((r . A) + e2)) * (y .. A))) where e2 is positive Real : verum } ] implies Sum ((r | (succ A)),(y | (succ A))) = Unique_No x )
assume that
A1: succ A c= (dom r) /\ (dom y) and
A2: x = [ { ((Sum ((r | A),(y | A))) + ((uReal . ((r . A) - e)) * (y .. A))) where e is positive Real : verum } , { ((Sum ((r | A),(y | A))) + ((uReal . ((r . A) + e)) * (y .. A))) where e is positive Real : verum } ] ; :: thesis: Sum ((r | (succ A)),(y | (succ A))) = Unique_No x
set N = y .. A;
set SA = Sum ((r | A),(y | A));
set sA = succ A;
A3: succ ((dom r) /\ (dom y)) = dom (Partial_Sums (r,y)) by SURREALC:def 20;
A4: Partial_Sums (r,y),y,r simplest_on_position succ A by A3, A1, ORDINAL1:22, SURREALC:def 20;
A5: (Partial_Sums (r,y)) . (succ A) = Sum ((r | (succ A)),(y | (succ A))) by A1, Th58;
A6: A in succ A by ORDINAL1:6;
then A7: A c= (dom r) /\ (dom y) by A1, ORDINAL1:def 2;
A8: Sum ((r | A),(y | A)) = (Partial_Sums (r,y)) . A by A6, A1, ORDINAL1:def 2, Th58;
set U = Unique_No x;
A9: x == Unique_No x by SURREALO:def 10;
A10: x is Sum ((r | A),(y | A)),y .. A,r . A _Term by A2, Th54;
then A11: |.((Unique_No x) - ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)))).| infinitely< y .. A by A9, SURREALC:74, SURREALC:def 14;
A12: A in dom y by A1, A6, XBOOLE_0:def 4;
then A13: y .. A = y . A by Def5;
A14: Unique_No x in_meets_terms Partial_Sums (r,y),y,r, succ A
proof
let beta be Ordinal; :: according to SURREALC:def 17 :: thesis: for b1, b2 being set holds
( not beta in succ A or not b1 = (Partial_Sums (r,y)) . beta or not b2 = y . beta or Unique_No x is b1,b2,r . beta _Term )

let sb, yb be Surreal; :: thesis: ( not beta in succ A or not sb = (Partial_Sums (r,y)) . beta or not yb = y . beta or Unique_No x is sb,yb,r . beta _Term )
assume A15: ( beta in succ A & sb = (Partial_Sums (r,y)) . beta & yb = y . beta ) ; :: thesis: Unique_No x is sb,yb,r . beta _Term
per cases ( beta = A or beta in A ) by A15, ORDINAL1:8;
suppose beta = A ; :: thesis: Unique_No x is sb,yb,r . beta _Term
hence Unique_No x is sb,yb,r . beta _Term by A15, A8, A13, A10, A9, SURREALC:74; :: thesis: verum
end;
suppose A16: beta in A ; :: thesis: Unique_No x is sb,yb,r . beta _Term
A17: ((Partial_Sums (r,y)) | (succ A)) . beta = (Partial_Sums (r,y)) . beta by A15, FUNCT_1:49;
A18: (Partial_Sums (r,y)) | (succ A) = Partial_Sums ((r | A),(y | A)) by SURREALC:87;
A19: ( beta in dom y & beta in dom r ) by A7, A16, XBOOLE_0:def 4;
( dom (r | A) = (dom r) /\ A & dom (y | A) = (dom y) /\ A ) by RELAT_1:61;
then ( beta in dom (r | A) & beta in dom (y | A) ) by A16, A19, XBOOLE_0:def 4;
then A20: beta in (dom (r | A)) /\ (dom (y | A)) by XBOOLE_0:def 4;
A21: ( (y | A) . beta = yb & (r | A) . beta = r . beta ) by A15, A16, FUNCT_1:49;
Sum ((r | A),(y | A)) is sb,yb,r . beta _Term by A18, A17, A15, A21, A20, SURREALC:92, SURREALC:def 17;
then A22: |.((Sum ((r | A),(y | A))) - (sb + ((uReal . (r . beta)) * yb))).| infinitely< yb by SURREALC:def 14;
|.((Unique_No x) - ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)))).| <= y .. A by A11, SURREALC:9;
then A23: |.((Unique_No x) - ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)))).| infinitely< yb by A16, A12, A13, A15, SURREALC:def 16, SURREALC:11;
y .. A is positive by A13, A12, SURREALC:def 15;
then 0_No <= y .. A ;
then |.((uReal . (r . A)) * (y .. A)).| infinitely< yb by A16, A12, A13, A15, SURREALC:def 16, SURREALC:53;
then A24: |.(((Unique_No x) - ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)))) + ((uReal . (r . A)) * (y .. A))).| infinitely< yb by A23, SURREALC:41;
|.(((Unique_No x) - ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)))) + ((uReal . (r . A)) * (y .. A))).| == |.((Unique_No x) - (Sum ((r | A),(y | A)))).|
proof
A25: ((Unique_No x) + (- ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A))))) + ((uReal . (r . A)) * (y .. A)) = ((Unique_No x) + ((- (Sum ((r | A),(y | A)))) + (- ((uReal . (r . A)) * (y .. A))))) + ((uReal . (r . A)) * (y .. A)) by SURREALR:40
.= (((Unique_No x) + (- (Sum ((r | A),(y | A))))) + (- ((uReal . (r . A)) * (y .. A)))) + ((uReal . (r . A)) * (y .. A)) by SURREALR:37
.= ((Unique_No x) + (- (Sum ((r | A),(y | A))))) + ((- ((uReal . (r . A)) * (y .. A))) + ((uReal . (r . A)) * (y .. A))) by SURREALR:37 ;
(- ((uReal . (r . A)) * (y .. A))) + ((uReal . (r . A)) * (y .. A)) = ((uReal . (r . A)) * (y .. A)) - ((uReal . (r . A)) * (y .. A)) ;
then (- ((uReal . (r . A)) * (y .. A))) + ((uReal . (r . A)) * (y .. A)) == 0_No by SURREALR:39;
then ((Unique_No x) + (- ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A))))) + ((uReal . (r . A)) * (y .. A)) == ((Unique_No x) + (- (Sum ((r | A),(y | A))))) + 0_No by A25, SURREALR:43;
hence |.(((Unique_No x) - ((Sum ((r | A),(y | A))) + ((uReal . (r . A)) * (y .. A)))) + ((uReal . (r . A)) * (y .. A))).| == |.((Unique_No x) - (Sum ((r | A),(y | A)))).| by SURREALC:48; :: thesis: verum
end;
then |.((Unique_No x) - (Sum ((r | A),(y | A)))).| infinitely< yb by A24, SURREALC:17;
then A26: |.(((Unique_No x) - (Sum ((r | A),(y | A)))) + ((Sum ((r | A),(y | A))) - (sb + ((uReal . (r . beta)) * yb)))).| infinitely< yb by A22, SURREALC:41;
|.((Unique_No x) - (sb + ((uReal . (r . beta)) * yb))).| == |.(((Unique_No x) - (Sum ((r | A),(y | A)))) + ((Sum ((r | A),(y | A))) - (sb + ((uReal . (r . beta)) * yb)))).|
proof
A27: ((Unique_No x) - (Sum ((r | A),(y | A)))) + ((Sum ((r | A),(y | A))) - (sb + ((uReal . (r . beta)) * yb))) = (((Unique_No x) + (- (Sum ((r | A),(y | A))))) + (Sum ((r | A),(y | A)))) - (sb + ((uReal . (r . beta)) * yb)) by SURREALR:37
.= ((Unique_No x) + ((- (Sum ((r | A),(y | A)))) + (Sum ((r | A),(y | A))))) + (- (sb + ((uReal . (r . beta)) * yb))) by SURREALR:37 ;
(- (Sum ((r | A),(y | A)))) + (Sum ((r | A),(y | A))) = (Sum ((r | A),(y | A))) - (Sum ((r | A),(y | A))) ;
then (- (Sum ((r | A),(y | A)))) + (Sum ((r | A),(y | A))) == 0_No by SURREALR:39;
then (Unique_No x) + ((- (Sum ((r | A),(y | A)))) + (Sum ((r | A),(y | A)))) == (Unique_No x) + 0_No by SURREALR:43;
then ((Unique_No x) + ((- (Sum ((r | A),(y | A)))) + (Sum ((r | A),(y | A))))) + (- (sb + ((uReal . (r . beta)) * yb))) == (Unique_No x) + (- (sb + ((uReal . (r . beta)) * yb))) by SURREALR:43;
hence |.((Unique_No x) - (sb + ((uReal . (r . beta)) * yb))).| == |.(((Unique_No x) - (Sum ((r | A),(y | A)))) + ((Sum ((r | A),(y | A))) - (sb + ((uReal . (r . beta)) * yb)))).| by A27, SURREALC:48; :: thesis: verum
end;
hence Unique_No x is sb,yb,r . beta _Term by A26, SURREALC:17, SURREALC:def 14; :: thesis: verum
end;
end;
end;
A28: Sum ((r | (succ A)),(y | (succ A))) in_meets_terms Partial_Sums (r,y),y,r, succ A by A4, A5, SURREALC:def 18;
A29: Sum ((r | (succ A)),(y | (succ A))) is Sum ((r | A),(y | A)),y .. A,r . A _Term by A13, A28, ORDINAL1:6, A8, SURREALC:def 17;
A30: for x being uSurreal st x in_meets_terms Partial_Sums (r,y),y,r, succ A & x <> Sum ((r | (succ A)),(y | (succ A))) holds
born (Sum ((r | (succ A)),(y | (succ A)))) in born x by A4, A5, SURREALC:def 18;
Sum ((r | (succ A)),(y | (succ A))) = Unique_No x
proof
assume A31: Sum ((r | (succ A)),(y | (succ A))) <> Unique_No x ; :: thesis: contradiction
A32: born (Sum ((r | (succ A)),(y | (succ A)))) c= born (Unique_No x) by A14, A30, ORDINAL1:def 2;
Unique_No x == x by SURREALO:def 10;
then born (Unique_No x) in born (Unique_No x) by A32, A2, Th54, A31, A29;
hence contradiction ; :: thesis: verum
end;
hence Sum ((r | (succ A)),(y | (succ A))) = Unique_No x ; :: thesis: verum