Mathematics I / Quantifiers and Predicates
Practice question · Multiple choice

The negation of "for all xx there exists yy with P(x,y)P(x,y)" is "there exists xx such that for all yy, not P(x,y)P(x,y)". Why do the quantifiers flip as well as the predicate?

Hints
  1. Negate "every student passed some exam" in plain English.
  2. You need one student, and no exam they passed.
Show the answer

C. Because denying 'every' needs one failure and denying 'some' needs all

Why

Push the negation inward and each quantifier dualises. This is the mechanical rule behind every proof by counterexample: one witness refutes a universal claim.

Read the lesson: Quantifiers and Predicates →

Practise Quantifiers and Predicates

The app has 5 more questions on this lesson, and keeps your place in the course. Mathematics I is free to start.

More questions on Quantifiers and Predicates