Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Negate a Conditional Statement

A conditional P→QP \to Q fails in exactly one case: PP is true and QQ is false. So its negation is not another if-then statement; it is the conjunction P∧¬QP \land \neg Q.

Recognize the task

The question asks for the negation of an if-then statement, for what would make it false, or for a counterexample: ¬(P→Q)\neg(P \to Q), ¬(P→¬Q)\neg(P \to \neg Q), "it is not true that if it rains, the game is canceled". Test: a ¬\neg stands in front of an arrow, or a "not" governs a whole if-then sentence.
Conditionals and their single false row are explained in the implication lesson.

Two ways to do it

Law chainusual
¬(P→Q)≡¬(¬P∨Q)≡P∧¬Q\neg(P \to Q) \equiv \neg(\neg P \lor Q) \equiv P \land \neg Q
Remove the arrow, then push the negation inside; this works for any nesting.
Use the rule directlyshortcut
¬(P→Q)≡P∧¬Q\neg(P \to Q) \equiv P \land \neg Q
Quote the negation of a conditional: keep PP, negate QQ, join with ∧\land.

Steps

StepOn ¬(P→Q)\neg(P \to Q)
1Name the condition and the conclusion. In "if PP then QQ", PP is the antecedent and QQ the consequent. Put brackets around them if they are compound.antecedent PP, consequent QQ
2Rewrite the arrow. Material implication turns P→QP \to Q into ¬P∨Q\neg P \lor Q.Material implication ↗¬(¬P∨Q)\neg(\neg P \lor Q)
3Push the negation inside. By De Morgan's law, ¬\neg goes onto each part and ∨\lor becomes ∧\land.De Morgan's laws ↗¬¬P∧¬Q\neg\neg P \land \neg Q
4Cancel the double negation. The result keeps the antecedent and denies the consequent.Double negation law ↗P∧¬QP \land \neg Q

Worked examples

Example 1 · a negated consequent

symbols
¬(P→¬Q)≡¬(¬P∨¬Q)\neg(P \to \neg Q) \equiv \neg(\neg P \lor \neg Q)
material implication
≡¬¬P∧¬¬Q\equiv \neg\neg P \land \neg\neg Q
De Morgan
≡P∧Q\equiv P \land Q
double negation twice

Example 2 · in words

sentence
PP: it rains; QQ: the game is canceled
name the parts
¬(P→Q)≡P∧¬Q\neg(P \to Q) \equiv P \land \neg Q
negation of a conditional
It rains and the game is not canceled.
keep PP, deny QQ

Example 3 · a nested arrow

twice
¬(P→(Q→R))≡P∧¬(Q→R)\neg(P \to (Q \to R)) \equiv P \land \neg(Q \to R)
outer arrow first
≡P∧(Q∧¬R)\equiv P \land (Q \land \neg R)
negate the inner arrow
≡P∧Q∧¬R\equiv P \land Q \land \neg R
associative law
Compare ¬(P→Q)\neg(P \to Q) with your answer in the equivalence validator.

See it happen

The truth table of P→QP \to Q has three T rows and one F row: P=TP = T, Q=FQ = F. The negation flips every row, so it is T in exactly that one row and F elsewhere. A formula that is T in a single row is a single and-term, here P∧¬QP \land \neg Q. Any if-then answer, such as P→¬QP \to \neg Q, is T in at least three rows, so it cannot be the negation.

Common mistakes

Answering with another conditional

✗ ¬(P→Q)≡P→¬Q\neg(P \to Q) \equiv P \to \neg Q
✓ ¬(P→Q)≡P∧¬Q\neg(P \to Q) \equiv P \land \neg Q; at P=FP = F the arrow form is T but the negation is F

Negating both parts

✗ ¬(P→Q)≡¬P∧¬Q\neg(P \to Q) \equiv \neg P \land \neg Q
✓ only the consequent is negated: P∧¬QP \land \neg Q

Answering with the inverse

✗ the negation of "if it rains, the game is canceled" is "if it does not rain, the game is not canceled"
✓ the negation is "it rains and the game is not canceled"