Functionally Complete Logical Connectives/NOR

Theorem
The singleton set containing the following logical connective:
 * $\left\{{\uparrow}\right\}$: NAND

is functionally complete.

Proof
From Functionally Complete Logical Connectives: Negation and Disjunction, any boolean expression can be expressed in terms of $\lor$ and $\neg$.

From NOR with Equal Arguments:
 * $\neg p \dashv \vdash p \downarrow p$

Then:

Thus $p \lor q$ is expressed solely in terms of $\downarrow$.

Thus any boolean expression can be represented solely in terms of $\downarrow$.

That is, $\left\{{\downarrow}\right\}$ is functionally complete.