## Discrete Mathematics with Applications 4th Edition

Recall the form of the negation of a universal conditional statement: $~(\forall x, P(x) \rightarrow Q(x)) \equiv \exists x$ such that $(P(x) \land$ ~$Q(x))$. The original statement is implicitly universally quantified.