Given $\gcd(a,b) = d$, I want to prove that all integer solutions for the equation $ax + by = dm$ for some integer $m$ are of the form $x = mx_0 + \frac{b}{d}k$ and $y = my_0 - \frac{a}{d}k$. Here's what I have so far, but I am not sure how to finish it. Thanks in advance!
$ax + by = dm = (ax_0 + by_0)m = ax_0m + by_0m = a(x_0m) + b(y_0m)$
$ax + by = a(x_0m) + b(y_0m) \implies ax - a(x_0m) = b(y_0m) - by \implies a(x - x_0m) = b(y_0m -y)$
Since $gcd(a,b) = d$, $d$ divides $a$ and $b$. Thus, $\frac{a}{d}(x - x_0m) = \frac{b}{d}(y_0m - y)$
Well adding multiples of $b/d$ and $-a/d$ to any solutions $x$ and $y$ respectively will always result in another solution, because $a(x+kb/d)+b(y-ka/d)=dm$. So it seems you had forgotten a minus sign.
Note that $a/d$ and $b/d$ are coprime. Thus we can get the converse, that this exhausts all solutions, by noting that given two solutions $(x_1,y_1)$ and $(x_2,y_2)$, we have $a/d(x_1-x_2)=b/d(y_2-y_1) \stackrel{\text{Euclid's lemma}}{\implies} x_1-x_2=kb/d $. Similarly $y_2=y_1+ka/d$.