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 all
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.
Related, but states something else (2)
Cardinal. mk_set related
theorem Cardinal.mk_set {α : Type u} : Cardinal.mk (Set α) = 2 ^ Cardinal.mk α
Mathlib.SetTheory.Cardinal.Order · lines 261–262
How it differs: This records only that the type of subsets of A has size two raised to the size of A, with no comparison of the 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 3dfb8e2. Location key c9972b77bd98 · pair key f171a180cfae.
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It denies surjectivity of every map into the power set; turning that into a strict comparison of sizes needs the singleton injection and comparability 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 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 066814aa7eca · pair key 922eb39c109a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Set. ncard_powerset related
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
How it differs: It counts the subsets of a finite set but makes no comparison with the number of 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 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 da98088a29cc · pair key 4d66261e2920.
Nat. lt_two_pow_self related
theorem Nat.lt_two_pow_self {n : Nat} : n < 2 ^ n
Init.Data.Nat.Lemmas · lines 1258–1259
How it differs: It is a numeric inequality about ℕ and mentions neither sets nor 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, 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 d86deceda397 · pair key 39fba9e4c6ec.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Cardinal. mk_int related
theorem Cardinal.mk_int : Cardinal.mk ℤ = Cardinal.aleph0
Mathlib.SetTheory.Cardinal.Basic · lines 597–598
How it differs: It fixes the size of ℤ as ℵ₀ but says nothing about the reals or about power sets.
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. 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 c3da58b9c904 · pair key 3768a26392d2.
Cardinal. mk_set_nat related
theorem Cardinal.mk_set_nat : Cardinal.mk (Set ℕ) = Cardinal.continuum
Mathlib.SetTheory.Cardinal.Continuum · line 77
How it differs: It identifies the size of the power set of ℕ with the continuum, with the reals nowhere mentioned.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 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 d4bf822758bf · pair key 3f320c0be265.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (3)
Cardinal. beth_succ related
theorem Cardinal.beth_succ (o : Ordinal) : Cardinal.beth (Order.succ o) = 2 ^ Cardinal.beth o
Deprecated at this commit, in favour of Cardinal. beth_add_one .
Mathlib.SetTheory.Cardinal.Aleph · lines 709–710
How it differs: It records the successor step of the hierarchy as two raised to the previous cardinal but asserts no inequality.
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 7396d14ba8b7 · pair key ea0e75dfecef.
Cardinal. cantor related
theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a
Mathlib.SetTheory.Cardinal.Order · lines 335–340
How it differs: It gives one step of the ascent but does not itself build the endless hierarchy the passage asserts.
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 1096715e8819 · pair key 57e4d8bccfbe.
Cardinal. aleph0_le_beth related
theorem Cardinal.aleph0_le_beth (o : Ordinal) : Cardinal.aleph0 ≤ Cardinal.beth o
Mathlib.SetTheory.Cardinal.Aleph · lines 721–722
How it differs: It only records that every stage of the hierarchy is at least countably infinite.
Details Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 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 f156d126df47 · pair key d032cd0dae3f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Function. cantor_injective related
theorem Function.cantor_injective {α : Type*} (f : Set α → α) : ¬Function.Injective f
Mathlib.Logic.Function.Basic · lines 380–382
How it differs: It denies injectivity of maps running the other way, from the power set back into the 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 8b5a82d58562 · pair key 06ba5995b205.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Cardinal. mk_powerset related
theorem Cardinal.mk_powerset {α : Type u} (s : Set α) : Cardinal.mk ↑(𝒫 s) = 2 ^ Cardinal.mk ↑s
Mathlib.SetTheory.Cardinal.Order · lines 266–267
How it differs: This is the identification of the cardinality of the power set with the exponential cardinal; it links the two encodings but asserts no inequality.
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 1aab36da95c3 · pair key 30d0270271c2.
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It denies surjectivity of maps into the power set rather than comparing the two cardinalities, so it is the input to the passage and not the passage.
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 423a4507fbad · pair key 01bb35043813.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
ZFSet. mem_sep related
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
How it differs: It records the membership criterion of a separated set rather than asserting that the passage's B is formed.
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 7f1a9424454e · pair key bbe30bdef596.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (2)
Set. mem_powerset related
theorem Set.mem_powerset {α : Type u} {x s : Set α} : x ⊆ s → x ∈ 𝒫 s
Mathlib.Data.Set.Basic · line 1043
How it differs: It unfolds what membership in the power set means for an arbitrary subset, and reaches the passage's assertion only once the subset fact about B is supplied from elsewhere.
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 89957380397d · pair key 90bb79c56a07.
ZFSet. mem_powerset related
theorem ZFSet.mem_powerset {x y : ZFSet} : y ∈ x.powerset ↔ y ⊆ x
Mathlib.SetTheory.ZFC.Basic · lines 413–414
How it differs: The same unfolding in the ZF setting, stated as an equivalence between membership in the power set and inclusion.
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 36433345d96e · pair key c276c0634eb6.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Function.Surjective. range_eq related
theorem Function.Surjective.range_eq {α : Type*} {ι : Sort*} {f : ι → α} : Function.Surjective f → Set.range f = Set.univ
Mathlib.Data.Set.Image · line 600
How it differs: It rephrases surjectivity as the range being everything, without naming a preimage of a given element.
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 861eeff55514 · pair key 98ee534208cd.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Function. exists_fixed_point_of_surjective related
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
How it differs: This is the fixed-point form of the diagonal argument for a parameterised family of maps; getting from it to the passage needs the self-map on truth values and its lack of a fixed point.
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 f8ee16057a67 · pair key 7a20b47fefc7.
Function. cantor_injective related
theorem Function.cantor_injective {α : Type*} (f : Set α → α) : ¬Function.Injective f
Mathlib.Logic.Function.Basic · lines 380–382
How it differs: It denies injectivity of maps in the other direction, from the subsets of A into A, which is a different 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 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 a204a008f260 · pair key 6f123996141b.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
ZFSet. singleton_injective related
theorem ZFSet.singleton_injective : Function.Injective Singleton.singleton
Mathlib.SetTheory.ZFC.Basic · lines 502–504
How it differs: The ZF version of the same fact, stated for all sets rather than for the members of one 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, medium confidence. Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack, which downgraded it. 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 6958526ca95e · pair key 6e3e86c28cd9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · main statement · Proof ✓ Formalized
Formalized: Mathlib states this up to a convention difference (proved).
Consequently, card(A ) < card(𝒫(A )) . ■ Show all
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.
Related, but states something else (1)
Cardinal. mk_set related
theorem Cardinal.mk_set {α : Type u} : Cardinal.mk (Set α) = 2 ^ Cardinal.mk α
Mathlib.SetTheory.Cardinal.Order · lines 261–262
How it differs: This records the identification the rank one card relies on, between the size of the type of subsets and the cardinal two raised to the size of the base.
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 061e50cdb070 · pair key d989b4c48fe8.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Cardinal. eq related
theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)
Mathlib.SetTheory.Cardinal.Defs · lines 115–116
How it differs: It characterises equality of two cardinals by the existence of an equivalence, which is a different assertion from the passage's criterion for the strict inequality.
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 38c038c6dd27 · pair key db1e837b65ec.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Function. exists_fixed_point_of_surjective related
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
How it differs: This is the fixed-point statement underlying the diagonal argument; reaching the passage from it needs the further fact that negation of propositions fixes nothing.
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 6ee54000579a · pair key 7e1728e5e9f5.
Function. cantor_injective related
theorem Function.cantor_injective {α : Type*} (f : Set α → α) : ¬Function.Injective f
Mathlib.Logic.Function.Basic · lines 380–382
How it differs: It denies injectivity for maps running the other way, from the subsets of a type into the type, which is a different 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 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 db19ddb8d56b · pair key ba8e4b014258.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: Its proof uses the construction the passage introduces, but the statement names no set and asserts the denial of surjectivity instead.
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 3cca9280ba28 · pair key 9aa4d3836cae.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Proof ✕ Not formalized
This means, by definition, that for all x ∈ A , x ∈ B if and only if x ∉ f (x ) . Show all
✕ 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.
Related, but states something else (1)
Set. mem_setOf_eq related
theorem Set.mem_setOf_eq {α : Type u} {x : α} {p : α → Prop} : (x ∈ {y | p y}) = p x
Deprecated at this commit, in favour of Set. mem_ofPred_eq .
Mathlib.Data.Set.Operations · line 80
How it differs: It is the library's unfolding rule for membership in a set given by a predicate, restating what the passage's term means rather than asserting the passage's criterion about this construction.
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 ec4e21109464 · pair key 594b6f862d88.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Membership.mem. ne_of_notMem' related
theorem Membership.mem.ne_of_notMem' {α : Type*} {β : Type*} [Membership α β] {s t : β} {a : α} : a ∈ s → a ∉ t → s ≠ t
Mathlib.Basic.Logic.Basic · line 1036
How it differs: It yields the inequality of two sets from a witness inside one and outside the other, and reaching the passage from it still needs a case split together with the membership criterion of the construction.
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 e520049884e9 · pair key edf156fb7b45.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Membership.mem. ne_of_notMem' related
theorem Membership.mem.ne_of_notMem' {α : Type*} {β : Type*} [Membership α β] {s t : β} {a : α} : a ∈ s → a ∉ t → s ≠ t
Mathlib.Basic.Logic.Basic · line 1036
How it differs: Applied at the element x it would give the inequality, but it first demands that x be outside the construction, which the passage derives from the membership criterion by a separate step.
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 bd5ddf2ba51b · pair key 061e23fdda1a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
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 3d2ddcbe7fa1 · pair key 52d760ec452a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Set. mem_setOf_eq related
theorem Set.mem_setOf_eq {α : Type u} {x : α} {p : α → Prop} : (x ∈ {y | p y}) = p x
Deprecated at this commit, in favour of Set. mem_ofPred_eq .
Mathlib.Data.Set.Operations · line 80
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 6cab990b283e · pair key b99f01dc6c1d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
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 15accbb9c87c · pair key 07b30551093f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Function. exists_fixed_point_of_surjective related
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
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 ac1d562837de · pair key 92004d7f22b9.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Cardinal. mk_set related
theorem Cardinal.mk_set {α : Type u} : Cardinal.mk (Set α) = 2 ^ Cardinal.mk α
Mathlib.SetTheory.Cardinal.Order · lines 261–262
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 60e90b44f5d0 · pair key e41ec9dd9e08.
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
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 94af388014df · pair key ba45eb45e8ee.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
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 ffcb45f49a49 · pair key ab0ea126b121.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
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 95febc9e07ae · pair key c2f2a4cd6802.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Function. exists_fixed_point_of_surjective related
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
How it differs: The Lawvere fixed point form of the same diagonal argument, for a map parameterising functions into an arbitrary codomain.
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 b2304c54d88d · pair key c66cde71d28e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 = {x 1 , x 2 , …} , 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 (x 1 ), f (x 2 ) , ..., in this order. the intersection of each row x and column y records a true/false bit whether x ∈ y . Show all
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.
Related, but states something else (1)
Set. mem_iff_boolIndicator related
theorem Set.mem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∈ s ↔ s.boolIndicator x = Bool.true
Mathlib.Data.Set.BoolIndicator · lines 30–32
How it differs: A membership unfolding lemma for the Bool record, restating what that record means at one set and one point.
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 d6b90048d191 · pair key 65889876fe33.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Set. boolIndicator related
def Set.boolIndicator {α : Type*} : Set α → α → Bool
Mathlib.Data.Set.BoolIndicator · lines 27–28
How it differs: The Bool valued membership record whose values the cells along that diagonal carry.
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 1db649a3a555 · pair key 26413e781f91.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Proof ◔ Partial
Partial: Mathlib states a special case (proved).
…f (x 1 )f (x 2 )f (x 3 )f (x 4 )⋯ hline x 1 T T F T ⋯ x 2 T F F F ⋯ x 3 F F T T ⋯ x 4 F T T T ⋯ ⋮ ⋮ ⋮ ⋮ ⋮ ⋱ 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 all
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.
Related, but states something else (1)
Set. notMem_iff_boolIndicator related
theorem Set.notMem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∉ s ↔ s.boolIndicator x = Bool.false
Mathlib.Data.Set.BoolIndicator · lines 34–36
How it differs: A non membership unfolding lemma for the Bool record at one fixed set and one point.
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 2bd3d4629779 · pair key 22e6fb65a721.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Proof ✕ Not formalized
Each row records the values of the indicator function of the set corresponding to the column. Show all
✕ 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).
Related, but states something else (1)
Set. mem_iff_boolIndicator related
theorem Set.mem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∈ s ↔ s.boolIndicator x = Bool.true
Mathlib.Data.Set.BoolIndicator · lines 30–32
How it differs: A membership unfolding lemma: it restates what the Bool record of one set at one point means.
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 27fafd9fb3f7 · pair key a7e42ad81872.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Set. notMem_iff_boolIndicator related
theorem Set.notMem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∉ s ↔ s.boolIndicator x = Bool.false
Mathlib.Data.Set.BoolIndicator · lines 34–36
How it differs: A non membership unfolding lemma for the Bool record of one set at one point.
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 79caa3444d1b · pair key 06b1f27b7121.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Proof ✕ Not formalized
Thus the indicator function of B does not agree with any column in at least one entry. Show all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It denies that any map from A into its subsets is onto, without naming the set that is missed.
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 e03c0c27d6ab · pair key cc10a1feb8fe.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Proof ✕ Not formalized
Consequently, no column represents B . Show all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It denies that a map from A into its subsets is onto, leaving unnamed the subset that no argument reaches.
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 9abe8ac6b60f · pair key 9b0c2f61a6ab.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · When A is countably infinite ✕ Not formalized
Let us call such numbers selfish. Show all
✕ 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · When A is countably infinite ✕ Not formalized
Call these numbers non-selfish. Show all
✕ 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · When A is countably infinite ✕ Not formalized
Let B be the set of all non-selfish natural numbers. Show all
✕ 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Set. mem_powerset_iff related
theorem Set.mem_powerset_iff {α : Type u} (x s : Set α) : x ∈ 𝒫 s ↔ x ⊆ s
Mathlib.Data.Set.Basic · lines 1048–1049
How it differs: It unfolds what membership in a power set means rather than asserting that every set of naturals is such a member.
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 d0a416745bbb · pair key f13f558bcddf.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Set. mem_powerset_iff related
theorem Set.mem_powerset_iff {α : Type u} (x s : Set α) : x ∈ 𝒫 s ↔ x ⊆ s
Mathlib.Data.Set.Basic · lines 1048–1049
How it differs: It states what power-set membership unfolds to and says nothing about the article's set 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 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 bcb09cdafad4 · pair key 11ea140f3d58.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It denies that any map into the power set is onto, which is a different assertion from the passage's conditional about 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 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 e8b329d35f44 · pair key 29ec9a311d1a.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: The packaged Cantor theorem never names the number paired with the diagonal set, so neither step of this case split appears in 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. 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 727113b9cda2 · pair key 6fc7f1407366.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · When A is countably infinite ✕ Not formalized
Therefore, no such element b which maps to B can exist. Show all
✕ 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).
Related, but states something else (1)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It says some subset escapes the map without identifying which one, while this sentence identifies the escaping 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 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 40fcb90e99e1 · pair key 29fb9b50a242.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · When A is countably infinite ✕ Not formalized
Note that the set B may be empty. Show all
✕ 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (1)
Set. eq_empty_iff_forall_notMem related
theorem Set.eq_empty_iff_forall_notMem {α : Type u} {s : Set α} : s = ∅ ↔ ∀ (x : α), x ∉ s
Mathlib.Data.Set.Basic · lines 460–461
How it differs: At the diagonal set it yields that no number fails to lie in its own paired set, and reaching the passage's positive conclusion still needs double-negation elimination, a named logical lemma (PD8).
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 25b1b3fc211c · pair key 8f0675c60a26.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Cardinal. mk_set_nat related
theorem Cardinal.mk_set_nat : Cardinal.mk (Set ℕ) = Cardinal.continuum
Mathlib.SetTheory.Cardinal.Continuum · line 77
How it differs: It is the declaration stated for ℕ itself, but it computes a value rather than comparing the two 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 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 84da5f8f7f15 · pair key 0047838aa2c3.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (1)
Set. mem_powerset_iff related
theorem Set.mem_powerset_iff {α : Type u} (x s : Set α) : x ∈ 𝒫 s ↔ x ⊆ s
Mathlib.Data.Set.Basic · lines 1048–1049
How it differs: This lemma only unfolds what membership in a power set means.
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 ec84b87e051e · pair key fad0560bc66e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Related, but states something else (2)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: It denies surjectivity of any map from a type to its sets and makes no cardinal comparison.
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 b7ae1b57f360 · pair key cf0256ce90c1.
ZFSet. card_powerset related
theorem ZFSet.card_powerset (x : ZFSet) : x.powerset.card = 2 ^ x.card
Mathlib.SetTheory.ZFC.Cardinal · lines 68–70
How it differs: It computes the cardinal of a pure set's power set as a power of 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 4 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 6a779951e586 · pair key 6c95439235ac.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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] R A = { x ∈ A : x ∉ x }. Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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: R U ∈ R U ⟺ R U ∉ R U . Show all
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.
Related, but states something else (1)
ZFClass. univ_notCMem_univ related
theorem ZFClass.univ_notCMem_univ : ¬ZFClass.CMem Set.univ Set.univ
Mathlib.SetTheory.ZFC.Class · line 71
How it differs: This records the conclusion drawn from the contradiction rather than the membership equivalence the passage exhibits.
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 84eb7a9f8a41 · pair key 9055dc4d4c9f.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 R U ∈ R U ⟺ (R U ∈ U ∧ R U ∉ R U ). Show all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
✕ 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).
Related, but states something else (2)
Function. cantor_surjective related
theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f
Mathlib.Logic.Function.Basic · lines 374–376
How it differs: Mathlib concludes that no map into the power set reaches everything, while the passage asserts of one named function that it is missed.
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 3aa07c488cfd · pair key 4f386662f399.
Function. exists_fixed_point_of_surjective related
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
How it differs: This turns a surjective two-argument family into a fixed point for each endofunction of the codomain, which again does not name a function outside the range.
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 17f3f1c8b0e9 · pair key e38a51fdf332.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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 all
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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗