validation of a pumping lemma proof for regular languages
the union of 2 non-regular languages can be regular.
The trivial example is any non-regular language L and its complement. The union of those two is the set of all strings, which is a regular language.
There for the conclusion $L1, L2 \notin Regular \implies L1\cup L2 \notin Regular$ does not follow.