Contradictory Consequent/Proof by Truth Table

Theorem

 * $p \implies \bot \dashv \vdash \neg p$

Proof
We apply the Method of Truth Tables to the proposition.

As can be seen by inspection, in each case, the truth values in the appropriate columns match for all boolean interpretations.

$\begin{array}{|c|ccc||cc|} \hline p & p & \implies & \bot & \neg & p \\ \hline F & F & T & F & T & F \\ T & T & F & F & F & T \\ \hline \end{array}$