Modulo Addition has Inverses

Theorem
Let $m \in \Z$ be an integer.

Then addition modulo $m$ has inverses:

For each element $\left[\!\left[{x}\right]\!\right]_m \in \Z_m$, there exists the element $\left[\!\left[{-x}\right]\!\right]_m \in \Z_m$ with the property:


 * $\left[\!\left[{x}\right]\!\right]_m +_m \left[\!\left[{-x}\right]\!\right]_m = \left[\!\left[{0}\right]\!\right]_m = \left[\!\left[{-x}\right]\!\right]_m +_m \left[\!\left[{x}\right]\!\right]_m$

where $\Z_m$ is the set of integers modulo $m$.

That is:
 * $\forall a \in \Z: a + \left({-a}\right) \equiv 0 \equiv \left({-a}\right) + a \pmod m$

Proof
As $-x$ is a perfectly good integer, $\left[\!\left[{-x}\right]\!\right]_m \in \Z_m$, whatever it may be.