In predicate logic, universal quantification formalizes the notion that something (a logical predicate) is true for everything, or every relevant thing. The resulting statement is a universally quantified statement, and we have universally quantified over the predicate. In symbolic logic, the universal quantifier (typically Failed to parse (Missing texvc executable; please see math/README to configure.): \forall , U+2200 ∀ , a turned A) is the symbol used to denote universal quantification, and is often informally read as "given any" or "for all". Universal quantification is distinct from existential quantification ("there exists"), which asserts that the property or relation holds for at least one member of the domain.

Quantification in general is covered in the article on quantification. Symbols are encoded U+2200 ∀ for all (HTML: ∀ ∀ as a mathematical symbol).

Basics[link]

Suppose it is given that

2·0 = 0 + 0, and 2·1 = 1 + 1, and 2·2 = 2 + 2, etc.

This would seem to be a 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, 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, 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, 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.^{[note 1]} 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, 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.

Notation[link]

In symbolic logic, the universal quantifier symbol Failed to parse (Missing texvc executable; please see math/README to configure.): \forall

(a inverted "A" in a sans-serif font, Unicode 0x2200) is used to indicate universal quantification.[1]

For example, if P(n) is the predicate "2·n > 2 + n" and N is the set of natural numbers, then:

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall n\!\in\!\mathbb{N}\; P(n)

is the (false) statement:

For all natural numbers n, 2·n > 2 + n.

Similarly, if Q(n) is the predicate "n is composite", then

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall n\!\in\!\mathbb{N}\; \bigl( Q(n) \rightarrow P(n) \bigr)

is the (true) statement:

For all natural numbers n, if n is composite, then 2·n > 2 + n

and since "n is composite" implies that n must already be a natural number, we can shorten this statement to the equivalent:

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall n\; \bigl( Q(n) \rightarrow P(n) \bigr)

For all composite numbers n, 2·n > 2 + n.

Several variations in the notation for quantification (which apply to all forms) can be found in the quantification article. There is a special notation used only for universal quantification, which is given:

Failed to parse (Missing texvc executable; please see math/README to configure.): (n{\in}\mathbb{N})\, P(n)

The parentheses indicate universal quantification by default.

Properties[link]

Negation[link]

Note that a quantified propositional function is a statement; thus, like statements, quantified functions can be negated. The notation most mathematicians and logicians utilize to denote negation is: Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ . However, some (such as Douglas Hofstadter) use the tilde (~).

For example, if P(x) is the propositional function "x is married", then, for a Universe of Discourse X of all living human beings, the universal quantification

Given any living person x, that person is married

is given:

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall{x}{\in}\mathbf{X}\, P(x)

It can be seen that this is irrevocably false. Truthfully, it is stated that

It is not the case that, given any living person x, that person is married

or, symbolically:

Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ \forall{x}{\in}\mathbf{X}\, P(x)

.

If the statement is not true for every element of the Universe of Discourse, then, presuming the universe of discourse is non-empty, there must be at least one element for which the statement is false. That is, the negation of Failed to parse (Missing texvc executable; please see math/README to configure.): \forall{x}{\in}\mathbf{X}\, P(x)

is logically equivalent to "There exists a living person x such that he is not married", or:

Failed to parse (Missing texvc executable; please see math/README to configure.): \exists{x}{\in}\mathbf{X}\, \lnot P(x)

Generally, then, the negation of a propositional function's universal quantification is an existential quantification of that propositional function's negation; symbolically,

Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ \forall{x}{\in}\mathbf{X}\, P(x) \equiv\ \exists{x}{\in}\mathbf{X}\, \lnot P(x)

It is erroneous to state "all persons are not married" (i.e. "there exists no person who is married") when it is meant that "not all persons are married" (i.e. "there exists a person who is not married"):

Failed to parse (Missing texvc executable; please see math/README to configure.): \lnot\ \exists{x}{\in}\mathbf{X}\, P(x) \equiv\ \forall{x}{\in}\mathbf{X}\, \lnot P(x) \not\equiv\ \lnot\ \forall{x}{\in}\mathbf{X}\, P(x) \equiv\ \exists{x}{\in}\mathbf{X}\, \lnot P(x)

Other connectives[link]

The universal (and existential) quantifier moves unchanged across the logical connectives ∧, ∨, →, and Failed to parse (Missing texvc executable; please see math/README to configure.): \nleftarrow , as long as the other operand is not affected; that is:

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \land (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \land Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \lor (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \lor Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \to (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \to Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \nleftarrow (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \nleftarrow Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \land (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \land Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \lor (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \lor Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \to (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \to Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \nleftarrow (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \nleftarrow Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Conversely, for the logical connectives ↑, ↓, Failed to parse (Missing texvc executable; please see math/README to configure.): \nrightarrow , and ←, the quantifiers flip:

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \uparrow (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \uparrow Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \downarrow (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \downarrow Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \nrightarrow (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \nrightarrow Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \gets (\exists{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \forall{y}{\in}\mathbf{Y}\, (P(x) \gets Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \uparrow (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \uparrow Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \downarrow (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \downarrow Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \nrightarrow (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \nrightarrow Q(y))

Failed to parse (Missing texvc executable; please see math/README to configure.): P(x) \gets (\forall{y}{\in}\mathbf{Y}\, Q(y)) \equiv\ \exists{y}{\in}\mathbf{Y}\, (P(x) \gets Q(y)),~\mathrm{provided~that}~\mathbf{Y}\neq \emptyset

Rules of inference[link]

A rule of inference is a rule justifying a logical step from hypothesis to conclusion. There are several rules of inference which utilize the universal quantifier.

Universal instantiation concludes that, if the propositional function is known to be universally true, then it must be true for any arbitrary element of the Universe of Discourse. Symbolically, this is represented as

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall{x}{\in}\mathbf{X}\, P(x) \to\ P(c)

where c is a completely arbitrary element of the Universe of Discourse.

Universal generalization concludes the propositional function must be universally true if it is true for any arbitrary element of the Universe of Discourse. Symbolically, for an arbitrary c,

Failed to parse (Missing texvc executable; please see math/README to configure.): P(c) \to\ \forall{x}{\in}\mathbf{X}\, P(x).

The element c must be completely arbitrary; else, the logic does not follow: if c is not arbitrary, and is instead a specific element of the Universe of Discourse, then P(c) only implies an existential quantification of the propositional function.

The empty set[link]

By convention, the formula Failed to parse (Missing texvc executable; please see math/README to configure.): \forall{x}{\in}\emptyset \, P(x)

is always true, regardless of the formula P(x); see vacuous truth.

Universal closure[link]

The universal closure of a formula φ is the formula with no free variables obtained by adding a universal quantifier for every free variable in φ. For example, the universal closure of

Failed to parse (Missing texvc executable; please see math/README to configure.): P(y) \land \exists x Q(x,z)

is

Failed to parse (Missing texvc executable; please see math/README to configure.): \forall y \forall z ( P(y) \land \exists x Q(x,z))

.

See also[link]

Look up every in Wiktionary, the free dictionary.

• Existential quantification
• Quantifiers
• First-order logic

Notes[link]

1. ^ Further information on using domains of discourse with quantified statements can be found in the Quantification article.

References[link]

• Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-56881-262-0. 
• Franklin, J. and Daoud, A. (2011). Proof in Mathematics: An Introduction. Kew Books. ISBN 978-0-646-54509-7. http://www.maths.unsw.edu.au/~jim/proofs.html.  (ch. 2)