Conjunction in terms of NAND

Theorem

 * $p \land q \dashv \vdash \paren {p \uparrow q} \uparrow \paren {p \uparrow q}$

where $\land$ denotes logical conjunction and $\uparrow$ denotes logical NAND.