Conjunction in terms of NAND

Theorem

 * $p \land q \dashv \vdash \left({p \uparrow q}\right) \uparrow \left({p \uparrow q}\right)$

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