to the set of natural numbers codifying programs such
that the domain and the image of the function computed by the program have
infinite cardinal and are disjoint (roughly, the set of programs implementing
functions whose domain and image are infinite and disjoint) in order to prove
that such set is not semi-decidable (not recursively enumerable).