The universal quantifier ∀x denotes 'for all x in the domain'. A universal statement ∀x P(x) is true if and only if P(x) is true for every element x in the domain. Most mathematical theorems are universal statements asserting properties hold for entire classes of objects.
Translate English statements like 'all integers are even or odd' into symbolic form. Understand that proving a universal statement requires showing it holds for every element.
You already know what a predicate is: a statement P(x) whose truth value depends on the variable x. For example, P(x) = "x² > 0" is true for x = 3 but false for x = 0. The universal quantifier ∀ ("for all") converts a predicate into a definite proposition by asserting that P(x) holds for *every* element x in the domain. Writing ∀x ∈ ℤ, x² ≥ 0 makes a claim about all integers simultaneously — it's either true or false as a complete statement, not a question with a variable.
The domain of quantification is critical and must always be specified, explicitly or from context. "∀x, x > 0" is false if the domain is ℤ (since −1 ≤ 0) but true if the domain is ℕ\{0} (positive natural numbers). The same predicate with the same quantifier can have opposite truth values depending on what x ranges over. In mathematical writing, the domain is often implicit — "for all x" means "for all x in the current universe of discourse" — but developing the habit of asking "over which domain?" is essential.
To prove a universal statement ∀x P(x), you cannot check cases individually unless the domain is finite and small. Instead, the standard strategy is to introduce an arbitrary element: "Let x be an arbitrary element of the domain. We will show P(x) holds." Because x is arbitrary — no special properties assumed beyond membership in the domain — whatever you prove about x applies to all elements. This is the template for direct proof: assume x is generic, derive P(x) through logic and definitions, conclude the universal statement follows. The arbitrariness of x is the entire engine of the argument.
To disprove a universal statement, you need only a single counterexample — one specific x for which P(x) is false. A universal claim is defeated the moment one exception is found. This asymmetry is fundamental: proving requires covering all cases, disproving requires finding just one failure. Students who confuse the two — trying to prove universals with examples, or thinking one example proves a universal — make systematic errors in mathematical reasoning. The corrective habit is to ask: am I making a claim about *all* elements, or about *some* element? One example confirms existence (∃); it never establishes universality (∀).