Request the needed missing step proof below.
Given $a, b\in \mathbb{N}, p\mid ab$, given a prime number $p$, then at least one of $a, b$ is divisible by $p$.
Proof: By hypothesis, $ab = cp$. Wlog, $p\not \mid a$. Then $(a, p)=1$. Hence, by Bezout lemma, there exist $x, y$, which satisfy $ax + py = 1$. Multiplying this equation by $b$, have $bax + bpy = b$.
Since $ab = cp$, this gives $cpx + bpy = b$, or $(cx + by)p = b$. Since $cx + by$ is an integer, but cannot still show the needed step that $(cx+by) \not \mid b$ to show $p\mid b$.