defpred S1[ object , object ] means ( $2 is real & ( for A being Ordinal st A in dom y & y . A = yE . $1 holds
r . A = $2 ) & ( for A being Ordinal st not yE . $1 in rng y holds
$2 = 0 ) );
A1: for e being object st e in dom yE holds
ex u being object st S1[e,u]
proof
let e be object ; :: thesis: ( e in dom yE implies ex u being object st S1[e,u] )
assume A2: e in dom yE ; :: thesis: ex u being object st S1[e,u]
reconsider E = e as Ordinal by A2;
per cases ( not yE . E in rng y or yE . E in rng y ) ;
suppose A3: not yE . E in rng y ; :: thesis: ex u being object st S1[e,u]
take 0 ; :: thesis: S1[e, 0 ]
thus S1[e, 0 ] by A3, FUNCT_1:def 3; :: thesis: verum
end;
suppose A4: yE . E in rng y ; :: thesis: ex u being object st S1[e,u]
then consider A being object such that
A5: ( A in dom y & y . A = yE . E ) by FUNCT_1:def 3;
reconsider A = A as Ordinal by A5;
take rA = r . A; :: thesis: S1[e,rA]
thus S1[e,rA] by A4, A5, FUNCT_1:def 4; :: thesis: verum
end;
end;
end;
consider f being Function such that
A6: dom f = dom yE and
A7: for e being object st e in dom yE holds
S1[e,f . e] from CLASSES1:sch 1(A1);
rng f c= REAL
proof
let b be object ; :: according to TARSKI:def 3 :: thesis: ( not b in rng f or b in REAL )
assume b in rng f ; :: thesis: b in REAL
then consider a being object such that
A8: ( a in dom f & f . a = b ) by FUNCT_1:def 3;
f . a is real by A6, A7, A8;
hence b in REAL by A8, XREAL_0:def 1; :: thesis: verum
end;
then reconsider f = f as Sequence of REAL by A6, ORDINAL1:def 7, RELAT_1:def 19;
take f ; :: thesis: ( dom f = dom yE & ( for A, B being Ordinal st A in dom y & B in dom yE & y . A = yE . B holds
r . A = f . B ) & ( for A being Ordinal st A in dom yE & not yE . A in rng y holds
f . A = 0 ) )

thus ( dom f = dom yE & ( for A, B being Ordinal st A in dom y & B in dom yE & y . A = yE . B holds
r . A = f . B ) & ( for A being Ordinal st A in dom yE & not yE . A in rng y holds
f . A = 0 ) ) by A6, A7; :: thesis: verum