How do I go about proving:
any denumerable set has uncountably many subsets.
I have a proposition saying that for any set A does this help in anyway?
It is just stated as a corollary but it has not been proven.
Thanks for any help
As then no bijection exists between the two and so no bijection exits between and
(as there is a bijection between and A)
so is uncountable