Integer Divisor Results/Integer Divides Itself/Proof 1

Theorem
Let $n \in \Z$, i.e. let $n$ be an integer.

Then:
 * $n \mathop \backslash n$

That is, $n$ divides itself.

Proof
From Integer Multiplication Identity is One:
 * $\forall n \in \Z: 1 \cdot n = n = n \cdot 1$

thus demonstrating that $n$ is a divisor of itself.