∀x φ(x) is true in a structure iff φ(a) is true for every object a in the domain. The universal quantifier is the logical analog of conjunction over all objects. Scope interactions (∀x ∃y vs. ∃y ∀x) are crucial: different quantifier orderings yield different truth conditions.
Work with small finite domains and verify universal statements. Observe how changing domain size affects truth values.
You already know from your study of quantifier notation that ∀x φ(x) is pronounced "for all x, φ(x)" — but what does that actually mean? The answer is beautifully simple: ∀x φ(x) is true in a structure M if and only if φ(a) holds for every individual a in the domain of M. The universal quantifier is, at its core, a generalized conjunction. If your domain contains exactly the objects {Alice, Bob, Carol}, then ∀x Tall(x) is equivalent to Tall(Alice) ∧ Tall(Bob) ∧ Tall(Carol). The quantifier is shorthand for a (possibly infinite) conjunction over every element of the domain.
This conjunction analogy explains both the power and the peril of universal statements. In a finite domain of three people, a universal claim is as strong as three separate assertions. In an infinite domain — the natural numbers, the real numbers, all people who have ever lived — it asserts infinitely many things simultaneously. This is what propositional logic cannot do: there is no way to write "for every natural number n, n + 0 = n" as a finite conjunction of atomic propositions. The universal quantifier is what gives first-order logic its expressive reach beyond finite enumeration.
Scope is the subtlest aspect of universal quantification, and it is where mistakes accumulate. When a formula has multiple quantifiers, their order determines the truth conditions. Consider "every number has a successor": ∀x ∃y (y = x + 1). This says for each x, there exists some y that is x's successor — and that y may depend on x. Now consider swapping the order: ∃y ∀x (y = x + 1). This would mean there is a single y that is simultaneously the successor of every x — obviously false in the natural numbers. The scope of ∀x is the formula that follows it, and any variable y introduced inside that scope can depend on the value of x. Variables introduced outside the scope cannot.
A related subtlety is vacuous truth: ∀x φ(x) is true in the empty domain because there are no objects for which φ could fail. More practically, a conditional universal like ∀x (Even(x) → Divisible(x, 2)) is true even if there are no even numbers in the domain — there is nothing to check. This may feel odd, but it is consistent with the conjunction interpretation: an empty conjunction is true. You will encounter vacuous truth repeatedly in mathematical proofs, where universal statements over empty sets are freely asserted.
Finally, a universal statement about a structure is not a fact about the formula alone — it is a fact about the formula relative to an interpretation. ∀x (x > 0) is true in the positive reals but false in all real numbers. When you evaluate a universal claim, the first question is always: what is the domain? The domain is set by the structure, not by the formula, and changing the domain can flip a universal from true to false. This is the fundamental lesson of model-theoretic semantics: logical truth is always relative to a structure, and the quantifier ranges over whatever objects that structure provides.