Cancellability of Congruences

Theorem
Let $$c a \equiv c b \pmod n$$.

Then $$a \equiv b \pmod {\frac n d}$$ where $$d = \gcd \left\{{c, n}\right\}$$.

Corollary
If $$c \perp n$$, then $$c a \equiv c b \pmod n \Longrightarrow a \equiv b \pmod n$$.

Proof
From $$c a \equiv c b \pmod n$$, we have that $$c a - c b = k n$$ for some $$k \in \Z$$ by Congruent iff Difference Multiple of Modulus.

Now $$d = \gcd \left\{{c, n}\right\}$$, so from Divide by GCD for Coprime Integers we have:
 * $$\exists r, s \in Z: r \perp s: c = dr, n = ds$$.

So we substitute for $$c$$ and $$n$$ in $$c a - c b = k n$$:
 * $$d r a - d r b = k d s$$

which leads us to:
 * $$r \left({a - b}\right) = k s$$

So $$s \backslash r \left({a - b}\right)$$ and as $$r \perp s$$, from Euclid's Lemma $$s \backslash \left({a - b}\right)$$.

So $$a \equiv b \pmod s$$ where $$s = \frac n d$$.

Proof of Corollary
Follows directly from the fact that $$c \perp n$$ means $$\gcd \left\{{c, n}\right\} = 1$$.