This is my first time posting here so apologies if I miss out any etiquette!
I'm working my way through certain sections of Basic Mathematics by Serge Lang as a preparation for a Stats course that I'm taking later in the year. My working level at the moment is pretty primitive, having been away from the world of maths for many years. I'm looking at the section on divisibility of integers and have come across a problem that I can't grasp the proof to.
The problem is as follows:
Let $a,b$ be integers.
Prove that if $a \equiv b \pmod{5} $ and $x \equiv y \pmod{5}$, then $ax \equiv by \pmod{5}$
The proof to the first section is clear enough, but I just can't understand the proof to the second section - there must be some implicit assumptions that I'm not following. The proof is as follows:
There exist integers $k,q$ such that $a = b+5k$ and $x = y+5q$. Then \begin{align} ax &= (b+5k)(y+5q) \\ &= by+5(ky+bq+5kq) \end{align}.
Then setting $t = ky+bq+5kq$ gives $ax=by+5t$, i.e. $ax \equiv by \pmod{5}$
I can't see how that leads to a proof. If anyone could unpack this for me I would be most grateful!
Many thanks.