Reduced Residue System is Subset of Set of All Residue Classes

Theorem
Let $\Z_m$ be the set of set of all residue classes modulo $m$.

Let $\Z'_m$ be the reduced residue system modulo $m$.

Then:
 * $\forall m \in \Z_{> 1}: \varnothing \subset \Z'_m \subset \Z_m$

Proof
By definition of reduced residue system modulo $m$:
 * $\Z'_m = \left\{{x \in \Z_m: x \perp m}\right\}$

From Subset of Set with Propositional Function:
 * $\Z'_m \subseteq \Z_m$

We have that:
 * $\gcd \left\{{m, 0}\right\} = m$

Thus it follows that:
 * $m > 1 \implies \gcd \left\{{m, 0}\right\} \ne 1$

So:
 * $\left[\!\left[{0}\right]\!\right]_m \notin \Z'_m$

However:
 * $\left[\!\left[{0}\right]\!\right]_m \in \Z_m$

so:
 * $\Z'_m \ne \Z_m$

Thus:
 * $\Z'_m \subset \Z_m$

Then:
 * $\left[\!\left[{1}\right]\!\right]_m = 1 \implies 1 \perp m$

So:
 * $\forall m \in \Z: \left[\!\left[{1}\right]\!\right]_m \in \Z'_m$

Thus:
 * $\Z'_m \ne \varnothing$

and therefore:
 * $\varnothing \subset \Z'_m$