3 ms·
Many proofs by contradiction are simply results of wrapping a constructive proof: Suppose premises/axioms (B, C, ...) which don't depend on the value of A. The
by EGreg 12y ago
Many proofs by contradiction are simply results of wrapping a constructive proof:
Suppose premises/axioms (B, C, ...) which don't depend on the value of A. Then, B=true AND C=true ... implies A=true by some logical argument, such as
A Or Not (B And C And ...) = True
In this case, the proof by contradiction is
Assume A=False
But B=True, C=True, ... (Since they dont depend on A)
Apply above constructive argument
So A is true, A CONTRADICTION
Proofs by contradiction can often be of this type so the first and last lines can be removed.
The question is, what other types can there be?