let g be ConwayGame; :: thesis: ( g is nonnegative iff for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL is nonnegative ) )

defpred S2[ set ] means for g being ConwayGame st g in $1 holds
for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in $1 );
A1: for s being set
for alpha being Ordinal st S2[s] holds
S2[s /\ (ConwayDay alpha)]
proof
let s be set ; :: thesis: for alpha being Ordinal st S2[s] holds
S2[s /\ (ConwayDay alpha)]

let alpha be Ordinal; :: thesis: ( S2[s] implies S2[s /\ (ConwayDay alpha)] )
assume A2: S2[s] ; :: thesis: S2[s /\ (ConwayDay alpha)]
let g be ConwayGame; :: thesis: ( g in s /\ (ConwayDay alpha) implies for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s /\ (ConwayDay alpha) ) )

assume g in s /\ (ConwayDay alpha) ; :: thesis: for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s /\ (ConwayDay alpha) )

then A3: ( g in s & g in ConwayDay alpha ) by XBOOLE_0:def 4;
let gR be ConwayGame; :: thesis: ( gR in the_RightOptions_of g implies ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s /\ (ConwayDay alpha) ) )

assume A4: gR in the_RightOptions_of g ; :: thesis: ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s /\ (ConwayDay alpha) )

then consider gRL being ConwayGame such that
A5: ( gRL in the_LeftOptions_of gR & gRL in s ) by A2, A3;
take gRL ; :: thesis: ( gRL in the_LeftOptions_of gR & gRL in s /\ (ConwayDay alpha) )
gR in ConwayDay alpha by Th11, A3, A4;
then gRL in ConwayDay alpha by Th11, A5;
hence ( gRL in the_LeftOptions_of gR & gRL in s /\ (ConwayDay alpha) ) by A5, XBOOLE_0:def 4; :: thesis: verum
end;
hereby :: thesis: ( ( for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL is nonnegative ) ) implies g is nonnegative )
assume g is nonnegative ; :: thesis: for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL is nonnegative )

then consider s being set such that
A6: ( g in s & S2[s] ) ;
let gR be ConwayGame; :: thesis: ( gR in the_RightOptions_of g implies ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL is nonnegative ) )

assume gR in the_RightOptions_of g ; :: thesis: ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL is nonnegative )

then consider gRL being ConwayGame such that
A7: ( gRL in the_LeftOptions_of gR & gRL in s ) by A6;
take gRL = gRL; :: thesis: ( gRL in the_LeftOptions_of gR & gRL is nonnegative )
thus gRL in the_LeftOptions_of gR by A7; :: thesis: gRL is nonnegative
thus gRL is nonnegative by A6, A7; :: thesis: verum
end;
hereby :: thesis: verum
assume A8: for gR being ConwayGame st gR in the_RightOptions_of g holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL is nonnegative ) ; :: thesis: g is nonnegative
consider alpha being Ordinal such that
A9: g in ConwayDay alpha by Def3;
now :: thesis: ex s being set st
( g in s & S2[s] )
set ss = { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } ;
take s = union { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } ; :: thesis: ( g in s & S2[s] )
A10: S2[s]
proof
let g1 be ConwayGame; :: thesis: ( g1 in s implies for gR being ConwayGame st gR in the_RightOptions_of g1 holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s ) )

assume g1 in s ; :: thesis: for gR being ConwayGame st gR in the_RightOptions_of g1 holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s )

then consider s2 being set such that
A11: ( g1 in s2 & s2 in { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } ) by TARSKI:def 4;
consider s1 being Subset of (ConwayDay alpha) such that
A12: ( s1 = s2 & S2[s1] ) by A11;
let gR be ConwayGame; :: thesis: ( gR in the_RightOptions_of g1 implies ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s ) )

assume gR in the_RightOptions_of g1 ; :: thesis: ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in s )

then consider gRL being ConwayGame such that
A13: ( gRL in the_LeftOptions_of gR & gRL in s1 ) by A11, A12;
take gRL ; :: thesis: ( gRL in the_LeftOptions_of gR & gRL in s )
s2 c= s by A11, ZFMISC_1:74;
hence ( gRL in the_LeftOptions_of gR & gRL in s ) by A12, A13; :: thesis: verum
end;
thus g in s :: thesis: S2[s]
proof
now :: thesis: for x being set st x in { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } holds
x c= ConwayDay alpha
let x be set ; :: thesis: ( x in { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } implies x c= ConwayDay alpha )
assume x in { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } ; :: thesis: x c= ConwayDay alpha
then ex s1 being Subset of (ConwayDay alpha) st
( x = s1 & S2[s1] ) ;
hence x c= ConwayDay alpha ; :: thesis: verum
end;
then A14: s c= ConwayDay alpha by ZFMISC_1:76;
{g} c= ConwayDay alpha by A9, ZFMISC_1:31;
then reconsider sg = s \/ {g} as Subset of (ConwayDay alpha) by A14, XBOOLE_1:8;
S2[sg]
proof
let g1 be ConwayGame; :: thesis: ( g1 in sg implies for gR being ConwayGame st gR in the_RightOptions_of g1 holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in sg ) )

assume A15: g1 in sg ; :: thesis: for gR being ConwayGame st gR in the_RightOptions_of g1 holds
ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in sg )

let gR be ConwayGame; :: thesis: ( gR in the_RightOptions_of g1 implies ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in sg ) )

assume A16: gR in the_RightOptions_of g1 ; :: thesis: ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in sg )

per cases ( g1 in s or g1 in {g} ) by A15, XBOOLE_0:def 3;
suppose g1 in s ; :: thesis: ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in sg )

then consider gRL being ConwayGame such that
A17: ( gRL in the_LeftOptions_of gR & gRL in s ) by A10, A16;
take gRL ; :: thesis: ( gRL in the_LeftOptions_of gR & gRL in sg )
thus gRL in the_LeftOptions_of gR by A17; :: thesis: gRL in sg
s c= sg by XBOOLE_1:7;
hence gRL in sg by A17; :: thesis: verum
end;
suppose g1 in {g} ; :: thesis: ex gRL being ConwayGame st
( gRL in the_LeftOptions_of gR & gRL in sg )

then g1 = g by TARSKI:def 1;
then consider gRL being ConwayGame such that
A18: ( gRL in the_LeftOptions_of gR & gRL is nonnegative ) by A8, A16;
consider s0 being set such that
A19: ( gRL in s0 & S2[s0] ) by A18;
take gRL ; :: thesis: ( gRL in the_LeftOptions_of gR & gRL in sg )
thus gRL in the_LeftOptions_of gR by A18; :: thesis: gRL in sg
reconsider s1 = s0 /\ (ConwayDay alpha) as Subset of (ConwayDay alpha) by XBOOLE_1:17;
S2[s1] by A19, A1;
then s1 in { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } ;
then A20: s1 c= s by ZFMISC_1:74;
gR in ConwayDay alpha by A15, A16, Th11;
then gRL in ConwayDay alpha by A18, Th11;
then gRL in s1 by A19, XBOOLE_0:def 4;
hence gRL in sg by A20, XBOOLE_0:def 3; :: thesis: verum
end;
end;
end;
then A21: sg in { s1 where s1 is Subset of (ConwayDay alpha) : S2[s1] } ;
g in {g} by TARSKI:def 1;
then g in sg by XBOOLE_0:def 3;
hence g in s by A21, TARSKI:def 4; :: thesis: verum
end;
thus S2[s] by A10; :: thesis: verum
end;
hence g is nonnegative ; :: thesis: verum
end;