Is the set of all strings of finite length $\Sigma^*$ from a infinite alphabet $\Sigma$ uncountable?
The usual procedure in these types of proof is that you
list strings of length 1 list strings of length 2 list strings of length 3 ....... ....... ....... and so on
But now even the first line has infinite length so the construction can never stop. What is wrong?