Math 2.0

Mathematical logic and foundations Theorem

Negation of a universal statement

Builds on Universal quantifierExistential quantifierNegation

Statement

Let XX be a set and let P(x)P(x) be a predicate on XX. In classical logic, the negation of ∀x∈X, P(x)\forall x \in X, \, P(x) is logically equivalent to ∃x∈X, ¬P(x)\exists x \in X, \, \neg P(x). ¬(∀x∈X, P(x))≡∃x∈X, ¬P(x)\neg \bigl( \forall x \in X, \, P(x) \bigr) \equiv \exists x \in X, \, \neg P(x)

Remarks

The direction from ∃x, ¬P(x)\exists x, \, \neg P(x) to ¬∀x, P(x)\neg \forall x, \, P(x) is valid in intuitionistic logic. The other direction needs classical logic. This law explains why one counterexample refutes a universal statement. For a finite XX, it is a form of De Morgan's laws.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Negation definition
  3. Predicate definition
  4. Existential quantifier definition
  5. Universal quantifier definition
  6. Negation of a universal statement statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Quantifier_(logic), lead section
About this page
Tag0P3A06QNDP
URIm2://0P3A06QNDP
Kindstatement, theorem
WritingW0 stub
MSC03B10
StatusThis copy of the site has no build data. Run m2 status 0P3A06QNDP.
UsesUniversal quantifier, Existential quantifier, Negation

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by