let x, y be Surreal; :: thesis: ( L_ x << {y} & {y} << R_ x implies ( born (Unique_No x) c= born y & ( not x == y implies born (Unique_No x) in born y ) ) )
assume A1: ( L_ x << {y} & {y} << R_ x ) ; :: thesis: ( born (Unique_No x) c= born y & ( not x == y implies born (Unique_No x) in born y ) )
defpred S1[ Surreal] means ( L_ x << {$1} & {$1} << R_ x );
A2: ex y being Surreal st S1[y] by A1;
A3: for a, b, c being Surreal st a <= b & b <= c & S1[a] & S1[c] holds
S1[b] by SURREALO:17, SURREALO:18;
consider s being uSurreal such that
A4: S1[s] and
A5: for a being uSurreal st S1[a] & a <> s holds
born s in born a from SURREALC:sch 1(A2, A3);
A6: Unique_No y == y by SURREALO:def 10;
then A7: ( L_ x << {(Unique_No y)} & {(Unique_No y)} << R_ x ) by A1, SURREALO:17, SURREALO:18;
for z being Surreal st L_ x << {z} & {z} << R_ x holds
born s c= born z
proof end;
then A12: ( s == x & x == Unique_No x ) by A4, SURREALO:16, SURREALO:def 10;
then s == Unique_No x by SURREALO:9;
then A13: s = Unique_No x by SURREALO:50;
A14: born s = born_eq s by SURREALO:48;
per cases ( x == y or not x == y ) ;
end;