Proof that a language is not regular using the pumping lemma

Elements of the theory of computation. Example 2.4.2

I do not understand the last sentence of the proof provided. It says that the fact that xz does not belong to L contradicts the hypothesis, but isn’t it that xyz not belonging to L what we are trying to prove?