Disjunction elimination

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In propositional logic disjunction elimination[1][2], or proof by cases[3], is the inference that, if "A or B" is true, and A entails C, and B entails C, then we may justifiably infer C. The reasoning is simple: since at least one of the statements A and B is true, and since either of them would be sufficient to entail C, C is certainly true.

For example:

It is true that either I'm inside or I'm outside. It is also true that if I'm inside, I have my wallet on me. It's also true that if I'm outside, I have my wallet on me. Given these three premises, it follows that I have my wallet on me.

Formally:

A\or B
A \to C
B \to C
\therefore C

[edit] Proof

Proposition Derivation
A\or B Given
A\rightarrow C Given
B\rightarrow C Given
\neg A\rightarrow B Material implication
\neg A\rightarrow C Hypothetical syllogism
(A\rightarrow C)\and(\neg A\rightarrow C) Conjunction
A\or\neg A Law of Excluded Middle
C\or C Constructive dilemma
C\,\! Tautology

[edit] References

[edit] See also

Personal tools
Namespaces

Variants
Actions
Navigation
Interaction
Toolbox
Print/export