Universal Quantification

In a first-order language, a universal quantification, written ∀xφ, is interpreted to mean that the given formula (φ) is satisfied when the given variable (x) is bound to any element of the universe of discourse.

References

Doets, Kees. From Logic to Logic Programming. MIT Press, 1994.