let x be Surreal; :: thesis: for r being non-zero Sequence of REAL
for y being strictly_decreasing Surreal-Sequence
for s being uSurreal-Sequence
for A being Ordinal st A c= dom r & x in_meets_terms s,y,r,A & s,y,r simplest_up_to succ A holds
rng (born (s | (succ A))) c= succ (born_eq x)

let r be non-zero Sequence of REAL ; :: thesis: for y being strictly_decreasing Surreal-Sequence
for s being uSurreal-Sequence
for A being Ordinal st A c= dom r & x in_meets_terms s,y,r,A & s,y,r simplest_up_to succ A holds
rng (born (s | (succ A))) c= succ (born_eq x)

let y be strictly_decreasing Surreal-Sequence; :: thesis: for s being uSurreal-Sequence
for A being Ordinal st A c= dom r & x in_meets_terms s,y,r,A & s,y,r simplest_up_to succ A holds
rng (born (s | (succ A))) c= succ (born_eq x)

let s be uSurreal-Sequence; :: thesis: for A being Ordinal st A c= dom r & x in_meets_terms s,y,r,A & s,y,r simplest_up_to succ A holds
rng (born (s | (succ A))) c= succ (born_eq x)

let A be Ordinal; :: thesis: ( A c= dom r & x in_meets_terms s,y,r,A & s,y,r simplest_up_to succ A implies rng (born (s | (succ A))) c= succ (born_eq x) )
assume A1: ( A c= dom r & x in_meets_terms s,y,r,A & s,y,r simplest_up_to succ A ) ; :: thesis: rng (born (s | (succ A))) c= succ (born_eq x)
let o be object ; :: according to TARSKI:def 3 :: thesis: ( not o in rng (born (s | (succ A))) or o in succ (born_eq x) )
assume A2: o in rng (born (s | (succ A))) ; :: thesis: o in succ (born_eq x)
consider a being object such that
A3: ( a in dom (born (s | (succ A))) & (born (s | (succ A))) . a = o ) by A2, FUNCT_1:def 3;
reconsider a = a as Ordinal by A3;
A4: a in dom (s | (succ A)) by A3, Def20;
then ( a in dom s & a in succ A ) by RELAT_1:57;
then s . a in rng s by FUNCT_1:def 3;
then reconsider sa = s . a as Surreal by SURREAL0:def 16;
sa = (s | (succ A)) . a by A4, FUNCT_1:47;
then A5: o = born sa by A3, A4, Def20;
A6: a c= A by A4, ORDINAL1:22;
then A7: x in_meets_terms s,y,r,a by A1;
Unique_No x == x by SURREALO:def 10;
then A8: Unique_No x in_meets_terms s,y,r,a by A7, A1, A6, XBOOLE_1:1, Th81;
A9: s,y,r simplest_on_position a by A1, A4;
A10: ( born (Unique_No x) = born_eq (Unique_No x) & born_eq (Unique_No x) = born_eq x ) by SURREALO:33, SURREALO:48, SURREALO:def 10;
per cases ( a = 0 or ( a <> 0 & Unique_No x = sa ) or ( a <> 0 & Unique_No x <> sa ) ) ;
end;