Quantified statements and their negations

A universal statement asserts that a predicate holds at every object in a specified domain. An existential statement asserts that at least one object in that domain makes the predicate true. A witness is an object supplied to establish an existential claim. A universal proof starts with an arbitrary domain element without imposing extra convenient properties. Choosing the number seven proves something about seven; it does not automatically establish something about an arbitrary integer.

Variables governed by quantifiers are bound locally, much as a parameter is local to a function. Renaming a bound variable leaves the statement unchanged when all its bound occurrences are renamed consistently and no variables are accidentally captured. The domain matters: every positive integer has an integer predecessor, but not every positive integer has a positive integer predecessor. On an empty domain a universal claim is true and an existential claim false, because there are respectively no counterexamples and no witnesses.

Read nested quantifiers from left to right as a sequence of choices. In a statement beginning “for every x, there exists y,” you learn x before choosing y, so your rule for y may use x. In “there exists y, for every x,” you must choose y before x is revealed. The latter statement asks for a uniform witness. Two universal quantifiers may be exchanged, and two existential quantifiers may be exchanged, but exchanging unlike quantifiers generally changes the demand.

Over the real numbers, each x has a larger y: choose x plus one. There is no real number y larger than every real x, since after a candidate y is chosen, x can equal y plus one. This is not a contest about how large a named number looks. The failure comes from the unbounded domain and the order of permitted choices. When reading a limit definition later, write beside each tolerance exactly which previously chosen quantities it may depend on.

To deny that every object satisfies a predicate, provide at least one object where the predicate fails. To deny an existential claim, establish failure for every candidate. Therefore negation switches universal and existential quantifiers and negates the final predicate. Apply this operation one quantifier at a time, preserving their order. Negating “every x has some successful y” yields “some x has no successful y,” not “every x has an unsuccessful y.”

Inequalities must also be negated correctly. For real numbers, the negation of a strict inequality greater than is less than or equal to, because equality is a genuine remaining case. A counterexample to a nested universal-existential statement must defeat every witness available after the chosen outer input. Producing one failed witness does not suffice when another might work. This adversarial reading is useful for designing tests, but a finite test suite cannot exhaust an infinite domain without a separate argument.