Math 2.0

Mathematical logic and foundations Proof

Proof of Russell's paradox

Builds on SetElement

Proof

We argue by contradiction.

  1. Suppose that there is a set RR such that, for each set xx, x∈Rx \in R if and only if x∉xx \notin x.
  2. The object RR is itself a set. So we may take x=Rx = R in step 1. This gives: R∈RR \in R if and only if R∉RR \notin R.
  3. Suppose R∈RR \in R. By step 2, R∉RR \notin R. This contradicts the assumption R∈RR \in R.
  4. So R∈RR \in R is false, that is, RR is not an element of RR. In symbols, R∉RR \notin R.
  5. By step 2 and step 4, R∈RR \in R.
  6. Steps 4 and 5 give both R∉RR \notin R and R∈RR \in R, a contradiction.
  7. So the assumption of step 1 is false. There is no set RR such that, for each set xx, x∈Rx \in R if and only if x∉xx \notin x.

Idea

Ask whether RR contains itself. The defining property of RR says that R∈RR \in R exactly when R∉RR \notin R. No statement can be equivalent to its own negation, so no such RR exists.

Reading path

To understand this page from the ground up, read these 3 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. Element definition
  2. Set definition
  3. Proof of Russell's paradox proof

Where this leads

45 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Russell%27s_Paradox
About this page
Tag4CVPENYR0S
URIm2://4CVPENYR0S
Kindproof
WritingW0 stub
MSC03E30
ProvesRussell's paradox
UsesSet, Element
MethodsProof by contradiction
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.