The following logical equivalence shows us that every WFF that uses $\u27f9$ can be written with $\mathrm{\neg}$ and $\vee $ instead.

Let $\varphi $ and $\psi $ be WFFs. Then

$$(\varphi \u27f9\psi )\equiv (\mathrm{\neg}\varphi \vee \psi ).$$ |

Here is the truth table that proves this result:

$\varphi $ | $\psi $ | $(\varphi \u27f9\psi )$ | $(\mathrm{\neg}\varphi \vee \psi )$ |
---|---|---|---|

T | T | T | T |

T | F | F | F |

F | T | T | T |

F | F | T | T |

This equivalence is commonly used when proving a statement like “$a$ implies $b$.” Proofs of statements in this form are often carried out by assuming that $a$ is true and then deducing that $b$ is also true. Why is that sufficient to prove $(a\u27f9b)$?

Suppose that if $a$ is true, so is $b$. If $a$ is false then $\mathrm{\neg}a$
is true, so $(\mathrm{\neg}a\vee b)$ is true *no matter what the statements
$a$ and $b$ were*. On the other hand if $a$ is true we know $b$ is true
as well, so $(\mathrm{\neg}a\vee b)$ is true in that case too. So regardless of
the truth value of $a$, the formula $(\mathrm{\neg}a\vee b)$ is true. Because
this is logically equivalent to $(a\u27f9b)$, we’re done.

The contrapositive of an implication $(a\u27f9b)$ is by definition $(\mathrm{\neg}b\u27f9\mathrm{\neg}a)$. For example, the contrapositive of “if it’s Monday, then it’s raining” is “if it’s not raining, then it’s not Monday.” We are going to use the logical equivalence of the previous section to show that an implication is logically equivalent to its contrapositive.

Let $\varphi $ and $\psi $ be WFFs. Then

$$(\varphi \u27f9\psi )\equiv (\mathrm{\neg}\psi \u27f9\mathrm{\neg}\varphi ).$$ |

You can check the truth tables for these two statements, or you can do this:

$(\varphi \u27f9\psi )$ | $\equiv (\mathrm{\neg}\varphi \vee \psi )$ | Theorem 1.7.1 | ||

$\equiv (\mathrm{\neg}\varphi \vee \mathrm{\neg}\mathrm{\neg}\psi )$ | Theorem 1.6.2 | |||

$\equiv (\mathrm{\neg}\mathrm{\neg}\psi \vee \mathrm{\neg}\varphi )$ | Theorem 1.5.1 | |||

$\equiv (\mathrm{\neg}\psi \u27f9\mathrm{\neg}\varphi )$ | Theorem 1.7.1 |

∎

Again this is very useful as a proof technique. If you want to prove $(a\u27f9b)$, it is logically equivalent to prove the contrapositive $(\mathrm{\neg}b\u27f9\mathrm{\neg}a)$, and this is sometimes easier. An example is

${x}^{2}$ is an irrational number implies $x$ is an irrational number.

This statement is true, but the contrapositive “$x$ is rational implies ${x}^{2}$ is rational” is easier to prove because $x$ being rational actually tells you something specific (that $x=p/q$ for some whole numbers $p$ and $q$) which you can use to make the proof work. There are further examples given in this blog post by Timothy Gowers.

Don’t confuse the contrapositive of an implies statement with its converse. The converse of $(\varphi \u27f9\psi )$ is defined to be $(\psi \u27f9\varphi )$, and these two are not in general logically equivalent. (You should think of a truth assignment to show that $(p\u27f9q)$ and $(q\u27f9p)$ are not logically equivalent.)