set f = n |-> a;
for x being Real st x in rng (n |-> a) holds
x > 0
proof
let x be Real; :: thesis: ( x in rng (n |-> a) implies x > 0 )
assume A1: x in rng (n |-> a) ; :: thesis: x > 0
rng (n |-> a) c= {a} by FUNCOP_1:13;
hence x > 0 by A1, TARSKI:def 1; :: thesis: verum
end;
hence n |-> a is positive-yielding by PARTFUN3:def 1; :: thesis: verum