Answer
See step by step work for proof.
Work Step by Step
Two propositions are logically equivalent if they have the same truth value for any combination of truth values of the variables.
A conjunction $ p \land q$ is true, if both statements p and q are true.
A negation $\neg p$ is true if p is false.
p NAND q ( denoted as $p|q$ )is true if and only if p or q or both p and q are false.
$\underline{\quad p \quad q \quad p\land q \quad p|q \quad \neg (p \land q)}$
$\quad T \quad T \quad T \quad \quad F \quad\quad\quad F$
$\quad T \quad F \quad F \quad \quad T \quad\quad\quad T$
$\quad F \quad T \quad F \quad \quad T \quad\quad\quad T$
$\quad F \quad F \quad F \quad \quad T \quad\quad\quad T$
Since the last two columns of the truth table contain the same truth value in every row, the last two expressions are logically equivalent.
Hence, $ p|q \equiv \neg( p\land q)$
