---
title: Universal quantification
slug: universal-quantification
qid: 
snapshot: enwiki-001374631606
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1374631606
tags: [10639794, 23118434, 23603337, 26696210, 29265205, 54769530]
---

# Universal quantification

> [!note] Provenance
> Snapshot `enwiki-001374631606` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1374631606> · Licensed CC BY-SA 4.0

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable. It is usually denoted by the turned A (∀) logical operator symbol, which, when used together with a predicate variable, is called a universal quantifier (" ", " ", or sometimes by " " alone). Universal quantification is distinct from existential quantification ("there exists"), which only asserts that the property or relation holds for at least one member of the domain. The universal quantifier is encoded as in Unicode, and as \forall in LaTeX and related formula editors.

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", "for every", or "given an arbitrary element". It expresses that a predicate can be satisfied by every member of a domain of discourse. In other words, it is the predication of a property or relation to every member of the domain. It asserts that a predicate within the scope of a universal quantifier is true of every value of a predicate variable. It is usually denoted by the turned A (∀) logical operator symbol, which, when used together with a predicate variable, is called a universal quantifier (" ", " ", or sometimes by " " alone). Universal quantification is distinct from existential quantification ("there exists"), which only asserts that the property or relation holds for at least one member of the domain. The universal quantifier is encoded as in Unicode, and as \forall in LaTeX and related formula editors. 2·0 = 0 + 0, and 2·1 = 1 + 1, and , ..., and 2 · 100 = 100 + 100, and ..., etc. This would seem to be an infinite logical conjunction because of the repeated use of "and". However, the "etc." cannot be interpreted as a conjunction in formal logic, Instead, the statement must be rephrased: For all natural numbers n, one has 2·n = n + n. This is a single statement using universal quantification. This statement can be said to be more precise than the original one. While the "etc." informally includes natural numbers, and nothing more, this was not rigorously given. In the universal quantification, on the other hand, the natural numbers are mentioned explicitly. This particular example is true, because any natural number could be substituted for n and the statement "2·n = n + n" would be true. In contrast, For all natural numbers n, one has 2·n > 2 + n is false, because if n is substituted with, for instance, 1, the statement "2·1 > 2 + 1" is false. It is immaterial that "2·n > 2 + n" is true for most natural numbers n: even the existence of a single counterexample is enough to prove the universal quantification false. On the other hand, for all composite numbers n, one has 2·n > 2 + n is true, because none of the counterexamples are composite numbers. This indicates the importance of the domain of discourse, which specifies which values n can take. In particular, note that if the domain of discourse is restricted to consist only of those objects that satisfy a certain predicate, then for universal quantification this requires a logical conditional. For example, For all composite numbers n, one has 2·n > 2 + n is logically equivalent to For all natural numbers n, if n is composite, then 2·n > 2 + n. Here the "if ... then" construction indicates the logical conditional. \exists_f S =\{ y\in Y \;|\; \exists x\in X.\ f(x)=y \quad\land\quad x\in S \}, those y in the image of S under f . Similarly, the universal quantifier \forall_f\colon \mathcal{P}X\to \mathcal{P}Y is a functor that, for each subset S \subset X , gives the subset \forall_f S \subset Y given by \forall_f S =\{ y\in Y \;|\; \forall x\in X.\ f(x)=y \quad\implies\quad x\in S \}, those y whose preimage under f is contained in S . The more familiar form of the quantifiers as used in first-order logic is obtained by taking the function f to be the unique function !:X \to 1 so that \mathcal{P}(1) = \{T,F\} is the two-element set holding the values true and false, a subset S is that subset for which the predicate S(x) holds, and \begin{array}{rl}\mathcal{P}(!)\colon \mathcal{P}(1) & \to \mathcal{P}(X)\\ T &\mapsto X \\ F &\mapsto \{\}\end{array} \exists_! S = \exists x. S(x), which is true if S is not empty, and \forall_! S = \forall x. S(x), which is false if S is not X. The universal and existential quantifiers given above generalize to the presheaf category.
