Unable to understand an inequality in an application of the pumping lemma for context-free languages
The Pumping Lemma requires $|vxy| \le m$ so that the pumped parts are of bounded length. Thus $k_1+k_2\le m$. With this it is easy.

As $k_2 \neq 0$, we must have $k_1&lt;m$. Also $m&gt;0$ as the pumping constant must be positive (but in fact we can assume it to be as large as we want, of course).

Now $2m-1 \ge m &gt; k_1$.

That's all.