Negation of the proposition \(∃𝑥𝐻(𝑥)\) is
2017
Negation of the proposition \(∃𝑥𝐻(𝑥)\) is
- A.
\(\exists \: x \: \neg \: H(x)\) - B.
\(\forall \: x \: \neg \: H(x)\) - C.
\(\forall \: x \: H(x)\) - D.
\(\neg \: x \: H(x)\)
Attempted by 414 students.
Show answer & explanation
Correct answer: B
Answer: ∀x ¬H(x).
Reason: By the quantifier negation rule, not-exists becomes for-all-not: ¬(∃x H(x)) ≡ ∀x ¬H(x). Intuitively, saying "it is not the case that some x has property H" means "every x does not have property H."
Common incorrect alternative: ∃x ¬H(x) states that there exists at least one x without H, which is not equivalent to saying no x has H.
Example to see the difference: if H(1) = true and H(2) = false, then ∃x H(x) is true and its negation is false, but ∃x ¬H(x) is true. So ∃x ¬H(x) does not capture the negation of ∃x H(x).
A video solution is available for this question — log in and enroll to watch it.