Euclid lemma in a greatest-common-divisor domain

If $\gcd (a,b)=1$ and $a\mid bc$ in a greatest-common-divisor domain, then $a\mid c$. Indeed, the least common multiple of $a$ and $b$ is associate to $ab$ and divides every common multiple; applying this to $bc$ and cancelling $b$ proves the claim.