0

Let us assume that we have a statement $P \rightarrow Q$. In this case, what would $P \rightarrow \lnot Q$ be called?

The reason why I want to know is that I want to show that $P$ is true by contradiction, proving that both $\lnot P \rightarrow \lnot Q$ and $\lnot P \rightarrow Q$ are true to conclude that $\lnot P$ is false. I initially framed this by stating that $\lnot P \rightarrow \lnot Q$ is a contradiction to $\lnot P \rightarrow Q$, but my supervisor said that this was incorrect, since both theorems are technically true.

1 Answers1

1

There seems to be no name for $P \rightarrow \lnot Q$.

The statement "$\neg P \to \neg Q$ is a contradiction to $\neg P \to Q$" is indeed wrong, since both these implications are true, they don't contradict each other.

The correct way to state this was to use modus ponens. You have already proven $\vdash \neg P \to \neg Q$ and $\vdash \neg P \to Q$. Since you assume $\neg P$, you then get $\vdash Q$ and $\vdash \neg Q$, and this is the contradiction you've been looking for.

Olivier Roche
  • 5,319
  • 9
  • 16