We saw in Example 2.3.7 that the statement ‘‘’’ is equivalent to its contrapositive ‘‘’’. Thus, to deduce from , we may suppose that is false and then deduce from this that is false.
Let be a real number. If , then .
Proof. This follows because the contrapositive statement,
is clearly true, as we see by squaring both sides of the inequality
Let and be real numbers. If , then or .
Proof. In symbols, the statement is
Therefore the contrapositive statement is
which is logically equivalent to
(3.3.1) |
To prove (3.3.1), suppose that and . Then we can write
for some with , and consequently we have
where . Hence the statement on the right-hand side of (3.3.1) is true, as required.
Let be an integer. Then is a multiple of if and only if is a multiple of .
Proof. ‘‘’’. Suppose that is a multiple of , say , where . Then
so that is a multiple of because .
‘‘’’. We seek to prove that
which by contraposition can be rewritten as
To verify this, suppose that is not a multiple of . Then either or for some . In the first case
so is not a multiple of . Similarly, in the second case,
so again is not a multiple of .
As we have seen in Example 3.3.3, when proving a statement of the form ‘‘’’, we may use contraposition to prove one of the two implications; thus, to prove ‘‘’’, we may show that both implications ‘‘’’ and ‘‘’’ hold.