let a be Surreal; :: thesis: for y being strictly_decreasing Surreal-Sequence holds rng (y + a) = (rng y) ++ {a}
let y be strictly_decreasing Surreal-Sequence; :: thesis: rng (y + a) = (rng y) ++ {a}
A1: dom (y + a) = dom y by Def17;
A2: rng (y + a) c= (rng y) ++ {a}
proof
let u be object ; :: according to TARSKI:def 3 :: thesis: ( not u in rng (y + a) or u in (rng y) ++ {a} )
assume A3: u in rng (y + a) ; :: thesis: u in (rng y) ++ {a}
consider x being object such that
A4: ( x in dom (y + a) & (y + a) . x = u ) by A3, FUNCT_1:def 3;
A5: (y + a) . x = (y .. x) + a by A4, A1, Def17;
A6: ( y .. x = y . x & y . x in rng y ) by Def5, A4, A1, FUNCT_1:def 3;
a in {a} by TARSKI:def 1;
hence u in (rng y) ++ {a} by A4, A5, A6, SURREALR:def 8; :: thesis: verum
end;
(rng y) ++ {a} c= rng (y + a)
proof
let ya be object ; :: according to TARSKI:def 3 :: thesis: ( not ya in (rng y) ++ {a} or ya in rng (y + a) )
assume A7: ya in (rng y) ++ {a} ; :: thesis: ya in rng (y + a)
consider i, j being Surreal such that
A8: ( i in rng y & j in {a} & ya = i + j ) by A7, SURREALR:def 8;
consider x being object such that
A9: ( x in dom y & y . x = i ) by A8, FUNCT_1:def 3;
( j = a & i = y .. x ) by Def5, A8, A9, TARSKI:def 1;
then (y + a) . x = i + j by A9, Def17;
hence ya in rng (y + a) by FUNCT_1:def 3, A1, A9, A8; :: thesis: verum
end;
hence rng (y + a) = (rng y) ++ {a} by A2; :: thesis: verum