RankLab
Back to Concepts
MathsMediumClass 11

Negation — Of compound statements

Mathematical Reasoning

7

JEE Qs

8%

Hard

45

min

Master De Morgan's Laws and the negation of conditional statements, paying close attention to correctly applying rules for quantifiers, to avoid common traps.

🧮 Key Formulas

¬(P ∧ Q) ≡ ¬P ∨ ¬Q
¬(P ∨ Q) ≡ ¬P ∧ ¬Q
¬(P → Q) ≡ P ∧ ¬Q
¬(P ↔ Q) ≡ (P ∧ ¬Q) ∨ (Q ∧ ¬P)
¬(∀x, P(x)) ≡ ∃x, ¬P(x)
¬(∃x, P(x)) ≡ ∀x, ¬P(x)

✅ Key Points for JEE

  • 1De Morgan's laws are fundamental for negating 'AND' and 'OR' statements: switch the connective (∧ to ∨, ∨ to ∧) and negate each individual component statement.
  • 2The negation of an implication 'P → Q' is 'P ∧ ¬Q'; a common mistake is to write '¬P → ¬Q' which is incorrect.
  • 3When negating statements involving quantifiers, 'for all (∀)' becomes 'there exists (∃)' and vice-versa, while the predicate itself is also negated.
  • 4Negating complex compound statements often requires multiple steps, applying the negation rules hierarchically from the outermost connective inwards.

⚠️ Common Mistakes

  • Incorrectly applying De Morgan's laws by failing to switch the connective (e.g., negating P ∧ Q to ¬P ∧ ¬Q instead of ¬P ∨ ¬Q).
  • Mistaking the negation of 'if P then Q' for 'if not P then not Q' (inverse) or 'not P then Q'.
  • Failing to negate the quantifier (e.g., keeping 'for all' as 'for all' instead of changing to 'there exists') or incorrectly negating the predicate when quantifiers are involved.

NCERT Chapters

  • Class 11 Maths Ch 14: Mathematical Reasoning