When we do a proof by contradiction using the pumping lemma for CFL, as long as we can reach a contradiction (i.e., the resulting string is NOT in the language assumed to be context-free) for just one way to divide the string W = uvxyz, then we are done.