Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any". 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 ("∀x", "∀(x)", or sometimes by "(x)" 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. Quantification in general is covered in the article on quantification (logic). The universal quantifier is encoded as in Unicode, and as \forall in LaTeX and related formula editors. 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, 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.