The problem says: Let $D$ an UFD and $a,b,x,y \in D$ all distinct than 0. If $gcd(x,y)$ = 1 and $xa = yb$ then $xa = lcm(a,b)$.
I have tried to use a previous result that I proved saying:
If $D$ is a UFD and $a,b,d \in D, ab \ne 0$ such $gcd(d,a) = 1$ then $d|ab \implies d|b$
But I haven't reach anything non-trivial.
I don't remember if this formula is valid in all UFD's: $ab=\gcd(a, b) \mathrm{lcm}(a,b)$, but if that's the case, then: $ax\gcd(a, b) = a \gcd(xa, xb) = a \gcd(yb, xb) = a b \gcd(x, y) = ab = \gcd(a, b) \mathrm{lcm}(a,b)$ from where you get your result canceling out the gcd.