For any set S which is non-empty, there is an element x of that set.
For any set S and any x, the set S * {x} is a function which sends every element of S to x.
Therefore, for every non-empty set S, there is a function with domain S, and range a single element of S.
Did you mean a set S of sets such that there is no f : (A in S) -> A ?
Therefore, for every non-empty set S, there is a function with domain S, and range a single element of S.
Did you mean a set S of sets such that there is no f : (A in S) -> A ?