Suppose we have the set of integers $\mathbb{Z}$ and a congruence class of $x$ modulo $n$, denoted as $[x]_n$ and defined as $\{\ldots,x-2n,x-n,x,x+n,x+2n,\ldots\}$ where $n$ is an integer and $x$ is some real.
The size of both $\mathbb{Z}$ and $[x]_n$ is infinite, but a countably one. If $n>1$ clearly $\mathbb{Z}$ contains more elements than $[x]_n$. More precisely, for each element in $[x]_n$ there are $n$ elements in $\mathbb{Z}$.
Would it be valid to say that $\dfrac{|\mathbb{Z}|}{|[x]_n|}=n$? If $[x]_n\subseteq \mathbb{Z}$ we could say $[x]_n\subset \mathbb{Z}$ because $n>1$. This could be a valid test to test if some set is a proper subset of another one, right?