I'm starting to do mathematical proofs by myself, and I have found this:
$\quad\forall x,y \in \mathbb{Z}\quad$ if $\quad a \cdot x = b \cdot y \quad$ then $\quad a = b = 0$
Proof:
Lets prove it by contradiction:
If $\quad a\neq b \Rightarrow a \cdot x = b \cdot y \Rightarrow \dfrac{a}{b}=\dfrac{y}{x} \neq 1 \quad$ but if $\quad x=y\neq 0 \Leftrightarrow \dfrac{y}{x}=1$
If $\quad a\neq 0 \Rightarrow a \cdot x = b \cdot y \Rightarrow \dfrac{a}{b}=\dfrac{y}{x} \neq 0 \quad$ but if $\quad y=0, x\neq 0 \Leftrightarrow \dfrac{y}{x}=0$
Therefore: $\quad\forall x,y \in \mathbb{Z}\quad$ if $\quad a \cdot x = b \cdot y \quad$ then $\quad a = b = 0$
Question
Is the assumption and its proof well stated? In the assumption I want to say that you can take any $x$ or $y$ in $\mathbb{Z}$ but I feel like writing $\quad\forall x,y \in \mathbb{Z}\quad$ doesn't clarify this.