Show that the subset of terminating sequences is countable (e.g. for ).

So suppose is a countable subset of . Then where ( ) are terminating sequences. Is it possible to just say that is is impossible to construct a sequence such that . Thus not every subset of is proper. Hence is countable.

Or is the only way to do it is to say that is equivalent to ?