let A, B be Ordinal; for y, z being strictly_decreasing Surreal-Sequence
for c being Surreal st dom y c= A & dom z c= B & ( for a being Surreal st a == c holds
not a in (rng y) ++ (rng z) ) holds
(y,z,A,B) += c = {}
let y, z be strictly_decreasing Surreal-Sequence; for c being Surreal st dom y c= A & dom z c= B & ( for a being Surreal st a == c holds
not a in (rng y) ++ (rng z) ) holds
(y,z,A,B) += c = {}
let c be Surreal; ( dom y c= A & dom z c= B & ( for a being Surreal st a == c holds
not a in (rng y) ++ (rng z) ) implies (y,z,A,B) += c = {} )
assume that
A1:
( dom y c= A & dom z c= B )
and
A2:
for a being Surreal st a == c holds
not a in (rng y) ++ (rng z)
; (y,z,A,B) += c = {}
assume
(y,z,A,B) += c <> {}
; contradiction
then consider x being object such that
A3:
x in (y,z,A,B) += c
by XBOOLE_0:def 1;
(y,z,A,B) += c c= [:A,B:]
by FINSUB_1:def 5;
then consider i, j being object such that
A4:
( i in A & j in B & x = [i,j] )
by A3, ZFMISC_1:def 2;
reconsider i = i, j = j as Ordinal by A4;
A5:
( i in dom y & j in dom z & (y .. i) + (z .. j) == c )
by A3, A1, A4, Def16;
( y . i = y .. i & z . j = z .. j )
by A5, Def5;
then
( y .. i in rng y & z .. j in rng z )
by A5, FUNCT_1:def 3;
then
(y .. i) + (z .. j) in (rng y) ++ (rng z)
by SURREALR:def 8;
hence
contradiction
by A5, A2; verum