Let $E$ be an equivalence relation on the set of all ordered pairs of non-negative integers ($N\times N$). It is defined as $$(a,b)E(x,y) \Longleftrightarrow a+y = b+x$$
Multiplication ($*$) is defined as $$(a,b)*(x,y) = (ax+by, ay+bx)$$
Without using substraction or division, how can I show that $E$ is consistent with $*$ ?
By consistent I mean that if $(a,b)E(a', b')$ and $(x,y)E(x',y')$ then $(a,b)*(x,y)E(a',b')*(x',y')$
Right now I have laid down all the information about the problem:
Let $(a,b)$, $(a',b')$, $(x,y)$ and $(x',y')$ $\in N \times N$. Suppose $(a,b)E(a',b')$ and $(x,y)E(x',y')$.
We have: $$(a,b)E(a',b') \Longleftrightarrow a+b'= b+a'$$ $$(x,y)E(x',y') \Longleftrightarrow x+y'= y+x'$$ and I want to show that the following is true $$(a,b)*(x,y)E(a',b')*(x',y')$$ The expansion of the preceding statement gives this: $$ax+by+b'x'+a'y'=^{?} bx+ay+a'x'+b'y'$$
I spent some time thinking about it but I can't find a way to do that. Thanks for the help!