De Morgan's Laws (Logic)/Conjunction/Formulation 1/Proof

Theorem

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

Proof
We apply the Method of Truth Tables.

As can be seen by inspection, the truth values under the main connectives match for all boolean interpretations.

$\begin{array}{|ccc||cccccc|} \hline p & \land & q & \neg & (\neg & p & \lor & \neg & q) \\ \hline F & F & F & F & T & F & T & T & F \\ F & F & T & F & T & F & T & F & T \\ T & F & F & F & F & T & T & T & F \\ T & T & T & T & F & T & F & F & T \\ \hline \end{array}$