Page "Proofs of Fermat's little theorem" Paragraph 141

We can prove the cancellation law easily using Euclid's lemma, which generally states that if an integer b divides a product rs ( where r and s are integers ), and b is relatively prime to r, then b must divide s. Indeed, the equation