let A be Ordinal; for x being Surreal
for r being Sequence of REAL
for y being positive decreasing_infinitely Surreal-Sequence st A c= (dom r) /\ (dom y) & x = [ { ((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 } ] holds
Sum ((r | A),(y | A)) = Unique_No x
let x be Surreal; for r being Sequence of REAL
for y being positive decreasing_infinitely Surreal-Sequence st A c= (dom r) /\ (dom y) & x = [ { ((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 } ] holds
Sum ((r | A),(y | A)) = Unique_No x
let r be Sequence of REAL ; for y being positive decreasing_infinitely Surreal-Sequence st A c= (dom r) /\ (dom y) & x = [ { ((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 } ] holds
Sum ((r | A),(y | A)) = Unique_No x
let y be positive decreasing_infinitely Surreal-Sequence; ( A c= (dom r) /\ (dom y) & x = [ { ((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 } ] implies Sum ((r | A),(y | A)) = Unique_No x )
assume A1:
A c= (dom r) /\ (dom y)
; ( not x = [ { ((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 } ] or Sum ((r | A),(y | A)) = Unique_No x )
set xL = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } ;
set xR = { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } ;
assume A2:
( x = [ { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } , { ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } ] & Sum ((r | A),(y | A)) <> Unique_No x )
; contradiction
set U = Unique_No x;
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
;
contradictionA7:
{ ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) - e1)) * (y .. B))) where B is Element of A, e1 is positive Real : B in A } = {}
{ ((Sum ((r | B),(y | B))) + ((uReal . ((r . B) + e2)) * (y .. B))) where B is Element of A, e2 is positive Real : B in A } = {}
hence
contradiction
by A7, A2, A6, A4, A3, SURREALC:def 18, SURREALO:42;
verum end; suppose A10:
A <> 0
;
contradictionA11:
Unique_No x == x
by SURREALO:def 10;
(
L_ x << {(Sum ((r | A),(y | A)))} &
{(Sum ((r | A),(y | A)))} << R_ x )
by A1, A2, Lm3;
then A12:
born (Unique_No x) c= born (Sum ((r | A),(y | A)))
by Th53;
(dom r) /\ (dom y) c= dom r
by XBOOLE_1:17;
then A13:
A c= dom r
by A1;
x in_meets_terms Partial_Sums (
r,
y),
y,
r,
A
proof
let B be
Ordinal;
SURREALC:def 17 for b1, b2 being set holds
( not B in A or not b1 = (Partial_Sums (r,y)) . B or not b2 = y . B or x is b1,b2,r . B _Term )let sb,
yb be
Surreal;
( not B in A or not sb = (Partial_Sums (r,y)) . B or not yb = y . B or x is sb,yb,r . B _Term )
assume A14:
(
B in A &
sb = (Partial_Sums (r,y)) . B &
yb = y . B )
;
x is sb,yb,r . B _Term
|.(x - (sb + ((uReal . (r . B)) * yb))).| infinitely< yb
proof
let e be
positive Real;
SURREALC:def 3 not yb <= |.(x - (sb + ((uReal . (r . B)) * yb))).| * (uReal . e)
set E = 1
/ e;
(
B c= (dom r) /\ (dom y) &
B in dom y )
by A1, A14, ORDINAL1:def 2, XBOOLE_0:def 4;
then A15:
(
Sum (
(r | B),
(y | B))
= sb &
yb = y .. B )
by A14, Th58, Def5;
A16:
sb + ((uReal . ((r . B) + (1 / e))) * yb) in R_ x
by A2, A15, A14;
(
x in {x} &
{x} << R_ x )
by TARSKI:def 1, SURREALO:11;
then
(
(sb + ((uReal . (r . B)) * yb)) + (yb * (uReal . (1 / e))) == sb + ((uReal . ((r . B) + (1 / e))) * yb) &
sb + ((uReal . ((r . B) + (1 / e))) * yb) > x )
by A16, Th30;
then
(sb + ((uReal . (r . B)) * yb)) + (yb * (uReal . (1 / e))) > x
by SURREALO:9;
then A17:
x - (sb + ((uReal . (r . B)) * yb)) < yb * (uReal . (1 / e))
by SURREALR:41;
A18:
sb + ((uReal . ((r . B) - (1 / e))) * yb) in L_ x
by A15, A14, A2;
(
L_ x << {x} &
x in {x} )
by TARSKI:def 1, SURREALO:11;
then
(
(sb + ((uReal . (r . B)) * yb)) - (yb * (uReal . (1 / e))) == sb + ((uReal . ((r . B) - (1 / e))) * yb) &
sb + ((uReal . ((r . B) - (1 / e))) * yb) < x )
by A18, Th30;
then
(sb + ((uReal . (r . B)) * yb)) - (yb * (uReal . (1 / e))) < x
by SURREALO:9;
then A19:
- (yb * (uReal . (1 / e))) < x - (sb + ((uReal . (r . B)) * yb))
by SURREALR:42;
A20:
0_No < uReal . e
by SURREALN:47, SURREALN:51;
(1 / e) * e = 1
by XCMPLX_1:87;
then
(
(yb * (uReal . (1 / e))) * (uReal . e) == yb * ((uReal . (1 / e)) * (uReal . e)) &
yb * ((uReal . (1 / e)) * (uReal . e)) == yb * 1_No )
by SURREALR:54, SURREALR:69, SURREALN:57, SURREALN:48;
then A21:
(yb * (uReal . (1 / e))) * (uReal . e) == yb
by SURREALO:9;
|.(x - (sb + ((uReal . (r . B)) * yb))).| < yb * (uReal . (1 / e))
by A17, A19, SURREALC:52;
then
|.(x - (sb + ((uReal . (r . B)) * yb))).| * (uReal . e) < (yb * (uReal . (1 / e))) * (uReal . e)
by A20, SURREALR:70;
hence
|.(x - (sb + ((uReal . (r . B)) * yb))).| * (uReal . e) < yb
by A21, SURREALO:9;
verum
end;
hence
x is
sb,
yb,
r . B _Term
by SURREALC:def 14;
verum
end; then
Unique_No x in_meets_terms Partial_Sums (
r,
y),
y,
r,
A
by A13, A11, SURREALC:82;
then
born (Sum ((r | A),(y | A))) in born (Sum ((r | A),(y | A)))
by A12, A5, A10, A2;
hence
contradiction
;
verum end; end;