How do I solve the next exercise using inference laws, This Rule is also called, "Constructive Dilema"
\begin{align} p & \rightarrow q \\ -p & \rightarrow -q \\ p & \lor -p \\ \hline \\ q & \lor -q \end{align}
How do I solve the next exercise using inference laws, This Rule is also called, "Constructive Dilema"
\begin{align} p & \rightarrow q \\ -p & \rightarrow -q \\ p & \lor -p \\ \hline \\ q & \lor -q \end{align}
Here is a proof that just uses the first two premises:
$p \rightarrow q$ Premise
$\neg p \rightarrow \neg q$ Premise
$\neg p \lor q$ Conditional 1
$q \lor \neg p$ Commutative 3
$\neg \neg q \lor \neg p$ Double Negative 4
$\neg q \rightarrow \neg p$ Conditional 5
$\neg q \rightarrow \neg q$ Transitivity 2,6
$\neg \neg q \lor \neg q$ Conditional 7
$q \lor \neg q$ Double Negative 8
And here is a (much simpler!) proof that uses just the third premise:
$p \lor \neg p$ Premise
$\top$ Negation 1
$q \lor \neg q$ Negation 2