A formal inference rule in predicate logic that permits deriving a universal formula ∀x φ(x) when φ(x) has been derived under the condition that x is arbitrary and does not depend on any assumptions about that particular individual.

Principle

If a formula holds for an arbitrarily chosen element—one whose name does not occur in any undischarged assumption—then it holds for every element; the arbitrary instance justifies universal introduction.

Demonstration

Suppose, with no premises mentioning the symbol a, one derives P(a) using only rules that do not assume anything specific about a. By universal generalization one may infer ∀x P(x). For example, from a proof of 'a is even' that treats a as arbitrary, infer 'every integer is even' only if the arbitrariness condition is satisfied (otherwise the step is invalid).

Misapplication

Applying the rule when the witness symbol was introduced by an undischarged assumption or depends on premises about that symbol (for example deriving P(a) from 'a = 0' and then concluding ∀x P(x)) produces an illicit generalization.

Consequence

When used correctly it permits abstraction from a representative instance to a general law, enabling the formation of universal theorems and quantifier introduction in proofs.

Reversal

The dual or inverse move is Universal Instantiation: from ∀x φ(x) infer φ(t) for a particular term t. Universal generalization and instantiation move between the general and particular directions of quantification.

Boundary

Requires the variable (or witness constant) to be free of dependence on undischarged assumptions and not to appear in premises that constrain it. In some modal, constructive, or typed settings additional restrictions apply to prevent unsound generalizations.

Semantic Tension

Tension exists between the syntactic rule of introducing ∀ in a proof and the semantic notion of 'true for all elements in a model'; a syntactic generalization can be blocked by proof-formation constraints even when the formula is semantically valid in every model.

Synthesis

Universal Generalization is the proof rule that turns a derivation about an arbitrary, unconstrained representative into a universal statement, subject to freshness and independence conditions that prevent illicit abstraction.