Rule of Simplification/Sequent Form/Formulation 1/Form 2/Proof by Truth Table
< Rule of Simplification | Sequent Form | Formulation 1 | Form 2
Jump to navigation
Jump to search
Theorem
\(\ds p \land q\) | \(\) | \(\ds \) | ||||||||||||
\(\ds \vdash \ \ \) | \(\ds q\) | \(\) | \(\ds \) |
Proof
We apply the Method of Truth Tables.
$\begin{array}{|ccc||c|} \hline p & \land & q & q \\ \hline \F & \F & \F & \F \\ \F & \F & \T & \T \\ \T & \F & \F & \F \\ \T & \T & \T & \T \\ \hline \end{array}$
As can be seen, when $p \land q$ is true so is $q$.
$\blacksquare$