I'm fairly lost on where to begin this proof and would like direction to resources that might help me understand what I'm meant to show.
The proof is:
Prove that If $m|n$, then $\pi_{m,n}: \mathbb{Z}_n \to \mathbb{Z}_m$ is well-defined.
I know that $m|n$ means that $n=m*k$ where $k \in \mathbb{Z}$.
I know that if $m|n$, then $\pi_{m,n} ([a]_n)=[a]_m$
And I know that for a function $f:X \to Y$ to be well-defined I must prove that:
1.) f is a relation from X to Y f⊆X×Y
2.) The domain of f is X, every element in X is related to some element of Y ∀x∈X,∃y∈Y:(x,y)∈f
3.) No element of X is related to more than one element of Y ∀x∈X,∀y1,y2∈Y:(x,y1),(x,y2)∈f⟹y1=y2
I'm not sure how these facts/properties relate to the requested proof and any help that can be offered would be greatly appreciated. I think the Chinese Remainder Theorem may be involved, but that may just be a stab in the dark on my part.
Write $a+n\mathbb{Z}$ for the element of $\mathbb{Z}_n$ corresponding to the equivalence class of integers modulo $n$ which contains $a$. The function $\pi_{n,m}$ in question is defined by $$\pi_{n,m}(a+n\mathbb{Z})=a+m\mathbb{Z}\qquad \mbox{ for all } a\in\mathbb{Z}.$$ Recall that a function associates each member of the domain to precisely one member of the codomain. Therefore, we say that $\pi_{n,m}$ is well-defined if $\pi_{n,m}(a+n\mathbb{Z})=\pi_{n,m}(b+n\mathbb{Z})$ whenever $a,b\in\mathbb{Z}$ satisfy $a+n\mathbb{Z}=b+n\mathbb{Z}$.
In other words, the question is asking you to show that if $m\mid n$ and $a\equiv b\mod n$, then $a\equiv b\mod m$.