How to prove that iff a set is recursive enumerable, it can be expressed as a function of a partial computable function

Question

A set S is recursive enumerable if and only if S = F(f) for f partial computable function. How can I prove this? F(f) = the set {y | exists(x) s.t. f(x) = y}. I think it can