I already proved the following using proof by induction: For all $a,b,c\in\mathbb{N}$ we have: \begin{align*} a+c=b+c \Rightarrow a=b \end{align*} and \begin{align*} a\cdot c = b\cdot c \Rightarrow a=b . \end{align*}
Now I want to show that for all $a,b,c\in\mathbb{N}$ have that \begin{align*} a=b\Rightarrow a+c=b+c \end{align*} and \begin{align*} a=b\Rightarrow a\cdot c= b\cdot c, \end{align*} but cannot come up with a proper way to do so. Anyone got an idea?
Also got a question about terminology. I know the statements I've already proved are called cancellation law of addition and cancellation law of multiplication, respectively. Is there also a name for the implications $a=b\Rightarrow a*c=b*c$ and the equivalence $a=b\Leftrightarrow a*c=b*c$?