WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Cantor's theorem

72 passages34 formalized1 statement only11 partial26 not formalized

More ways to filter
Library
About this page

This page

  • Wikipedia revision 1356713544, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: B-class, High importance
  • Annotated article on WikiLean.
  • 72 passages checked, 64 Lean locations (and 57 related declarations).

Central statements: 16 of the 72 passages state the article's subject or a named result or definition; the other 56 are supporting (examples, setup). Of these 16: 12 formalized, 2 partial, 2 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (17 locations and 2 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 35 of 47 locations and 4 of 25 absences. In all, 52 of 64 Lean locations (81%) and 6 of 27 absences (22%) were re-checked.
  • Passage text: 72 of 72 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1356713544 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Passages

What “exact match”, “more general” and the other labels mean
  1. Theorem · Subject of the article

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set A, the set of all subsets of A, known as the power set of A, has a strictly greater cardinality than A itself.

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor close match

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why close, not exact: Mathlib writes the size of the power set as the cardinal exponential two raised to the size of A, which Cardinal.mk_set identifies with the size of the type of subsets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e8f0c97c62d6 · pair key 70c36034796e.
  2. Theorem · supporting

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Counting the empty set as a subset, a set with n elements has a total of 2n subsets, and the theorem holds because 2n > n for all non-negative integers.

    Show in article · Read it in context on Wikipedia

    Set.ncard_powerset exact match

    theorem Set.ncard_powerset {α : Type*} (s : Set α) : autoParam s.Finite Set.ncard_powerset._auto_1 → (𝒫 s).ncard = 2 ^ s.ncard

    Mathlib.Data.Set.Card · lines 732–736

    Note: The power set here collects every subset of s, the empty one and s itself included, matching the passage's count.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3765db9e132f · pair key ccfa82677bd0.

    Finset.card_powerset exact match

    theorem Finset.card_powerset {α : Type*} (s : Finset α) : s.powerset.card = 2 ^ s.card

    Mathlib.Data.Finset.Powerset · lines 102–103

    Note: Finset.powerset enumerates every subset of s, the empty one among them.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 635f4131ec76 · pair key 1231c2bc8a20.

    Fintype.card_set exact match

    theorem Fintype.card_set {α : Type*} [Fintype α] : Fintype.card (Set α) = 2 ^ Fintype.card α

    Mathlib.Data.Fintype.Powerset · lines 68–69

    Note: Here the passage's set is carried by a type and its subsets by Set alpha, which includes the empty subset.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 99840e2a09e1 · pair key 82456e4462d4.
  3. Theorem · main statement

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Counting the empty set as a subset, a set with n elements has a total of 2n subsets, and the theorem holds because 2n > n for all non-negative integers.

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor more general

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why more general: The declaration is stated for every cardinal, so it also covers the finite sets the passage restricts itself to.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e7f8073c6c46 · pair key f0c36b38b9f6.
  4. Theorem · supporting

    Formalized

    Formalized: Lean core states this exactly (proved).

    Counting the empty set as a subset, a set with n elements has a total of 2n subsets, and the theorem holds because 2n > n for all non-negative integers.

    Show in article · Read it in context on Wikipedia

    Nat.lt_two_pow_self exact match

    theorem Nat.lt_two_pow_self {n : Nat} : n < 2 ^ n

    Init.Data.Nat.Lemmas · lines 1258–1259

    Note: The binder ranges over ℕ, the natural numbers, which are exactly the non-negative integers the passage speaks of, so the whole range of the passage is covered.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 085157dedf37 · pair key fa1ed7b46da3.

    Nat.lt_pow_self more general

    theorem Nat.lt_pow_self {n a : Nat} : 1 < a → n < a ^ n

    Init.Data.Nat.Lemmas · lines 1253–1256

    Why more general: Both binders range over ℕ, the natural numbers, which are precisely the passage's non-negative integers, so the passage's whole range is reached by fixing the base at two.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 7608d3721736 · pair key 4ed0dfce68c9.
  5. Theorem · supporting

    Partial

    Partial: Mathlib states part of this (proved).

    As a consequence, the cardinality of the real numbers, which is the same as that of the power set of the integers, is strictly larger than the cardinality of the integers; see Cardinality of the continuum for details.

    Show in article · Read it in context on Wikipedia

    Cardinal.mk_real states part

    theorem Cardinal.mk_real : Cardinal.mk ℝ = Cardinal.continuum

    Mathlib.Analysis.Real.Cardinality · lines 185–195

    Why only part: Mathlib pins the value to the power set of ℕ rather than of ℤ; that the two index sets are equinumerous is the separate lemma Cardinal.mk_int.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 277cd9dabd64 · pair key cfd18a04d1aa.

    Cardinal.instUncountableReal states part

    instance Cardinal.instUncountableReal : Uncountable ℝ

    Mathlib.Analysis.Real.Cardinality · lines 201–203

    Why only part: The comparison it makes is against ℕ, where the passage names ℤ; Cardinal.mk_int is what carries one to the other.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f641dcaab171 · pair key 6b31ff12c038.
  6. Theorem · supporting

    Partial

    Partial: Mathlib states a special case (proved).

    For instance, by iteratively taking the power set of an infinite set and applying Cantor's theorem, we obtain an endless hierarchy of infinite cardinals, each strictly larger than the one before it.

    Show in article · Read it in context on Wikipedia

    Cardinal.beth_strictMono special case

    theorem Cardinal.beth_strictMono : StrictMono Cardinal.beth

    Mathlib.SetTheory.Cardinal.Aleph · lines 686–687

    Why a special case: The starting point is fixed to be a countably infinite set, where the passage allows the iteration to begin at any infinite set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 005522301a2e · pair key a9350f2f9e33.
  7. Theorem · supporting

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Consequently, the theorem implies that there is no largest cardinal number (colloquially, "there's no largest infinity").

    Show in article · Read it in context on Wikipedia

    Cardinal.instNoMaxOrder exact match

    instance Cardinal.instNoMaxOrder : NoMaxOrder Cardinal

    Mathlib.SetTheory.Cardinal.Order · line 342

    Note: Mathlib records the fact as an order instance on the type of cardinals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5c0e7874d349 · pair key 0eb0f5ba7e62.

    Cardinal.cantor more general

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why more general: It supplies an explicit bigger cardinal for each one, where the passage only denies a greatest.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 63282b41db1e · pair key 87f209494883.
  8. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Theorem (Cantor)—Let f be a map from set A to its power set 𝒫(A). Then f : A → 𝒫(A) is not surjective.

    Show in article · Read it in context on Wikipedia

    Function.cantor_surjective exact match

    theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 374–376

    Note: Mathlib carries the passage's power set as the type of subsets of alpha.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e4d389bd6521 · pair key 801af48ddded.
  9. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    As a consequence, card(A) < card(𝒫(A)) holds for any set A.

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor close match

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why close, not exact: Mathlib encodes the cardinality of the power set of A as the cardinal two raised to the cardinality of A, and Cardinal.mk_powerset records that these two cardinals agree.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c162aaad152a · pair key 0461a62bf935.
  10. Definition · supporting · Proof

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    The set B = {x ∈ A ∣ x ∉ f(x)} exists via the axiom schema of specification, and B ∈ 𝒫(A) because B ⊆ A.

    Show in article · Read it in context on Wikipedia

    ZFSet.sep more general

    def ZFSet.sep : (ZFSet → Prop) → ZFSet → ZFSet

    Mathlib.SetTheory.ZFC.Basic · lines 366–374

    Why more general: This is the separation construction itself, formed for an arbitrary predicate over an arbitrary set, which is the axiom schema the passage invokes; the passage uses the one instance given by f.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 518bdc64d189 · pair key c9d8d709c3b6.
  11. Theorem · supporting · Proof

    Not formalized
    The set B = {x ∈ A ∣ x ∉ f(x)} exists via the axiom schema of specification, and B ∈ 𝒫(A) because B ⊆ A.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt ba15be7a00df).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  12. Theorem · supporting · Proof

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The set B = {x ∈ A ∣ x ∉ f(x)} exists via the axiom schema of specification, and B ∈ 𝒫(A) because B ⊆ A.

    Show in article · Read it in context on Wikipedia

    ZFSet.sep_subset more general

    theorem ZFSet.sep_subset {x : ZFSet} {p : ZFSet → Prop} : ZFSet.sep p x ⊆ x

    Mathlib.SetTheory.ZFC.Basic · lines 390–391

    Why more general: Stated for separation over an arbitrary predicate in the ZF development, which covers the particular predicate defining the passage's diagonal set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a93010ee5af8 · pair key e62e5bbe189a.

    Set.sep_subset more general

    theorem Set.sep_subset {α : Type u} (s : Set α) (p : α → Prop) : {x | x ∈ s ∧ p x} ⊆ s

    Mathlib.Data.Set.Basic · line 989

    Why more general: The same inclusion in the type-theoretic set library, quantified over every predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 18195e87ea38 · pair key a6ba808ad4d2.
  13. Theorem · supporting · Proof

    Statement only

    Statement only: Lean core states a more general result (a Prop-valued definition: it states the claim without proving it).

    Suppose towards a contradiction that f is surjective. Then there exists a ξ ∈ A such that f(ξ) = B.

    Show in article · Read it in context on Wikipedia

    Function.Surjective more general

    def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop

    Init.Data.Function · lines 62–63

    Why more general: The declaration is the definition of surjectivity, which asserts a preimage for every element of the target; the passage uses the single instance where the target element is B.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 951f43d03dba · pair key 112e8abaeb46.
  14. Theorem · supporting · Proof

    Formalized

    Formalized: Mathlib states a more general result (proved).

    By the definition of B, we have ξ ∈ B if and only if ξ ∉ f(ξ) = B.

    Show in article · Read it in context on Wikipedia

    ZFSet.mem_sep more general

    theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y

    Mathlib.SetTheory.ZFC.Basic · lines 381–384

    Why more general: Mathlib states the membership criterion of a separated set for an arbitrary predicate, carrying the base-set conjunct that the passage's hypothesis on xi already grants.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b1bfecb719fd · pair key 324076f4e905.

    Set.mem_sep_iff more general

    theorem Set.mem_sep_iff {α : Type u} {s : Set α} {p : α → Prop} {x : α} : x ∈ {x | x ∈ s ∧ p x} ↔ x ∈ s ∧ p x

    Mathlib.Data.Set.Basic · lines 979–980

    Why more general: The same membership criterion in the type-theoretic set library, over an arbitrary predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c8fb43f8aee6 · pair key e92012755e8d.
  15. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this exactly (proved).

    Having derived a contradiction by assuming an arbitrary map f is surjective, we conclude that no map from A to 𝒫(A) is surjective.

    Show in article · Read it in context on Wikipedia

    Function.cantor_surjective exact match

    theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 374–376

    Note: Mathlib writes the collection of subsets of A as the type of its subsets, and the declaration quantifies over all maps from A into that collection.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b4c28d932cd4 · pair key 1dbb8ba8bd27.
  16. Theorem · supporting · Proof

    Formalized

    Formalized: Mathlib states a more general result (proved).

    However, there exist injections from A to 𝒫(A), for instance g : x ↦ {x}.

    Show in article · Read it in context on Wikipedia

    Set.singleton_injective more general

    theorem Set.singleton_injective {α : Type*} : Function.Injective Singleton.singleton

    Mathlib.Data.Set.Insert · lines 190–191

    Why more general: The declaration names the same map the passage exhibits and asserts its injectivity for every type, which yields the existence the passage claims.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 85cb08f0cbb7 · pair key 2ffb2570023c.
  17. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Consequently, card(A) < card(𝒫(A)). ■

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor close match

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why close, not exact: Mathlib writes the size of the collection of subsets of A as the cardinal two raised to the size of A, the indicator-function encoding of subsets, and Cardinal.mk_set identifies that cardinal with the size of the type of subsets of A.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key d2808831f2ce · pair key 449c03db1077.
  18. Definition · supporting · Proof

    Partial

    With community edits: Partial. As published it is Not formalized.

    Partial, by a community edit: Mathlib states part of this (proved).

    By definition of cardinality, we have card(X) < card(Y) for any two sets X and Y if and only if there is an injective function but no bijective function from X to Y.

    Show in article · Read it in context on Wikipedia

    Cardinal.le_def states part

    theorem Cardinal.le_def (α β : Type u) : Cardinal.mk α ≤ Cardinal.mk β ↔ Nonempty (α ↪ β)

    Mathlib.SetTheory.Cardinal.Order · lines 103–104

    Community Agent The pipeline said related; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.

    Why only part: Mathlib defines the order on cardinals by injections: Cardinal.le_def says the cardinality of α is at most that of β iff there is an injective function (embedding) from α to β, which covers the injection clause. Strict inequality is then "at most but not at least", and Cardinal.eq says two types have equal cardinality iff there is a bijection between them. Neither states the passage's combined form (an injection but no bijection), so this is partial.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key dfc8cd727dbd · pair key fbaf0fceec09.

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 2e7d9e932fc0).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  19. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this exactly (proved).

    This is the heart of Cantor's theorem: there is no surjective function from any set A to its power set.

    Show in article · Read it in context on Wikipedia

    Function.cantor_surjective exact match

    theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 374–376

    Note: In the library the type of subsets of A is the power set of A, so the denial of surjectivity here is the passage's assertion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0f845129718f · pair key 3b9f57b36ed3.
  20. Definition · main statement · Proof

    Not formalized
    Recalling that each f(x) is a subset of A, such a subset is given by the following construction, sometimes called the Cantor diagonal set of f:[1][2] B = {x ∈ A ∣ x ∉ f(x)}.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt fef426bad38d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  21. Theorem · supporting · Proof

    Not formalized
    This means, by definition, that for all x ∈ A, x ∈ B if and only if x ∉ f(x).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt 99f8f48bf67f).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  22. Theorem · supporting · Proof

    Not formalized
    For all x the sets B and f(x) cannot be equal because B was constructed from elements of A whose images under f did not include themselves.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 552af4d9aab4).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  23. Theorem · supporting · Proof

    Formalized

    Formalized: Lean core states a more general result (proved).

    For all x ∈ A either x ∈ f(x) or x ∉ f(x).

    Show in article · Read it in context on Wikipedia

    Classical.em more general

    theorem Classical.em (p : Prop) : p ∨ ¬p

    Init.Classical · lines 36–67

    Why more general: The declaration is stated for an arbitrary proposition where the passage has one particular membership assertion.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key 68c0f513c558 · pair key a769ae9d6c74.

    Decidable.or_not_self special case

    abbrev Decidable.or_not_self (p : Prop) [Decidable p] : p ∨ ¬p

    Init.PropLemmas · line 505

    Why a special case: The decidability requirement is met by those of the passage's cases where membership in f(x) can be decided, so this is the passage's dichotomy under an added hypothesis.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
    • Location key b75deedc22e7 · pair key bda2068ccd73.
  24. Theorem · supporting · Proof

    Not formalized
    If x ∈ f(x) then f(x) cannot equal B because x ∈ f(x) by assumption and x ∉ B by definition.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 4136fe09c676).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  25. Theorem · supporting · Proof

    Not formalized
    If x ∉ f(x) then f(x) cannot equal B because x ∉ f(x) by assumption and x ∈ B by the definition of B.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 03881e5eb730).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  26. Theorem · supporting · Proof

    Not formalized
    Equivalently, and slightly more formally, we have just proved that the existence of ξ ∈ A such that f(ξ) = B implies the following contradiction: ξ ∈ B⟺ ξ ∉ f(ξ)(by definition of B);ξ ∈ B⟺ ξ ∈ f(ξ)(by assumption that f(ξ) = B).

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 1 candidates examined (receipt 4cb1bb723116).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  27. Theorem · supporting · Proof

    Not formalized
    Thus there is no ξ ∈ A such that f(ξ) = B ; in other words, B is not in the image of f and f does not map onto every element of the power set of A, i.e., f is not surjective.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 74abef4b95df).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  28. Theorem · main statement · Proof

    Partial

    Partial: Mathlib states part of this (proved).

    Thus there is no ξ ∈ A such that f(ξ) = B; in other words, B is not in the image of f and f does not map onto every element of the power set of A, i.e., f is not surjective.

    Show in article · Read it in context on Wikipedia

    Function.cantor_surjective states part

    theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 374–376

    Why only part: Mathlib states it for a type standing for the article's set A, with the subsets of A collected as Set A.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5839e5305da8 · pair key 4ca81a470b50.
  29. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    The argument is now complete, and we have established the strict inequality for any set A that card(A) < card(𝒫(A)).

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor close match

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why close, not exact: Mathlib writes the size of the collection of subsets of A as two raised to the cardinal of A, the form Cardinal.mk_set equates with it.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cfe1628b55c0 · pair key 415f4d59cf3b.
  30. Theorem · supporting · Proof

    Formalized

    Formalized: Mathlib states a more general result (proved).

    For f to be onto, some element of A must map to B.

    Show in article · Read it in context on Wikipedia

    Function.Surjective.range_eq more general

    theorem Function.Surjective.range_eq {α : Type*} {ι : Sort*} {f : ι → α} : Function.Surjective f → Set.range f = Set.univ

    Mathlib.Data.Set.Image · line 600

    Why more general: Mathlib concludes that an onto map attains all of its codomain, and the passage reads that conclusion at the one subset it has built.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ad3cf1f718a1 · pair key 126ad62356b1.

    Set.range_eq_univ more general

    theorem Set.range_eq_univ {α : Type*} {ι : Sort*} {f : ι → α} : Set.range f = Set.univ ↔ Function.Surjective f

    Mathlib.Data.Set.Image · lines 597–598

    Why more general: Mathlib phrases being onto as the values of the map filling the whole codomain, which covers the subset the article builds.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ac317b37d0fa · pair key c5239e743317.
  31. Theorem · supporting · Proof

    Not formalized
    But that leads to a contradiction: no element of B can map to B because that would contradict the criterion of membership in B, thus the element mapping to B must not be an element of B meaning that it satisfies the criterion for membership in B, another contradiction.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 70ebc1ee85a1).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  32. Theorem · supporting · Proof

    Not formalized
    So the assumption that an element of A maps to B must be false; and f cannot be onto.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 1 candidates examined (receipt ffcc5a70f205).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  33. Theorem · main statement · Proof

    Formalized

    Formalized: Mathlib states this exactly (proved).

    So the assumption that an element of A maps to B must be false; and f cannot be onto.

    Show in article · Read it in context on Wikipedia

    Function.cantor_surjective exact match

    theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 374–376

    Note: Mathlib writes the subsets of A as the type Set A, and its Surjective is the passage's onto.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key fc685d246b1a · pair key a04faadd1adb.
  34. Construction · supporting · Proof

    Partial

    Partial: Mathlib states part of this (a definition).

    For a countable (or finite) set, the argument of the proof given above can be illustrated by constructing a table in which
    each row is labelled by a unique x from A = {x1, x2, …}, in this order. A is assumed to admit a linear order so that such table can be constructed. each column of the table is labelled by a unique y from the power set of A; the columns are ordered by the argument to f, i.e. the column labels are f(x1), f(x2), ..., in this order. the intersection of each row x and column y records a true/false bit whether x ∈ y.

    Show in article · Read it in context on Wikipedia

    Set.boolIndicator states part

    def Set.boolIndicator {α : Type*} : Set α → α → Bool

    Mathlib.Data.Set.BoolIndicator · lines 27–28

    Why only part: Mathlib fixes this membership bit for an arbitrary type and an arbitrary subset of it, while the passage uses it at the countable A and the column labels f(x1), f(x2), and so on.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key b969769ab7c9 · pair key b4f6d1c29fe5.
  35. Definition · supporting · Proof

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Given the order chosen for the row and column labels, the main diagonal D of this table thus records whether x ∈ f(x) for each x ∈ A.

    Show in article · Read it in context on Wikipedia

    Matrix.diag more general

    def Matrix.diag {n : Type*} {α : Type v} : Matrix n n α → n → α

    Mathlib.Data.Matrix.Diagonal · lines 294–295

    Why more general: Mathlib takes the diagonal of any square indexed table over any entry type, and the passage's D is its value at the membership table built from f.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5100f7f413b2 · pair key 7dacb92f51db.
  36. Theorem · supporting · Proof

    Partial

    Partial: Mathlib states a special case (proved).

    …f(x1)f(x2)f(x3)f(x4)⋯hline x1TTFT⋯x2TFFF⋯x3FFTT⋯x4FTTT⋯⋮⋮⋮⋮⋮⋱ The set B constructed in the previous paragraphs coincides with the row labels for the subset of entries on this main diagonal D (which in above example, coloured red) where the table records that x ∈ f(x) is false.[3]

    Show in article · Read it in context on Wikipedia

    Set.preimage_boolIndicator_false special case

    theorem Set.preimage_boolIndicator_false {α : Type*} (s : Set α) : s.boolIndicator ⁻¹' {Bool.false} = sᶜ

    Mathlib.Data.Set.BoolIndicator · lines 41–42

    Why a special case: The declaration is the passage read at a constant f: the false cells of the row function for s cut out the complement of s, which is then the Cantor diagonal set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 28ccfb633ce2 · pair key c9d149f5265d.
  37. Theorem · supporting · Proof

    Not formalized
    Each row records the values of the indicator function of the set corresponding to the column.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt d36478314af7).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  38. Theorem · supporting · Proof

    Partial

    Partial: Mathlib states a special case (proved).

    The indicator function of B coincides with the logically negated (swap "true" and "false") entries of the main diagonal.

    Show in article · Read it in context on Wikipedia

    Set.preimage_boolIndicator_false special case

    theorem Set.preimage_boolIndicator_false {α : Type*} (s : Set α) : s.boolIndicator ⁻¹' {Bool.false} = sᶜ

    Mathlib.Data.Set.BoolIndicator · lines 41–42

    Why a special case: This is the passage at a constant map, with membership and its Bool record taken as two writings of one notion, so the identity of sets is the pointwise negation the passage states.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, low confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key cf4d4e16903a · pair key 82ee059bdc28.
  39. Theorem · supporting · Proof

    Not formalized
    Thus the indicator function of B does not agree with any column in at least one entry.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt edbe307f48b9).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  40. Theorem · supporting · Proof

    Not formalized
    Consequently, no column represents B.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 08804d22d300).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  41. Theorem · supporting · When A is countably infinite

    Partial

    Partial: Mathlib states part of this (proved).

    Indeed, 𝒫(ℕ) contains infinite subsets of ℕ, e.g. the set of all positive even numbers {2, 4, 6, …} = {2k : k ∈ ℕ}, along with the empty set ∅.

    Show in article · Read it in context on Wikipedia

    Set.infinite_range_of_injective states part

    theorem Set.infinite_range_of_injective {α : Type u} {β : Type v} [Infinite α] {f : α → β} : Function.Injective f → (Set.range f).Infinite

    Mathlib.Data.Set.Finite.Basic · lines 912–915

    Why only part: Lean's naturals begin at 0, so the doubled set also carries 0 where the article counts from 1; neither infinitude nor membership in the power set turns on that.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 90e71aeb15b1 · pair key 75e86dc9edf4.

    Set.powerset_univ states part

    theorem Set.powerset_univ {α : Type u} : 𝒫 Set.univ = Set.univ

    Mathlib.Data.Set.Basic · lines 1069–1070

    Why only part: It is written for an arbitrary type and the passage reads it at the naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 7b3f45fe1434 · pair key 609778618522.

    Set.infinite_univ states part

    theorem Set.infinite_univ {α : Type u} [h : Infinite α] : Set.univ.Infinite

    Mathlib.Data.Set.Finite.Basic · lines 839–840

    Why only part: It gives ℕ itself as the infinite member and says nothing about the even numbers the passage names as its illustration.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 3ada84dfe063 · pair key f2e5311d6251.
  42. Definition · supporting · When A is countably infinite

    Not formalized
    Let us call such numbers selfish.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 3004f2bfced4).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  43. Definition · supporting · When A is countably infinite

    Not formalized
    Call these numbers non-selfish.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt e7d4dfbd54be).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  44. Definition · supporting · When A is countably infinite

    Not formalized
    Let B be the set of all non-selfish natural numbers.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt 812b2b79c653).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  45. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    By definition, the power set 𝒫(ℕ) contains all sets of natural numbers, and so it contains this set B as an element.

    Show in article · Read it in context on Wikipedia

    Set.powerset_univ more general

    theorem Set.powerset_univ {α : Type u} : 𝒫 Set.univ = Set.univ

    Mathlib.Data.Set.Basic · lines 1069–1070

    Why more general: It is written for an arbitrary type, and the passage takes it at the naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key eb3c4c277a87 · pair key 24a31b2bc261.
  46. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    By definition, the power set 𝒫(ℕ) contains all sets of natural numbers, and so it contains this set B as an element.

    Show in article · Read it in context on Wikipedia

    Set.powerset_univ more general

    theorem Set.powerset_univ {α : Type u} : 𝒫 Set.univ = Set.univ

    Mathlib.Data.Set.Basic · lines 1069–1070

    Why more general: The declaration covers all sets of naturals at once, and the passage uses the one it calls B.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a1aac33f7d38 · pair key f522d890a999.
  47. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    If the mapping is bijective, B must be paired off with some natural number, say b.

    Show in article · Read it in context on Wikipedia

    Function.Bijective.surjective more general

    theorem Function.Bijective.surjective {α : Sort*} {β : Sort*} {f : α → β} : Function.Bijective f → Function.Surjective f

    Mathlib.Logic.Function.Basic · line 189

    Why more general: Obtaining the number paired with B is reading surjectivity at B, which needs no additional lemma.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 96da14ac6270 · pair key c8c5337d544a.
  48. Theorem · supporting · When A is countably infinite

    Not formalized
    If b is in B, then b is selfish because it is in the corresponding set, which contradicts the definition of B.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt 7956ed5ba7e1).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  49. Theorem · supporting · When A is countably infinite

    Not formalized
    If b is not in B, then it is non-selfish and it should instead be a member of B.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt edbd465600f0).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  50. Theorem · supporting · When A is countably infinite

    Not formalized
    Therefore, no such element b which maps to B can exist.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt e62b43ad8a19).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  51. Theorem · supporting · When A is countably infinite

    Not formalized
    Note that the set B may be empty.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 9bff4131bfac).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  52. Theorem · supporting · When A is countably infinite

    Not formalized
    This would mean that every natural number x maps to a subset of natural numbers that contains x.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 1f5e21006902).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  53. Theorem · supporting · When A is countably infinite

    Partial

    Partial: Mathlib states part of this (proved).

    Then, every number maps to a nonempty set and no number maps to the empty set.

    Show in article · Read it in context on Wikipedia

    Set.nonempty_of_mem states part

    theorem Set.nonempty_of_mem {α : Type u} {s : Set α} {x : α} : x ∈ s → s.Nonempty

    Mathlib.Data.Set.Basic · lines 353–354

    Why only part: The declaration is stated for an arbitrary type and an arbitrary set, and the passage uses it at ℕ with the paired subsets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 43e112ce9f94 · pair key f0ba300ef895.

    Set.Nonempty.ne_empty states part

    theorem Set.Nonempty.ne_empty {α : Type u} {s : Set α} : s.Nonempty → s ≠ ∅

    Mathlib.Data.Set.Basic · line 492

    Why only part: Stated for an arbitrary type and set; here it is used at ℕ and at the subsets the pairing assigns.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key f1a2d58be876 · pair key 13c97fe2225a.
  54. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    But the empty set is a member of 𝒫(ℕ) , so the mapping still does not cover 𝒫(ℕ).

    Show in article · Read it in context on Wikipedia

    Set.empty_subset more general

    theorem Set.empty_subset {α : Type u} (s : Set α) : ∅ ⊆ s

    Mathlib.Data.Set.Basic · lines 453–454

    Why more general: Mathlib encodes membership in the power set as containment (PD10), and states this for an arbitrary type and set where the passage fixes ℕ.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 2fdae0c1eb19 · pair key 575c87283d71.
  55. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    But the empty set is a member of 𝒫(ℕ), so the mapping still does not cover 𝒫(ℕ).

    Show in article · Read it in context on Wikipedia

    Function.cantor_surjective more general

    theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f

    Mathlib.Logic.Function.Basic · lines 374–376

    Why more general: Mathlib writes the collection of all sets of naturals as the type Set ℕ, and states the result for an arbitrary type in place of ℕ.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key faa0aa368301 · pair key 1ec234cbd33e.
  56. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    Through this proof by contradiction we have proven that the cardinality of ℕ and 𝒫(ℕ) cannot be equal.

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor more general

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why more general: Mathlib writes the cardinal of the power set of ℕ as two to the cardinal of ℕ, the same cardinal as that of Set ℕ (Cardinal.mk_set).

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 12454ca4cb4a · pair key edc718a3e024.
  57. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    We also know that the cardinality of 𝒫(ℕ) cannot be less than the cardinality of ℕ because 𝒫(ℕ) contains all singletons, by definition, and these singletons form a "copy" of ℕ inside of 𝒫(ℕ).

    Show in article · Read it in context on Wikipedia

    Cardinal.aleph0_le_continuum close match

    theorem Cardinal.aleph0_le_continuum : Cardinal.aleph0 ≤ Cardinal.continuum

    Mathlib.SetTheory.Cardinal.Continuum · lines 68–69

    Why close, not exact: Mathlib names the two cardinals aleph-null and the continuum, which are the counts of the naturals and of the sets of naturals.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4e8f3f3bb01b · pair key 30e07c3dcc89.

    Cardinal.aleph0_lt_continuum more general

    theorem Cardinal.aleph0_lt_continuum : Cardinal.aleph0 < Cardinal.continuum

    Mathlib.SetTheory.Cardinal.Continuum · lines 65–66

    Why more general: The declaration compares the very same two cardinals and rules out equality as well.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 8a2e82ece114 · pair key 0a5df975730c.

    Cardinal.cantor more general

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why more general: Mathlib writes the count of the subsets of a set as two raised to that set's cardinal.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 1d2853e917ff · pair key ab5a34582959.
  58. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    We also know that the cardinality of 𝒫(ℕ) cannot be less than the cardinality of ℕ because 𝒫(ℕ) contains all singletons, by definition, and these singletons form a "copy" of ℕ inside of 𝒫(ℕ).

    Show in article · Read it in context on Wikipedia

    Set.subset_univ more general

    theorem Set.subset_univ {α : Type u} (s : Set α) : s ⊆ Set.univ

    Mathlib.Data.Set.Basic · line 586

    Why more general: Mathlib expresses membership in a power set as inclusion in the ambient set, and this lemma covers every subset at once.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key e5edae8010f9 · pair key 35a28e733344.
  59. Theorem · supporting · When A is countably infinite

    Formalized

    Formalized: Mathlib states a more general result (proved).

    We also know that the cardinality of 𝒫(ℕ) cannot be less than the cardinality of ℕ because 𝒫(ℕ) contains all singletons, by definition, and these singletons form a "copy" of ℕ inside of 𝒫(ℕ).

    Show in article · Read it in context on Wikipedia

    Set.singleton_injective more general

    theorem Set.singleton_injective {α : Type*} : Function.Injective Singleton.singleton

    Mathlib.Data.Set.Insert · lines 190–191

    Why more general: Mathlib states the injectivity of the singleton map for an arbitrary type of elements.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key c3e9f9675aa7 · pair key 2d65f0b7a714.

    Set.powersetCard.ofSingleton more general

    def Set.powersetCard.ofSingleton {α : Type*} : α ≃ ↑(Set.powersetCard α 1)

    Mathlib.Data.Set.PowersetCard · lines 133–137

    Why more general: Mathlib records the one element subsets as finite sets and bundles the correspondence as an equivalence.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 95175e06b4d0 · pair key 8c529880b4d2.
  60. Theorem · main statement · When A is countably infinite

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    Therefore, only one possibility remains, and that is that the cardinality of 𝒫(ℕ) is strictly greater than the cardinality of ℕ, proving Cantor's theorem.

    Show in article · Read it in context on Wikipedia

    Cardinal.aleph0_lt_continuum close match

    theorem Cardinal.aleph0_lt_continuum : Cardinal.aleph0 < Cardinal.continuum

    Mathlib.SetTheory.Cardinal.Continuum · lines 65–66

    Why close, not exact: Mathlib names the count of the naturals aleph-null and the count of the sets of naturals the continuum.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 993b7f2df872 · pair key 90ef697086ab.

    Cardinal.cantor more general

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why more general: Mathlib writes the count of the subsets of a set as two raised to that set's cardinal.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 0ed159a9756f · pair key f1194cc8d42e.

    Cardinal.cantor' more general

    theorem Cardinal.cantor' (a : Cardinal) {b : Cardinal} : 1 < b → a < b ^ a

    Mathlib.SetTheory.Cardinal.Basic · lines 309–311

    Why more general: The declaration allows any base above one in place of the two that counts subsets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ff255cb74aa8 · pair key 09e5ace04974.
  61. Definition · main statement · Related paradoxes

    Not formalized
    Cantor's paradox is the name given to a contradiction following from Cantor's theorem together with the assumption that there is a set containing all sets, the universal set V.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt e5cb375fb93d).
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
  62. Theorem · main statement · Related paradoxes

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    By Cantor's theorem |𝒫(X)| > |X| for any set X.

    Show in article · Read it in context on Wikipedia

    Cardinal.cantor close match

    theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a

    Mathlib.SetTheory.Cardinal.Order · lines 335–340

    Why close, not exact: Mathlib writes the count of the subsets of a set as two raised to that set's cardinal, and its docstring names this Cantor's theorem.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 9ec439b84df5 · pair key 4f5d4bfd4833.

    Cardinal.cantor' more general

    theorem Cardinal.cantor' (a : Cardinal) {b : Cardinal} : 1 < b → a < b ^ a

    Mathlib.SetTheory.Cardinal.Basic · lines 309–311

    Why more general: The declaration permits any base above one where the passage uses the count of subsets.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key ede6b941816c · pair key 60946d3669f4.
  63. Theorem · supporting · Related paradoxes

    Not formalized
    On the other hand, all elements of 𝒫(V) are sets, and thus contained in V , therefore |𝒫(V)| ≤ |V|.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 9704b3d73a16).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  64. Theorem · supporting · Related paradoxes

    Not formalized
    On the other hand, all elements of 𝒫(V) are sets, and thus contained in V, therefore |𝒫(V)| ≤ |V|.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 3 candidates examined (receipt 9148d511d0bb).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  65. Definition · main statement · Related paradoxes

    Formalized

    Formalized: Mathlib states a more general result (a definition).

    Another paradox can be derived from the proof of Cantor's theorem by instantiating the function f with the identity function; this turns Cantor's diagonal set into what is sometimes called the Russell set of a given set A:[1] RA = { x ∈ A : x ∉ x }.

    Show in article · Read it in context on Wikipedia

    ZFSet.sep more general

    def ZFSet.sep : (ZFSet → Prop) → ZFSet → ZFSet

    Mathlib.SetTheory.ZFC.Basic · lines 366–374

    Why more general: Mathlib's separation construct is written with an arbitrary predicate parameter, and the passage's object is that construct at the self-non-membership predicate.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 5b5e778cb440 · pair key 192f777c55eb.
  66. Theorem · supporting · Related paradoxes

    Formalized

    Formalized: Mathlib states a more general result (proved).

    The proof of Cantor's theorem is straightforwardly adapted to show that assuming a set of all sets U exists, then considering its Russell set RU leads to the contradiction: RU ∈ RU ⟺ RU ∉ RU.

    Show in article · Read it in context on Wikipedia

    ZFSet.mem_sep more general

    theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y

    Mathlib.SetTheory.ZFC.Basic · lines 381–384

    Why more general: Mathlib states membership in a separated subset for an arbitrary predicate, and the passage's assumption that U holds every set is what collapses the right-hand conjunction to self-non-membership.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4393fb972d45 · pair key 7cd72c6dff94.
  67. Theorem · supporting · Related paradoxes

    Formalized

    Formalized: Mathlib states this up to a convention difference (proved).

    As a point of subtlety, the version of Russell's paradox we have presented here is actually a theorem of Zermelo;[4] we can conclude from the contradiction obtained that we must reject the hypothesis that RU∈U, thus disproving the existence of a set containing all sets.

    Show in article · Read it in context on Wikipedia

    ZFClass.univ_notCMem_univ close match

    theorem ZFClass.univ_notCMem_univ : ¬ZFClass.CMem Set.univ Set.univ

    Mathlib.SetTheory.ZFC.Class · line 71

    Why close, not exact: Mathlib writes the claim through classes, saying the class of all sets does not belong to the class of all sets, which is its encoding of the assertion that no set has every set among its elements.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 181247cf5575 · pair key 4fb6c5f21b6b.

    Class.univ_notMem_univ close match

    theorem Class.univ_notMem_univ : Class.univ ∉ Class.univ

    Deprecated at this commit, in favour of ZFClass.univ_notCMem_univ.

    Mathlib.SetTheory.ZFC.Class · lines 306–307

    Why close, not exact: This is the same claim in Mathlib's `Class` encoding, where membership of the class of all sets in itself stands for that class being a set.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key aa7a304f7198 · pair key a55ea894e7be.
  68. Theorem · supporting · Related paradoxes

    Formalized

    Formalized: Mathlib states a more general result (proved).

    This was possible because we have used restricted comprehension (as featured in ZFC) in the definition of RA above, which in turn entailed that RU ∈ RU ⟺ (RU ∈ U ∧ RU ∉ RU).

    Show in article · Read it in context on Wikipedia

    ZFSet.mem_sep more general

    theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y

    Mathlib.SetTheory.ZFC.Basic · lines 381–384

    Why more general: This is Mathlib's membership rule for a set carved out of another by a predicate, which is the restricted comprehension the passage says it used.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key a6745a2e7b25 · pair key a1b633787e6a.
  69. Theorem · supporting · Related paradoxes

    Not formalized
    Had we used unrestricted comprehension (as in Frege's system for instance) by defining the Russell set simply as R = { x : x ∉ x }, then the axiom system itself would have entailed the contradiction, with no further hypotheses needed.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 2 candidates examined (receipt f80537d560e6).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  70. Theorem · supporting · History

    Not formalized
    He showed that if f is a function defined on X whose values are 2-valued functions on X, then the 2-valued function G(x) = 1 − f(x)(x) is not in the range of f.

    Show in article · Read it in context on Wikipedia

    Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).

    Details
    • Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 1 candidates examined (receipt bcb964e64ad2).
    • Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
  71. Theorem · main statement · Generalizations

    Partial

    Partial: Mathlib states a special case (proved).

    Lawvere's fixed-point theorem provides for a broad generalization of Cantor's theorem to any category with finite products in the following way:[8] let 𝒞 be such a category, and let 1 be a terminal object in 𝒞. Suppose that Y is an object in 𝒞 and that there exists an endomorphism α : Y → Y that does not have any fixed points; that is, there is no morphism y : 1 → Y that satisfies α ∘ y = y. Then there is no object T of 𝒞 such that a morphism f : T × T → Y can parameterize all morphisms T → Y.

    Show in article · Read it in context on Wikipedia

    Function.exists_fixed_point_of_surjective special case

    theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x

    Mathlib.Logic.Function.Basic · lines 367–370

    Why a special case: Its docstring presents it as Lawvere's fixed-point theorem applied to the category of types and functions, one category of the kind the passage speaks about.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 4d33431d2436 · pair key 3e20148a458a.
  72. Theorem · supporting · Generalizations

    Partial

    Partial: Mathlib states a special case (proved).

    In other words, for every object T and every morphism f : T × T → Y, an attempt to write maps T → Y as maps of the form f(−, x) : T → Y must leave out at least one map T → Y.

    Show in article · Read it in context on Wikipedia

    Function.exists_fixed_point_of_surjective special case

    theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x

    Mathlib.Logic.Function.Basic · lines 367–370

    Why a special case: The passage restates Lawvere's theorem for any category with finite products, and this lemma is that restatement in types and functions, where surjectivity of the curried family is the failure to leave a map out.

    Details
    • Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
    • Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
    • Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
    • Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
    • Location key 956d3f959266 · pair key b1feb29f814f.

Data: view model (JSON) · Literature Links records (JSONL)