Math 2.0

Mathematical logic and foundations Proof

Proof of the negation of a universal statement

Builds on PredicateUniversal quantifierExistential quantifierNegation

Proof

We show that the two propositions have the same truth value for each set XX and each predicate PP on XX.

  1. Let XX be a set and let P(x)P(x) be a predicate on XX. For each a∈Xa \in X, the proposition P(a)P(a) is true or false.
  2. By the definition of negation, ¬(∀x∈X, P(x))\neg \bigl( \forall x \in X, \, P(x) \bigr) is true exactly when ∀x∈X, P(x)\forall x \in X, \, P(x) is false.
  3. By the definition of the universal quantifier, ∀x∈X, P(x)\forall x \in X, \, P(x) is false exactly when it is not the case that P(a)P(a) is true for each a∈Xa \in X.
  4. This means that there is some a∈Xa \in X for which P(a)P(a) is not true. By step 1, such a P(a)P(a) is false.
  5. By the definition of negation, P(a)P(a) is false exactly when ¬P(a)\neg P(a) is true.
  6. By steps 2 to 5, ¬(∀x∈X, P(x))\neg \bigl( \forall x \in X, \, P(x) \bigr) is true exactly when ¬P(a)\neg P(a) is true for at least one a∈Xa \in X.
  7. By the definition of the existential quantifier, this is exactly when ∃x∈X, ¬P(x)\exists x \in X, \, \neg P(x) is true.
  8. So the two propositions are true in the same cases, and false in the same cases. Hence ¬(∀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).

Idea

"Not everything has the property" means "at least one thing fails to have it". The proof unfolds the meaning of the universal quantifier and of negation. Classical logic enters in steps 3 and 4: "not all are true" becomes "some one is false".

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. Proof of the negation of a universal statement proof

Where this leads

2 pages build on this one.

Further reading

  1. Web https://richardhammack.github.io/BookOfProof/
About this page
TagDTM9GQV88K
URIm2://DTM9GQV88K
Kindproof
WritingW0 stub
MSC03B10
ProvesNegation of a universal statement
UsesPredicate, Universal quantifier, Existential quantifier, Negation
Changed4 November 2026

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)
  • a source with a locator (0 of 1)

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

What links here

No page links to this page yet.