# Cardinality of formal languages

Given the theorem:

Let $$\Sigma$$ be an alphabet. The set $$\mathcal{P} \left( \Sigma^{\star} \right)$$ is uncountable. In other words, there are uncountably infinite languages over any alphabet.

Can someone explain to me how does it hold for $$| \Sigma | = 1$$ ?