The inverse of the conditional \(p \lgccond q\) is \(\lgcnot p \lgccond \lgcnot q\text{.}\) The contrapositive of this new conditional is \(\lgcnot\lgcnot q \lgccond \lgcnot\lgcnot p\text{,}\) which is equivalent to \(q \lgccond p\) by double negation.
Warning2.3.3.Common mistakes.
Mixing up a conditional and its converse.
Assuming that a conditional and its converse are equivalent.
Example2.3.4.Related conditionals are not all equivalent.
Suppose \(m\) is a fixed but unspecified whole number that is greater than \(2\text{.}\)
conditional
If \(m\) is a prime number, then it is an odd number.
contrapositive
If \(m\) is not an odd number, then it is not a prime number.
converse
If \(m\) is an odd number, then it is a prime number.
inverse
If \(m\) is not a prime number, then it is not an odd number.
Only two of these four statements are true!
Suppose \(f(x)\) is a fixed but unspecified function.
conditional
If \(f\) is continuous, then it is differentiable.
contrapositive
If \(f\) is not differentiable, then it is not continuous.
converse
If \(f\) is differentiable, then it is continuous.
inverse
If \(f\) is not continuous, then it is not differentiable.