Welcome guest
You're not logged in.
314 users online, thereof 0 logged in

Lemma: The Proving Principle by Contradiction

Let \(p\) be a proposition and \(\neg p\) its negation. By showing that:
\[\neg p \Rightarrow 0\]
it follows that
\[p = 1.\]

This proving method is called by contradiction or reductio ad absurdum.

Formally, reductio ad absordum is the following logical argument: $$\begin{array}{rll}
\neg p\Rightarrow 0&\text{premise}&\text{e.g. It is false that the sun is not shining.}\\
p&\text{conclusion}&\text{e.g. Therefore, the sun is shining.}\\

| | | | | created: 2014-06-22 09:22:17 | modified: 2020-06-24 06:16:08 | by: bookofproofs | references: [593]

1.Proof: (related to "The Proving Principle by Contradiction")

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 4.0 by:

This work is a derivative of:

Bibliography (further reading)

[593] Cryan D., Shatil S., Mayblin B.: “Logic. A Graphic Guide”, Icon Books Ltd., London, 2001