Completely Multiplicative Function is Multiplicative

Theorem
Let $f: \Z \to \Z$ be a function on the integers $\Z$.

Let $f$ be completely multiplicative.

Then $f$ is multiplicative.

Proof
By definition of complete multiplicativity:


 * $\forall m,n \in \Z: f(mn) = f(m) f(n)$

Hence by True Statement is implied by Every Statement:


 * $\forall m,n \in \Z: m \perp n \implies f(mn) = f(m) f(n)$

So $f$ is multiplicative.