NAND with Equal Arguments/Proof 1

Theorem
Let $\uparrow$ signify the NAND operation.

Then, for any proposition $p$:


 * $p \uparrow p \dashv \vdash \neg p$

That is, the NAND of a proposition with itself corresponds to the negation operation.