Rule of Simplification/Sequent Form/Formulation 1/Form 1/Proof 1
< Rule of Simplification | Sequent Form | Formulation 1 | Form 1
Jump to navigation
Jump to search
Theorem
| \(\ds p \land q\) | \(\) | \(\ds \) | ||||||||||||
| \(\ds \vdash \ \ \) | \(\ds p\) | \(\) | \(\ds \) |
Proof
By the tableau method of natural deduction:
| Line | Pool | Formula | Rule | Depends upon | Notes | |
|---|---|---|---|---|---|---|
| 1 | 1 | $p \land q$ | Premise | (None) | ||
| 2 | 1 | $p$ | Rule of Simplification: $\land \EE_1$ | 1 |
$\blacksquare$
Sources
- 1965: E.J. Lemmon: Beginning Logic ... (previous) ... (next): Chapter $1$: The Propositional Calculus $1$: $3$ Conjunction and Disjunction: Theorem $14$