I have a question about pumping lemma from introduction to the theory of computation. In pumping lemma we have to satisfy all 3 conditions to prove that a language is not regular. 1) x y^i z A for every i>=0 2) |y| >0 3) |xy| <= p My question is, is it okay if we are unable to satisfy 1) and 2) conditions both rather then just 1) conditions ?