Math 2.0

Concept

Disjunction elimination

Summary

In propositional logic, disjunction elimination (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 PP implies a statement QQ and a statement RR also implies QQ, then if either PP or RR is true, then QQ 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.

Further reading

  1. Wikipedia, page 8529, revision 1312422497, Disjunction elimination. adopted
About this page
TagFTH70E7K1D
URIm2://FTH70E7K1D
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.