S is a set of functions, not languages, so saying that S=RE is a bit meaningless.
However, you are right that as opposed to the requirements of Rice's theorem, here we allow S to be all the computable functions. This, however, shouldn't change much.