Divisor Count Function of Prime Number

Theorem
Let $p \in \Z_{> 0}$.

Then $p$ is a prime number :
 * $\map \tau p = 2$

where $\map \tau p$ denotes the divisor counting function of $p$.

Necessary Condition
Let $p$ be a prime number.

Then, by definition, the only positive divisors of $p$ are $1$ and $p$.

Hence by definition of the divisor counting function:
 * $\map \tau p = 2$

Sufficient Condition
Suppose $\map \tau p = 2$.

Then by One Divides all Integers we have:
 * $1 \divides p$

Also, by Integer Divides Itself we have:
 * $p \divides p$

So if $p > 1$ it follows that $\map \tau p \ge 2$.

Now for $\map \tau p = 2$ it must follow that the only divisors of $p$ are $1$ and $p$.

That is, that $p$ is a prime number.