How can I prove that the set of all functions from $(0,1) \to \mathbb N$ is countable or uncountable?
Here the domain is all real numbers between 0 and 1 while the range is set of natural numbers.
Edited :- This answer came to mind. Is it correct?
For every element of domain their is $\mathbb N$ number of functions. So the set of functions for one element of domain is countable. By this logic we can say total number of functions is $ \mathbb N * \mathbb N *\mathbb N \ldots$.
And we all know that countable collection of countable sets is countable and uncountable collection of countable sets is uncountable. We all know that to get collection we need to use sum + operator. My intuition(only for this particular case) is If for sum operator it is uncountable then also for the multiplication operator it should be uncountable.
By this can we say that set of all functions from $(0,1) \to \mathbb N$ is uncountable.
But I doubt about the correctness of this logic "uncountable collection of countable sets is uncountable" but intuitively this logic seems correct.