Proving an Implication:
- Method #1:
In order to prove that P IMPLIES Q:
- Write, “Assume P .”
- Show that Q logically follows.
- Method #2:
Prove the Contropositive:
NOT(Q) IMPLIES NOT(P)
Proving an “If and Only If”:
- Method #1:
Prove Each Statement Implies the Other. - Method #2:
Construct a Chain of iffs.
Proof by Cases:
Proof by cases might be used when a complicated proof could be broken into cases, where each case is simpler to prove and the cases together cover all possibilities.
Proof by Contradiction:
In a proof by contradiction, or indirect proof, you show that if a proposition were false, then some false fact would be true. Since a false fact by definition can’t be true, the proposition must be true.
Reference
[1] Lehman E, Leighton F H, Meyer A R. Mathematics for Computer Science[J]. 2015.