Solution
= Solution
A language $L$ satisfies the context-free pumping lemma if there is an integer $p\geq1$ such that every $z\in L$ with $|z|\geq p$ has a decomposition
$$
z=uvwxy
$$
with
$$
|vwx|\leq p,\qquad |vx|\geq1,
$$
and
$$
uv^iwx^iy\in L\quad\hbox{for every }i\geq0.
$$
Every context-free language has this property, although the property by itself is not sufficient for context-freeness.