An inference rule that allows one to derive a formula instance from a universally quantified statement: from ∀x P(x) one may infer P(t) for any term t that is appropriate to substitute for x.

Principle

A universally quantified claim about all elements of a domain licenses substitution of an arbitrary but suitably free term for the bound variable, yielding a specific instance while preserving truth when substitution is capture-avoiding.

Demonstration

Given the axiom ∀n ∈ N, n + 0 = n, we may instantiate to obtain 5 + 0 = 5 by substituting the numeral 5 for the bound variable n.

Misapplication

Instantiating to a term that is not in the domain, or substituting a term that introduces variable capture (e.g., replacing a bound variable by an expression containing a quantified variable) invalidates the inference.

Consequence

Permits deriving concrete consequences from general laws, enabling progress from general premises to particular conclusions in proofs and computations.

Reversal

The inversion is universal generalization, which attempts to infer ∀x P(x) from instances; unlike instantiation, generalization requires care to ensure the instance was arbitrary and no extra assumptions were made.

Boundary

Holds in first-order and related logics where domains and substitution are well-defined; does not authorize instantiation across different sorts or into contexts that change binding structure, and requires the substituting term to be free for the variable.

Semantic Tension

Tension exists with existential rules: universal instantiation yields particular instances but does not produce existence claims; confusing instantiation with existential introduction is a common semantic slip.

Synthesis

Universal Instantiation: a basic and safe rule in standard predicate logics that produces specific instances from universal claims provided substitutions respect domain, sorts, and capture-avoidance constraints.