In order to reliably use the Pumping Lemma, one must define it in predicate logic. Below, we define the Pumping Lemma in this fashion where one can clearly see where the Pumping condition Cond lies. Re g(L) ? ?N ? Nat : ?w ? L : [ |w| = N ? ?x, y, z ? S * : w = x yz ? |x y| = N ? y 6= e ? ?i = 0 : x yi z ? L ]. State the negated condition in predicate logic, and then relate it to the recipe stated in English on Page 52 (the bulleted list under Showing that L01 is not regular).