Pumping Lemma on CFL for L = {a^nb^nc^n } where n is greater than or equal to zero is not CFL

This video shows that the concept of pumping lemma for CFL and using the three important condition it shows that the language is not context free language.The given language is separated into 5 parts ie. z=uvwxy and based on pumping lemma on CFL condition it is proved that the language is not a CFL