Disjunction elimination
Type | Rule of inference |
---|---|
Field | Propositional calculus |
Statement | If a statement [math]\displaystyle{ P }[/math] implies a statement [math]\displaystyle{ Q }[/math] and a statement [math]\displaystyle{ R }[/math] also implies [math]\displaystyle{ Q }[/math], then if either [math]\displaystyle{ P }[/math] or [math]\displaystyle{ R }[/math] is true, then [math]\displaystyle{ Q }[/math] has to be true. |
Transformation rules |
---|
Propositional calculus |
Rules of inference |
Rules of replacement |
Predicate logic |
In propositional logic, disjunction elimination[1][2] (sometimes named proof by cases, case analysis, or or elimination) is the valid argument form and rule of inference that allows one to eliminate a disjunctive statement from a logical proof. It is the inference that if a statement [math]\displaystyle{ P }[/math] implies a statement [math]\displaystyle{ Q }[/math] and a statement [math]\displaystyle{ R }[/math] also implies [math]\displaystyle{ Q }[/math], then if either [math]\displaystyle{ P }[/math] or [math]\displaystyle{ R }[/math] is true, then [math]\displaystyle{ Q }[/math] has to be true. The reasoning is simple: since at least one of the statements P and R is true, and since either of them would be sufficient to entail Q, Q is certainly true.
An example in English:
- If I'm inside, I have my wallet on me.
- If I'm outside, I have my wallet on me.
- It is true that either I'm inside or I'm outside.
- Therefore, I have my wallet on me.
It is the rule can be stated as:
- [math]\displaystyle{ \frac{P \to Q, R \to Q, P \lor R}{\therefore Q} }[/math]
where the rule is that whenever instances of "[math]\displaystyle{ P \to Q }[/math]", and "[math]\displaystyle{ R \to Q }[/math]" and "[math]\displaystyle{ P \lor R }[/math]" appear on lines of a proof, "[math]\displaystyle{ Q }[/math]" can be placed on a subsequent line.
Formal notation
The disjunction elimination rule may be written in sequent notation:
- [math]\displaystyle{ (P \to Q), (R \to Q), (P \lor R) \vdash Q }[/math]
where [math]\displaystyle{ \vdash }[/math] is a metalogical symbol meaning that [math]\displaystyle{ Q }[/math] is a syntactic consequence of [math]\displaystyle{ P \to Q }[/math], and [math]\displaystyle{ R \to Q }[/math] and [math]\displaystyle{ P \lor R }[/math] in some logical system;
and expressed as a truth-functional tautology or theorem of propositional logic:
- [math]\displaystyle{ (((P \to Q) \land (R \to Q)) \land (P \lor R)) \to Q }[/math]
where [math]\displaystyle{ P }[/math], [math]\displaystyle{ Q }[/math], and [math]\displaystyle{ R }[/math] are propositions expressed in some formal system.
See also
- Disjunction
- Argument in the alternative
- Disjunct normal form
References
Original source: https://en.wikipedia.org/wiki/Disjunction elimination.
Read more |