The definition of regular expressions says they are closed under union, concatenation, and Kleene star. Single symbols also form regular expressions/languages.
Since union is between two languages, does that mean that when the alphabet is infinitely countable, the language which is exactly the alphabet is not a regular language?
Thanks.