Is the union of infinitely many regular languages always regular? Prove or disprove or this statement:


The union of an infinite number of regular languages is regular.

Can someone help?
Every language is a union of infinitely many regular languages:
$$
L = \bigcup_{w \in L} \{w\}.
$$