Is there a human-friendly version of the Pumping-Lemma?
I agree that the way the lemma is written is confusing, a more friendly way to write the lemma is as follows (I have added an intuitive explanation for the conditions appearing in the lemma, hoping that it is more human readable now):
The Pumping Lemma: for every regular language $L\subseteq \Sigma^*$, there is a positive pumping constant $p$ such that for every word $w\in L$ with $|w|\geq p$ (that is, for every long enough word in the language $L$ ), the following holds. There exists a partition of $w$ into three words over $\Sigma$, $w = xyz$,  such that:

$|xy|\leq p$ (that is, $y$ lies in the prefix of length $p$ of $w$).

$|y| &gt; 0$ (that is, $y$ is nonempty).

$xy^iz\in L$, for every $i\geq 0$ (that is, if you take the word $w$ and pump the infix $y$ in $w$, $i$ times, the word $w$ remains in the language $L$).