set IT = { [a,b] where a is Element of A, b is Element of B : ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) } ;
A2: { [a,b] where a is Element of A, b is Element of B : ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) } c= [:A,B:]
proof
let ab be object ; :: according to TARSKI:def 3 :: thesis: ( not ab in { [a,b] where a is Element of A, b is Element of B : ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) } or ab in [:A,B:] )
assume ab in { [a,b] where a is Element of A, b is Element of B : ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) } ; :: thesis: ab in [:A,B:]
then consider a being Element of A, b being Element of B such that
A3: ( ab = [a,b] & a in dom y & b in dom z & (y .. a) + (z .. b) == s ) ;
thus ab in [:A,B:] by A1, A3, ZFMISC_1:def 2; :: thesis: verum
end;
then reconsider IT = { [a,b] where a is Element of A, b is Element of B : ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) } as Relation ;
dom IT c= dom y
proof
let d be object ; :: according to TARSKI:def 3 :: thesis: ( not d in dom IT or d in dom y )
assume d in dom IT ; :: thesis: d in dom y
then consider e being object such that
A4: [d,e] in IT by XTUPLE_0:def 12;
consider a being Element of A, b being Element of B such that
A5: ( [d,e] = [a,b] & a in dom y & b in dom z & (y .. a) + (z .. b) == s ) by A4;
thus d in dom y by A5, XTUPLE_0:1; :: thesis: verum
end;
then consider ss being Ordinal-Sequence such that
A6: ( ss is increasing & rng ss = dom IT ) by Th27;
IT is Function-like
proof
let x, y1, y2 be object ; :: according to FUNCT_1:def 1 :: thesis: ( not [x,y1] in IT or not [x,y2] in IT or y1 = y2 )
assume A7: ( [x,y1] in IT & [x,y2] in IT ) ; :: thesis: y1 = y2
consider a1 being Element of A, b1 being Element of B such that
A8: ( [x,y1] = [a1,b1] & a1 in dom y & b1 in dom z & (y .. a1) + (z .. b1) == s ) by A7;
consider a2 being Element of A, b2 being Element of B such that
A9: ( [x,y2] = [a2,b2] & a2 in dom y & b2 in dom z & (y .. a2) + (z .. b2) == s ) by A7;
A10: ( a1 = x & x = a2 & b1 = y1 & b2 = y2 ) by A8, A9, XTUPLE_0:1;
then (y .. a1) + (z .. b1) == (y .. a1) + (z .. b2) by A8, A9, SURREALO:4;
then A11: z .. b1 == ((y .. a1) + (z .. b2)) - (y .. a1) by SURREALR:41, SURREALR:42;
A12: (y .. a1) - (y .. a1) == 0_No by SURREALR:39;
((y .. a1) + (z .. b2)) + (- (y .. a1)) = ((y .. a1) - (y .. a1)) + (z .. b2) by SURREALR:37;
then ((y .. a1) + (z .. b2)) + (- (y .. a1)) == 0_No + (z .. b2) by A12, SURREALR:43;
then A13: z .. b1 == z .. b2 by A11, SURREALO:4;
A14: rng z is ==_distinct ;
( z . b1 = z .. b1 & z . b2 = z .. b2 & z . b1 in rng z & z . b2 in rng z ) by A8, A9, Def5, FUNCT_1:def 3;
hence y1 = y2 by A10, A8, A9, A13, A14, FUNCT_1:def 4; :: thesis: verum
end;
then reconsider IT = IT as Function ;
A15: dom (IT * ss) = dom ss by A6, RELAT_1:27;
then reconsider ITs = IT * ss as Sequence by ORDINAL1:def 7;
A16: rng IT c= dom z
proof
let d be object ; :: according to TARSKI:def 3 :: thesis: ( not d in rng IT or d in dom z )
assume d in rng IT ; :: thesis: d in dom z
then consider e being object such that
A17: [e,d] in IT by XTUPLE_0:def 13;
consider a being Element of A, b being Element of B such that
A18: ( [e,d] = [a,b] & a in dom y & b in dom z & (y .. a) + (z .. b) == s ) by A17;
thus d in dom z by A18, XTUPLE_0:1; :: thesis: verum
end;
rng ITs c= rng IT by RELAT_1:26;
then rng ITs c= dom z by A16;
then reconsider ITs = ITs as Ordinal-Sequence by ORDINAL2:def 4;
for a, b being Ordinal st a in b & b in dom ITs holds
ITs . b in ITs . a
proof
let a, b be Ordinal; :: thesis: ( a in b & b in dom ITs implies ITs . b in ITs . a )
assume A19: ( a in b & b in dom ITs ) ; :: thesis: ITs . b in ITs . a
a in dom ITs by A19, ORDINAL1:10;
then A20: ( ITs . a = IT . (ss . a) & a in dom ss & ss . a in dom IT ) by FUNCT_1:12, FUNCT_1:11;
A21: ( ITs . b = IT . (ss . b) & b in dom ss & ss . b in dom IT ) by A19, FUNCT_1:12, FUNCT_1:11;
[(ss . a),(ITs . a)] in IT by A20, FUNCT_1:def 2;
then consider a1 being Element of A, b1 being Element of B such that
A22: ( [(ss . a),(ITs . a)] = [a1,b1] & a1 in dom y & b1 in dom z & (y .. a1) + (z .. b1) == s ) ;
[(ss . b),(ITs . b)] in IT by A21, FUNCT_1:def 2;
then consider a2 being Element of A, b2 being Element of B such that
A23: ( [(ss . b),(ITs . b)] = [a2,b2] & a2 in dom y & b2 in dom z & (y .. a2) + (z .. b2) == s ) ;
A24: ( ss . a = a1 & ITs . a = b1 & ss . b = a2 & ITs . b = b2 ) by A22, A23, XTUPLE_0:1;
( y .. a1 = y . a1 & y .. a2 = y . a2 ) by A22, A23, Def5;
then y .. a2 < y .. a1 by A6, A19, A21, ORDINAL2:def 12, A24, A23, SURREALC:def 11;
then (y .. a2) + (z .. b1) < (y .. a1) + (z .. b1) by SURREALR:44;
then (y .. a2) + (z .. b1) < s by A22, SURREALO:4;
then (y .. a2) + (z .. b1) < (y .. a2) + (z .. b2) by A23, SURREALO:4;
then A25: z .. b1 < ((y .. a2) + (z .. b2)) - (y .. a2) by SURREALR:42;
A26: ( z .. b1 = z . b1 & z .. b2 = z . b2 ) by A22, A23, Def5;
A27: (y .. a2) - (y .. a2) == 0_No by SURREALR:39;
((y .. a2) + (z .. b2)) + (- (y .. a2)) = ((y .. a2) - (y .. a2)) + (z .. b2) by SURREALR:37;
then A28: ((y .. a2) + (z .. b2)) + (- (y .. a2)) == 0_No + (z .. b2) by A27, SURREALR:43;
then A29: z .. b1 < z .. b2 by A25, SURREALO:4;
not z .. b2 < z .. b1 by A29, SURREALO:6;
then not b1 in b2 by A26, A23, SURREALC:def 11;
then b2 c< b1 by A28, A25, ORDINAL1:16;
hence ITs . b in ITs . a by A24, ORDINAL1:11; :: thesis: verum
end;
then ITs is decreasing by ORDINAL5:def 1;
then IT is finite by A6, A15, FINSET_1:8, FINSET_1:10;
then reconsider I = IT as Element of Fin [:A,B:] by A2, FINSUB_1:def 5;
take I ; :: thesis: for a, b being Ordinal holds
( [a,b] in I iff ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) )

let a, b be Ordinal; :: thesis: ( [a,b] in I iff ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) )
hereby :: thesis: ( a in dom y & b in dom z & (y .. a) + (z .. b) == s implies [a,b] in I )
assume [a,b] in I ; :: thesis: ( a in dom y & b in dom z & (y .. a) + (z .. b) == s )
then consider a1 being Element of A, b1 being Element of B such that
A30: ( [a,b] = [a1,b1] & a1 in dom y & b1 in dom z & (y .. a1) + (z .. b1) == s ) ;
( a = a1 & b = b1 ) by A30, XTUPLE_0:1;
hence ( a in dom y & b in dom z & (y .. a) + (z .. b) == s ) by A30; :: thesis: verum
end;
thus ( a in dom y & b in dom z & (y .. a) + (z .. b) == s implies [a,b] in I ) by A1; :: thesis: verum