If there is a w’ such that w’ ∉ L in the final step of pumping lemma, then L is not regular (Lemma fails)
Can we conversely say for certain if L is not regular, then definitely there is a w’ ∉ L.
Simply : Can there be a case where we have all w’ ∈ L and still language is not regular?
