It is said that "All finite languages are regular".
But the Pumping Lemma says that,
if a language is regular one can find a 'large-enough' word w such that it can be decomposed into w = xyz such that FOR ALL i >= 0 the word with a pumped up y^i is also in the language.
But doesn't that state that "every regular language is infinite" since one can always infinitely (i in N) pump the word up and it will be still in the language?
So why are the finite languages regular and how are they fulfill the pumping lemma?