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