{"assessment":{"class":"B","importance":"high"},"audit":{"blind":true,"ended":"2026-11-03T02:10:43.537Z","figures":[{"ci95":[0.4891,0.9935],"drawn":36,"id":"primary","label":"Strong links (exact, close or broad match) on supporting passages that have exactly the right relation","n_eff":5.1,"population":1029,"share":0.9234,"weights":"relation and library"},{"ci95":[0.3979,0.9202],"drawn":48,"id":"S2","label":"Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation","n_eff":8.1,"population":1740,"share":0.734,"weights":"relation and library"},{"ci95":[0.7268,0.9357],"drawn":44,"id":"CS","label":"Central and subject passages whose formalization status is right","n_eff":42.0,"population":1905,"share":0.8615,"weights":"recorded status"},{"ci95":[0.2519,0.8658],"drawn":12,"id":"S3","label":"'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it)","n_eff":6.1,"population":1236,"share":0.5957,"weights":"article"}],"independent":false,"items":224,"models":[{"model":"claude-opus-5-5","model_name":"Claude Opus 5.5"}],"operator":"jack","run_id":"tierA-batch1-audit","started":"2026-11-02T21:10:01.351Z"},"campaign":"run:loc-tierA-b1b+chal-tierA-b1","licence":{"mapping":"CC0-1.0","text":"CC-BY-SA-4.0"},"pageid":341442,"passages":[{"absence":null,"basis":"e8f0c97c62d64fbe98e462e2bd220a565cdfceea575515ebeff273690a398901","coverage":null,"id":"enwiki-341442-1356713544::In-text #b578e5d3","item":"In-text #b578e5d3","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"e8f0c97c62d64fbe98e462e2bd220a565cdfceea575515ebeff273690a398901","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"70c36034796e8427d92cf6ac1c5c6333c0982900197cdf1b13973bc7c2e2b4ba","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_set","end_line":262,"library":"mathlib","line":261,"location_key":"c9972b77bd9829648e0e3792b0a2eb4ae7b41891d7322f2089342c1c8200f3eb","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"f171a180cfae2e95b8899c1279263987a294c51d3d528b08a78a83316c48ce51","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_set {α : Type u} : Cardinal.mk (Set α) = 2 ^ Cardinal.mk α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"066814aa7ecaf317e67818ff141d3045b7cfe2a3584d10ca188672e0644214c1","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"922eb39c109ad9b4f1c3bd7c7730d75ff23b35f06981fd20460d98453c2c6cde","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"03faf03ab733676c4b11e2e6ad3eee3b8eda73275950ae7fa18c0c176b005c3e","prominence":"subject","quote":{"exact":"In mathematical set theory, Cantor's theorem is a fundamental result which states"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set A {\\displaystyle A} , the set of all subsets of A , {\\displaystyle A,} known as the power set of A , {\\displaystyle A,} has a strictly greater cardinality than A {\\displaystyle A} itself.","segments":[{"text":"In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set "},{"tex":"A"},{"text":" , the set of all subsets of "},{"tex":"A,"},{"text":" known as the power set of "},{"tex":"A,"},{"text":" has a strictly greater cardinality than "},{"tex":"A"},{"text":" itself."}]},"unresolved":null},{"absence":null,"basis":"3765db9e132f5d231a41ceea97157fff61f311bc22d6bfa9efa596950a4240e6","coverage":null,"id":"enwiki-341442-1356713544::In-text #4ca5d565","item":"In-text #4ca5d565","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.ncard_powerset","end_line":736,"library":"mathlib","line":732,"location_key":"3765db9e132f5d231a41ceea97157fff61f311bc22d6bfa9efa596950a4240e6","module":"Mathlib.Data.Set.Card","note":"The power set here collects every subset of s, the empty one and s itself included, matching the passage's count.","pair_key":"ccfa82677bd0ecdb07024f8d5021f73788754ae7747732ea5ac478cc3c7b694a","path":"Mathlib/Data/Set/Card.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.ncard_powerset {α : Type*} (s : Set α) : autoParam s.Finite Set.ncard_powerset._auto_1 → (𝒫 s).ncard = 2 ^ s.ncard"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Finset.card_powerset","end_line":103,"library":"mathlib","line":102,"location_key":"635f4131ec76983e4334e232c9411d5bf2f4da4ea0d2d774ba2d958612c1ed30","module":"Mathlib.Data.Finset.Powerset","note":"Finset.powerset enumerates every subset of s, the empty one among them.","pair_key":"1231c2bc8a2051076bab8613bc63a4d76cd76f840440d33ad91379246baf2be7","path":"Mathlib/Data/Finset/Powerset.lean","proof_status":"proved","rank":2,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Finset.card_powerset {α : Type*} (s : Finset α) : s.powerset.card = 2 ^ s.card"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Fintype.card_set","end_line":69,"library":"mathlib","line":68,"location_key":"99840e2a09e10beb73315dec0d2a60d4664763d4da538bf021a1056ffc874a0c","module":"Mathlib.Data.Fintype.Powerset","note":"Here the passage's set is carried by a type and its subsets by Set alpha, which includes the empty subset.","pair_key":"82456e4462d4a966069142610d4c6a264023770ae87bdd47d7055511366821b2","path":"Mathlib/Data/Fintype/Powerset.lean","proof_status":"proved","rank":3,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Fintype.card_set {α : Type*} [Fintype α] : Fintype.card (Set α) = 2 ^ Fintype.card α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b86f38c97f157bf501ff90cbbd273aef0e7dc95d30f60293e9a30b372f73c72e","prominence":"supporting","quote":{"exact":"Counting the empty set as a subset, a set with n {\\displaystyle"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":", and the theorem holds because 2 n > n {\\displaystyle 2^{n}>n} for all non-negative integers.","segments":[{"text":", and the theorem holds because "},{"tex":"2^{n}>n"},{"text":" for all non-negative integers."}]},"layer":"Counting the empty set as a subset, a set with n {\\displaystyle n} elements has a total of 2 n {\\displaystyle 2^{n}} subsets","segments":[{"text":"Counting the empty set as a subset, a set with "},{"tex":"n"},{"text":" elements has a total of "},{"tex":"2^{n}"},{"text":" subsets"}]},"unresolved":null},{"absence":null,"basis":"e7f8073c6c4648e03caf66912d10f81c3a255782d6310384e950cb1224c7e01e","coverage":null,"id":"enwiki-341442-1356713544::In-text #f9906c6e","item":"In-text #f9906c6e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"e7f8073c6c4648e03caf66912d10f81c3a255782d6310384e950cb1224c7e01e","module":"Mathlib.SetTheory.Cardinal.Order","note":"The declaration is stated for every cardinal, so it also covers the finite sets the passage restricts itself to.","pair_key":"f0c36b38b9f627f5e9c5769451811657c568608efbe61c77d831e523066c3eb2","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.ncard_powerset","end_line":736,"library":"mathlib","line":732,"location_key":"da98088a29cc9ae19e9d86f5619d997e3cf41da461237756743f6dab41ed9751","module":"Mathlib.Data.Set.Card","note":"It counts the subsets of a finite set but makes no comparison with the number of its elements.","pair_key":"4d66261e29202a8c80af6662e9e4ad5370bbd37eb2f557ee465be65f8d39c65c","path":"Mathlib/Data/Set/Card.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.ncard_powerset {α : Type*} (s : Set α) : autoParam s.Finite Set.ncard_powerset._auto_1 → (𝒫 s).ncard = 2 ^ s.ncard"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.lt_two_pow_self","end_line":1259,"library":"lean-core","line":1258,"location_key":"d86deceda39784576971c2cf7633283d24296a3ce6bc4051595ec01e1d414310","module":"Init.Data.Nat.Lemmas","note":"It is a numeric inequality about ℕ and mentions neither sets nor subsets.","pair_key":"39fba9e4c6ec96e0221a30e05b2de1722cbfe4538612553eb45c94b49919fdb0","path":"src/Init/Data/Nat/Lemmas.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lt_two_pow_self {n : Nat} : n < 2 ^ n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"574036869f8c65d83fc52e9967c3350a72355838610b500c8997a423c9e8d179","prominence":"central","quote":{"exact":"the theorem holds","prefix":"d "},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because 2 n > n {\\displaystyle 2^{n}>n} for all non-negative integers.","segments":[{"text":" because "},{"tex":"2^{n}>n"},{"text":" for all non-negative integers."}]},"before":{"layer":"Counting the empty set as a subset, a set with n {\\displaystyle n} elements has a total of 2 n {\\displaystyle 2^{n}} subsets, and ","segments":[{"text":"Counting the empty set as a subset, a set with "},{"tex":"n"},{"text":" elements has a total of "},{"tex":"2^{n}"},{"text":" subsets, and "}]},"layer":"the theorem holds","segments":[{"text":"the theorem holds"}]},"unresolved":null},{"absence":null,"basis":"085157dedf3755595c82d57756de6e7097f4187f5c708301f201c7e98ef78c6f","coverage":null,"id":"enwiki-341442-1356713544::In-text #539ae1f2","item":"In-text #539ae1f2","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.lt_two_pow_self","end_line":1259,"library":"lean-core","line":1258,"location_key":"085157dedf3755595c82d57756de6e7097f4187f5c708301f201c7e98ef78c6f","module":"Init.Data.Nat.Lemmas","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.","pair_key":"fa1ed7b46da339740af18a7eede95e1ccf3eeb7d71b70f1d15b01d7fd6cacc29","path":"src/Init/Data/Nat/Lemmas.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lt_two_pow_self {n : Nat} : n < 2 ^ n"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Nat.lt_pow_self","end_line":1256,"library":"lean-core","line":1253,"location_key":"7608d3721736428e3957cf62c730f318b89de1e7dbb8d549bc521063fd7b58c7","module":"Init.Data.Nat.Lemmas","note":"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.","pair_key":"4ed0dfce68c992e1ca930d423ec568aeddc1a3a2da1720bdb256497e2d5e21fd","path":"src/Init/Data/Nat/Lemmas.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Nat.lt_pow_self {n a : Nat} : 1 < a → n < a ^ n"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4ec0e8c71991ba6aa5f997c3fec2acf09f378d64573db699650f2e9327815ae3","prominence":"supporting","quote":{"exact":"2 n > n {\\displaystyle 2^{n}>n} for all non-negative integers."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"Counting the empty set as a subset, a set with n {\\displaystyle n} elements has a total of 2 n {\\displaystyle 2^{n}} subsets, and the theorem holds because ","segments":[{"text":"Counting the empty set as a subset, a set with "},{"tex":"n"},{"text":" elements has a total of "},{"tex":"2^{n}"},{"text":" subsets, and the theorem holds because "}]},"layer":"2 n > n {\\displaystyle 2^{n}>n} for all non-negative integers.","segments":[{"tex":"2^{n}>n"},{"text":" for all non-negative integers."}]},"unresolved":null},{"absence":null,"basis":"277cd9dabd64635f1f9c3d5565e61e576045da492c6c76ff4bd7255551c6ee98","coverage":null,"id":"enwiki-341442-1356713544::In-text #3023efd5","item":"In-text #3023efd5","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.mk_real","end_line":195,"library":"mathlib","line":185,"location_key":"277cd9dabd64635f1f9c3d5565e61e576045da492c6c76ff4bd7255551c6ee98","module":"Mathlib.Analysis.Real.Cardinality","note":"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.","pair_key":"cfd18a04d1aa990e35d858f511030c7f612e7f80f5d49eb2766b062f3bb2f04a","path":"Mathlib/Analysis/Real/Cardinality.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_real : Cardinal.mk ℝ = Cardinal.continuum"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.instUncountableReal","end_line":203,"library":"mathlib","line":201,"location_key":"f641dcaab171d523941443054913c38f02ebcebdad040b5b28dc58952ec2e0a9","module":"Mathlib.Analysis.Real.Cardinality","note":"The comparison it makes is against ℕ, where the passage names ℤ; Cardinal.mk_int is what carries one to the other.","pair_key":"6b31ff12c03817155bd45b8c953c90885dc04f0c62e84bee32c47bd219aee949","path":"Mathlib/Analysis/Real/Cardinality.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Cardinal.instUncountableReal : Uncountable ℝ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_int","end_line":598,"library":"mathlib","line":597,"location_key":"c3da58b9c904a2dc1227da88491229df5f2d01bf5bafb49a716603102ce1aa57","module":"Mathlib.SetTheory.Cardinal.Basic","note":"It fixes the size of ℤ as ℵ₀ but says nothing about the reals or about power sets.","pair_key":"3768a26392d20b55f109890c7970816312bcb3b2e1948696455d57e2c217bcca","path":"Mathlib/SetTheory/Cardinal/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_int : Cardinal.mk ℤ = Cardinal.aleph0"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_set_nat","end_line":77,"library":"mathlib","line":77,"location_key":"d4bf822758bf23db350ae4e4556e6b04d3ee8a4cdc257b6191cbd5d57238beb1","module":"Mathlib.SetTheory.Cardinal.Continuum","note":"It identifies the size of the power set of ℕ with the continuum, with the reals nowhere mentioned.","pair_key":"3f320c0be265384b1e6517e9a11a88d9b0ba357dd84209f43e6b73512df171f9","path":"Mathlib/SetTheory/Cardinal/Continuum.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_set_nat : Cardinal.mk (Set ℕ) = Cardinal.continuum"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7214d631e09465d20f976cb6bf433841297ec2bd8eb6ce00ae4cd8b539c4a12d","prominence":"supporting","quote":{"exact":"As a consequence, the cardinality of the real numbers, which is the"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"005522301a2e24a8d791a0ec9fe30009d0203d23fa86c85ba75210274782f6f4","coverage":null,"id":"enwiki-341442-1356713544::In-text #37563fb1","item":"In-text #37563fb1","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.beth_strictMono","end_line":687,"library":"mathlib","line":686,"location_key":"005522301a2e24a8d791a0ec9fe30009d0203d23fa86c85ba75210274782f6f4","module":"Mathlib.SetTheory.Cardinal.Aleph","note":"The starting point is fixed to be a countably infinite set, where the passage allows the iteration to begin at any infinite set.","pair_key":"a9350f2f9e338efd9b56bcac72085729c478c116e57341329d4c2551ebd48ede","path":"Mathlib/SetTheory/Cardinal/Aleph.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.beth_strictMono : StrictMono Cardinal.beth"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.beth_succ","end_line":710,"library":"mathlib","line":709,"location_key":"7396d14ba8b71874ad0238eafb6071d72ad12e439c20eb94932d249cc0eb5843","module":"Mathlib.SetTheory.Cardinal.Aleph","note":"It records the successor step of the hierarchy as two raised to the previous cardinal but asserts no inequality.","pair_key":"ea0e75dfecef172a029d5124992b00ad849e60a74944f12e2a60a52d4a56e478","path":"Mathlib/SetTheory/Cardinal/Aleph.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Cardinal.beth_add_one","elided":false,"text":"theorem Cardinal.beth_succ (o : Ordinal) : Cardinal.beth (Order.succ o) = 2 ^ Cardinal.beth o"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"1096715e881933a409fc1b8125db4463db5c63bf33e846f42371b3daca94587e","module":"Mathlib.SetTheory.Cardinal.Order","note":"It gives one step of the ascent but does not itself build the endless hierarchy the passage asserts.","pair_key":"57e4d8bccfbeb758a1fa58908f7f78f376d87709d4734d75eb787007daaf2437","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.aleph0_le_beth","end_line":722,"library":"mathlib","line":721,"location_key":"f156d126df47453f01d2c82d3121d98901d1fc2e2e40cee7800c485502bfab17","module":"Mathlib.SetTheory.Cardinal.Aleph","note":"It only records that every stage of the hierarchy is at least countably infinite.","pair_key":"d032cd0dae3f64c09e68b01c19f944273152ab04813dffdc6ca5810d639daf66","path":"Mathlib/SetTheory/Cardinal/Aleph.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.aleph0_le_beth (o : Ordinal) : Cardinal.aleph0 ≤ Cardinal.beth o"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f25484c3814651577a6361a97d8b1faff2f2913c956b3dff33e2ef86c1a7715a","prominence":"supporting","quote":{"exact":"For instance, by iteratively taking the power set of an infinite set"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"5c0e7874d349394713f03217fe84e068dead17e49b8947eb79cf7dca032d9600","coverage":null,"id":"enwiki-341442-1356713544::In-text #5e64c135","item":"In-text #5e64c135","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.instNoMaxOrder","end_line":342,"library":"mathlib","line":342,"location_key":"5c0e7874d349394713f03217fe84e068dead17e49b8947eb79cf7dca032d9600","module":"Mathlib.SetTheory.Cardinal.Order","note":"Mathlib records the fact as an order instance on the type of cardinals.","pair_key":"0eb0f5ba7e62247371ffaeab8706a422c2b8472c253aae8c8fe2b26d6f6d80bd","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"instance Cardinal.instNoMaxOrder : NoMaxOrder Cardinal"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"63282b41db1e22952382fbfb5c8e66b95c5d7dbb9f6168419bc2d2fd1f22456a","module":"Mathlib.SetTheory.Cardinal.Order","note":"It supplies an explicit bigger cardinal for each one, where the passage only denies a greatest.","pair_key":"87f209494883b2829e1523ca67ec9cce9bda490800967bf47a2f24a8a3a1314d","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"de2fdcf0a96c42d33b6c1b9006c569668a310b9bd3a6ea2119f27d0a569c438e","prominence":"supporting","quote":{"exact":"Consequently, the theorem implies that there is no largest cardinal number (colloquially,"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Consequently, the theorem implies that there is no largest cardinal number (colloquially, \"there's no largest infinity\").","segments":[{"text":"Consequently, the theorem implies that there is no largest cardinal number (colloquially, \"there's no largest infinity\")."}]},"unresolved":null},{"absence":null,"basis":"e4d389bd6521ee92346c9978acbd86717f5034053c87868354263a506b6de71f","coverage":null,"id":"enwiki-341442-1356713544::In-text #5c5b36ce","item":"In-text #5c5b36ce","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"e4d389bd6521ee92346c9978acbd86717f5034053c87868354263a506b6de71f","module":"Mathlib.Logic.Function.Basic","note":"Mathlib carries the passage's power set as the type of subsets of alpha.","pair_key":"801af48ddded7ca3be852c37ad18c1483a342fc6f27d6c6bc2eef9fbedc6d586","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_injective","end_line":382,"library":"mathlib","line":380,"location_key":"8b5a82d5856201d4b5b26442219e8cabbebc1cfe88a22e6dfaf5b3a3aab56920","module":"Mathlib.Logic.Function.Basic","note":"It denies injectivity of maps running the other way, from the power set back into the set.","pair_key":"06ba5995b205731f6b8f38227d0650f028032a661d46edf95f740c2c8463c212","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_injective {α : Type*} (f : Set α → α) : ¬Function.Injective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"bee5e070c98509927cac5ca088a047d70f43f2970c99b676957ad9b402ac38a3","prominence":"central","quote":{"exact":"Theorem (Cantor)—Let f {\\displaystyle f} be a map from set A {\\displaystyle"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Theorem (Cantor)—Let f {\\displaystyle f} be a map from set A {\\displaystyle A} to its power set P ( A ) {\\displaystyle {\\mathcal {P}}(A)} . Then f : A → P ( A ) {\\displaystyle f:A\\to {\\mathcal {P}}(A)} is not surjective.","segments":[{"text":"Theorem (Cantor)—Let "},{"tex":"f"},{"text":" be a map from set "},{"tex":"A"},{"text":" to its power set "},{"tex":"{\\mathcal {P}}(A)"},{"text":" . Then "},{"tex":"f:A\\to {\\mathcal {P}}(A)"},{"text":" is not surjective."}]},"unresolved":null},{"absence":null,"basis":"c162aaad152a0cf0439661d105e4136ba59f913b8fdc61f45c78f886278eedc9","coverage":null,"id":"enwiki-341442-1356713544::In-text #ee9defb7","item":"In-text #ee9defb7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"c162aaad152a0cf0439661d105e4136ba59f913b8fdc61f45c78f886278eedc9","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"0461a62bf93517f2a9f28df4fd7c967d47ecbc1bf0e3f5ce4f6bfdb60e58d6f7","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_powerset","end_line":267,"library":"mathlib","line":266,"location_key":"1aab36da95c33ed7f1fb2d9a42bbcbc1a68749d88c7b579d10ddfc2e9ec0390a","module":"Mathlib.SetTheory.Cardinal.Order","note":"This is the identification of the cardinality of the power set with the exponential cardinal; it links the two encodings but asserts no inequality.","pair_key":"30d0270271c2feeb6dd51ce22ce863974757609ed27723e8942d6d28a3ba8cce","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_powerset {α : Type u} (s : Set α) : Cardinal.mk ↑(𝒫 s) = 2 ^ Cardinal.mk ↑s"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"423a4507fbadbd7b1d93e8129f536ad02d9e61cb50c05a38275c39201db0adaa","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"01bb350438132601ad1e3184ae528daee0c73b8f1c496a705ec13df8aee06651","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8dd1079b4b01420f3d2b331806e7881fdd5659177bb04f45622e7b63d26fbf67","prominence":"central","quote":{"exact":"As a consequence, card ⁡ ( A ) < card ⁡ ("},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"As a consequence, card ⁡ ( A ) < card ⁡ ( P ( A ) ) {\\displaystyle \\operatorname {card} (A)<\\operatorname {card} ({\\mathcal {P}}(A))} holds for any set A {\\displaystyle A} .","segments":[{"text":"As a consequence, "},{"tex":"\\operatorname {card} (A)<\\operatorname {card} ({\\mathcal {P}}(A))"},{"text":" holds for any set "},{"tex":"A"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"518bdc64d1893c3fd7cf40575679add7c253da9696edff5de9520cfc8a3860ce","coverage":null,"id":"enwiki-341442-1356713544::In-text #22d96b6d","item":"In-text #22d96b6d","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZFSet.sep","end_line":374,"library":"mathlib","line":366,"location_key":"518bdc64d1893c3fd7cf40575679add7c253da9696edff5de9520cfc8a3860ce","module":"Mathlib.SetTheory.ZFC.Basic","note":"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.","pair_key":"c9d8d709c3b662a93cf1c2d92294eaadbf6ff3dc45d97c3e2148fea1b1726f3b","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ZFSet.sep : (ZFSet → Prop) → ZFSet → ZFSet"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFSet.mem_sep","end_line":384,"library":"mathlib","line":381,"location_key":"7f1a9424454e8ca09d284c4cf93d4ba7093827b339fab6f21d1d14d8becad066","module":"Mathlib.SetTheory.ZFC.Basic","note":"It records the membership criterion of a separated set rather than asserting that the passage's B is formed.","pair_key":"bbe30bdef5960c31e01b238095fb0c5dc25ee2f309f0bf720168f70839db6bc2","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"39c024d35cf0490968d5edddda296636aa3ad30d40dfc6e43e9920bcd1a2650a","prominence":"supporting","quote":{"exact":"The set B = { x ∈ A ∣ x ∉ f"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":", and B ∈ P ( A ) {\\displaystyle B\\in {\\mathcal {P}}(A)} because B ⊆ A {\\displaystyle B\\subseteq A} .","segments":[{"text":", and "},{"tex":"B\\in {\\mathcal {P}}(A)"},{"text":" because "},{"tex":"B\\subseteq A"},{"text":" ."}]},"layer":"The set B = { x ∈ A ∣ x ∉ f ( x ) } {\\displaystyle B=\\{x\\in A\\mid x\\notin f(x)\\}} exists via the axiom schema of specification","segments":[{"text":"The set "},{"tex":"B=\\{x\\in A\\mid x\\notin f(x)\\}"},{"text":" exists via the axiom schema of specification"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"ba15be7a00df2b3e0069553dcad4cf175732778ac8d904b2433243c4b9733941"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #b1172115","item":"In-text #b1172115","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.mem_powerset","end_line":1043,"library":"mathlib","line":1043,"location_key":"89957380397d4f6adaa5a134130d25b1084eb41e09ef36b76b46f5b80a07e50e","module":"Mathlib.Data.Set.Basic","note":"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.","pair_key":"90bb79c56a07b430efa1dc6ed897ed94d5dc9183ec2c256647a67596309bfde0","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_powerset {α : Type u} {x s : Set α} : x ⊆ s → x ∈ 𝒫 s"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZFSet.mem_powerset","end_line":414,"library":"mathlib","line":413,"location_key":"36433345d96ef3e6f218f1f7bb0fa73889f15669a67a54c45abcc68364e2c4f9","module":"Mathlib.SetTheory.ZFC.Basic","note":"The same unfolding in the ZF setting, stated as an equivalence between membership in the power set and inclusion.","pair_key":"c276c0634eb643a5c8dcc2de41ef4ab5a93f0c709cf74440370583d9f6d850a6","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.mem_powerset {x y : ZFSet} : y ∈ x.powerset ↔ y ⊆ x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0a29e26e1790574371fe7dd2678b11867760b9d0b19fc9da6848e476fc194290","prominence":"supporting","quote":{"exact":"B ∈ P ( A ) {\\displaystyle B\\in {\\mathcal {P}}(A)}"},"quote_capped":false,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because B ⊆ A {\\displaystyle B\\subseteq A} .","segments":[{"text":" because "},{"tex":"B\\subseteq A"},{"text":" ."}]},"before":{"layer":"The set B = { x ∈ A ∣ x ∉ f ( x ) } {\\displaystyle B=\\{x\\in A\\mid x\\notin f(x)\\}} exists via the axiom schema of specification, and ","segments":[{"text":"The set "},{"tex":"B=\\{x\\in A\\mid x\\notin f(x)\\}"},{"text":" exists via the axiom schema of specification, and "}]},"layer":"B ∈ P ( A ) {\\displaystyle B\\in {\\mathcal {P}}(A)}","segments":[{"tex":"B\\in {\\mathcal {P}}(A)"}]},"unresolved":null},{"absence":null,"basis":"a93010ee5af8463a5aff1a32b91be9930f18e9ab5ff46b92bb41ff615c6f7824","coverage":null,"id":"enwiki-341442-1356713544::In-text #b6b0cea7","item":"In-text #b6b0cea7","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFSet.sep_subset","end_line":391,"library":"mathlib","line":390,"location_key":"a93010ee5af8463a5aff1a32b91be9930f18e9ab5ff46b92bb41ff615c6f7824","module":"Mathlib.SetTheory.ZFC.Basic","note":"Stated for separation over an arbitrary predicate in the ZF development, which covers the particular predicate defining the passage's diagonal set.","pair_key":"e62e5bbe189a21d5c8b3f05ea8657ce7146102604b925c5002f0840fcbdf3084","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.sep_subset {x : ZFSet} {p : ZFSet → Prop} : ZFSet.sep p x ⊆ x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.sep_subset","end_line":989,"library":"mathlib","line":989,"location_key":"18195e87ea38ae372a1cb71ac17469af0ffbaeb764183764dde962eaf3d0cc67","module":"Mathlib.Data.Set.Basic","note":"The same inclusion in the type-theoretic set library, quantified over every predicate.","pair_key":"a6ba808ad4d21a3db95ba57098c29e5c169927a161f74190e289346255a792b4","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.sep_subset {α : Type u} (s : Set α) (p : α → Prop) : {x | x ∈ s ∧ p x} ⊆ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e5ab6b0e70332e2b779a754ee0f6461f3a34aed1d46d136dc4363a45db6e4788","prominence":"supporting","quote":{"exact":"B ⊆ A {\\displaystyle B\\subseteq A} ."},"quote_capped":false,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"The set B = { x ∈ A ∣ x ∉ f ( x ) } {\\displaystyle B=\\{x\\in A\\mid x\\notin f(x)\\}} exists via the axiom schema of specification, and B ∈ P ( A ) {\\displaystyle B\\in {\\mathcal {P}}(A)} because ","segments":[{"text":"The set "},{"tex":"B=\\{x\\in A\\mid x\\notin f(x)\\}"},{"text":" exists via the axiom schema of specification, and "},{"tex":"B\\in {\\mathcal {P}}(A)"},{"text":" because "}]},"layer":"B ⊆ A {\\displaystyle B\\subseteq A} .","segments":[{"tex":"B\\subseteq A"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"951f43d03dbaeaefde40fb269ed56182e63c3c575ab10926e01bc0ae9563da86","coverage":null,"id":"enwiki-341442-1356713544::In-text #1fd0a17f","item":"In-text #1fd0a17f","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Function.Surjective","end_line":63,"library":"lean-core","line":62,"location_key":"951f43d03dbaeaefde40fb269ed56182e63c3c575ab10926e01bc0ae9563da86","module":"Init.Data.Function","note":"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.","pair_key":"112e8abaeb462339dac958dbd38c4f81fad6e62337c0b9a2d402f99251e160f5","path":"src/Init/Data/Function.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def Function.Surjective {α : Sort u_1} {β : Sort u_2} : (α → β) → Prop"},"statement":true},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.Surjective.range_eq","end_line":600,"library":"mathlib","line":600,"location_key":"861eeff555142b5316165a9d5eb221299be63a69de6456ca49c9d6e62a0586e8","module":"Mathlib.Data.Set.Image","note":"It rephrases surjectivity as the range being everything, without naming a preimage of a given element.","pair_key":"98ee534208cd16534ed498b72a731c54b795975eabaa73408627ea2d574c0da4","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Surjective.range_eq {α : Type*} {ι : Sort*} {f : ι → α} : Function.Surjective f → Set.range f = Set.univ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"e5c312d6f4d4f833ed29c13f6abd85654fc240e58a951f053a76d643caa0dfea","prominence":"supporting","quote":{"exact":"Suppose towards a contradiction that f {\\displaystyle f} is surjective. Then there"},"quote_capped":true,"section":["Proof"],"status":"statement_only","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Suppose towards a contradiction that f {\\displaystyle f} is surjective. Then there exists a ξ ∈ A {\\displaystyle \\xi \\in A} such that f ( ξ ) = B {\\displaystyle f(\\xi )=B} .","segments":[{"text":"Suppose towards a contradiction that "},{"tex":"f"},{"text":" is surjective. Then there exists a "},{"tex":"\\xi \\in A"},{"text":" such that "},{"tex":"f(\\xi )=B"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"b1bfecb719fd2e91ab8e1b7f579e719afe8b82a188736659765ef19fa46b84a3","coverage":null,"id":"enwiki-341442-1356713544::In-text #81038296","item":"In-text #81038296","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZFSet.mem_sep","end_line":384,"library":"mathlib","line":381,"location_key":"b1bfecb719fd2e91ab8e1b7f579e719afe8b82a188736659765ef19fa46b84a3","module":"Mathlib.SetTheory.ZFC.Basic","note":"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.","pair_key":"324076f4e90580c2cc6f840697cd8f2b28f4b6228b3307a377da538d0d8e62f4","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.mem_sep_iff","end_line":980,"library":"mathlib","line":979,"location_key":"c8fb43f8aee6be981da11f2cbb208d7e7cfbe1077be127fa9c2e376afe4e1b79","module":"Mathlib.Data.Set.Basic","note":"The same membership criterion in the type-theoretic set library, over an arbitrary predicate.","pair_key":"e92012755e8dda5ae0392e27cf5296f22b0ee2e86b07ebfca567eac17df49151","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_sep_iff {α : Type u} {s : Set α} {p : α → Prop} {x : α} : x ∈ {x | x ∈ s ∧ p x} ↔ x ∈ s ∧ p x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"3a16fefb5326fa101121eca7fce02cae8189e3e13870b543c29e48212e6b9784","prominence":"supporting","quote":{"exact":"By the definition of B {\\displaystyle B} , we have ξ ∈"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"By the definition of B {\\displaystyle B} , we have ξ ∈ B {\\displaystyle \\xi \\in B} if and only if ξ ∉ f ( ξ ) = B {\\displaystyle \\xi \\notin f(\\xi )=B} .","segments":[{"text":"By the definition of "},{"tex":"B"},{"text":" , we have "},{"tex":"\\xi \\in B"},{"text":" if and only if "},{"tex":"\\xi \\notin f(\\xi )=B"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"b4c28d932cd4c3dd6a0bae80a7358936565c50556be33a457d498cbc368c6ab9","coverage":null,"id":"enwiki-341442-1356713544::In-text #d6fa82be","item":"In-text #d6fa82be","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"b4c28d932cd4c3dd6a0bae80a7358936565c50556be33a457d498cbc368c6ab9","module":"Mathlib.Logic.Function.Basic","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.","pair_key":"1dbb8ba8bd27edfea9d791dfc4896f018a647d9ddff1f613c0dbcd372222f694","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"f8ee16057a67b8eb31ca7e3812a6337af874c940fbd637cc366aaad3a94f9760","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"7a20b47fefc77df56d98ecc112c44c6efd5b8f294cf5e4f3b4411497d69e558f","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_injective","end_line":382,"library":"mathlib","line":380,"location_key":"a204a008f260dbdae2a60791974df13a84c79cab27f67f03e40136b2f7d71362","module":"Mathlib.Logic.Function.Basic","note":"It denies injectivity of maps in the other direction, from the subsets of A into A, which is a different assertion.","pair_key":"6f123996141b1b2b95b220fa160033cfec9e9327a69c6df1da637f7dc0949143","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_injective {α : Type*} (f : Set α → α) : ¬Function.Injective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"1e7075bcd4c768cf962a37eb53c16d83d540ce3aa41afe6ccb4d978122e90584","prominence":"central","quote":{"exact":"Having derived a contradiction by assuming an arbitrary map f {\\displaystyle f}"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Having derived a contradiction by assuming an arbitrary map f {\\displaystyle f} is surjective, we conclude that no map from A {\\displaystyle A} to P ( A ) {\\displaystyle {\\mathcal {P}}(A)} is surjective.","segments":[{"text":"Having derived a contradiction by assuming an arbitrary map "},{"tex":"f"},{"text":" is surjective, we conclude that no map from "},{"tex":"A"},{"text":" to "},{"tex":"{\\mathcal {P}}(A)"},{"text":" is surjective."}]},"unresolved":null},{"absence":null,"basis":"85cb08f0cbb78e0dd3ce8a50e76803cee0d1f17bcef497bd201d4c36c14ecf12","coverage":null,"id":"enwiki-341442-1356713544::In-text #b1eb1d6e","item":"In-text #b1eb1d6e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.singleton_injective","end_line":191,"library":"mathlib","line":190,"location_key":"85cb08f0cbb78e0dd3ce8a50e76803cee0d1f17bcef497bd201d4c36c14ecf12","module":"Mathlib.Data.Set.Insert","note":"The declaration names the same map the passage exhibits and asserts its injectivity for every type, which yields the existence the passage claims.","pair_key":"2ffb2570023ce9c71f3ac786a1c81a4d7a201c9b802553bdc212fe97d12d4c3e","path":"Mathlib/Data/Set/Insert.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.singleton_injective {α : Type*} : Function.Injective Singleton.singleton"},"statement":false},{"challenge":"downgraded","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZFSet.singleton_injective","end_line":504,"library":"mathlib","line":502,"location_key":"6958526ca95e398b33b6f57d9c095271dd6195b5297507e5c7c44ed85ede8748","module":"Mathlib.SetTheory.ZFC.Basic","note":"The ZF version of the same fact, stated for all sets rather than for the members of one set.","pair_key":"6e3e86c28cd91c58e1b46d0989f055449101b1554aba669a802c61c6d606729c","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.singleton_injective : Function.Injective Singleton.singleton"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"423d48cce93e971e43b480a25d4b7e02bad6b9a70ee2562c702af16ee62a98d3","prominence":"supporting","quote":{"exact":"However, there exist injections from A {\\displaystyle A} to P ( A"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"However, there exist injections from A {\\displaystyle A} to P ( A ) {\\displaystyle {\\mathcal {P}}(A)} , for instance g : x ↦ { x } {\\displaystyle g:x\\mapsto \\{x\\}} .","segments":[{"text":"However, there exist injections from "},{"tex":"A"},{"text":" to "},{"tex":"{\\mathcal {P}}(A)"},{"text":" , for instance "},{"tex":"g:x\\mapsto \\{x\\}"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"d2808831f2cef14196b6dfa78c487cc51411494d570891ff7b40408185c9a9ce","coverage":null,"id":"enwiki-341442-1356713544::In-text #35b9a33b","item":"In-text #35b9a33b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"d2808831f2cef14196b6dfa78c487cc51411494d570891ff7b40408185c9a9ce","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"449c03db1077a424fe219806122d3518e216cac6b75dfd8e4b030346a24bbb95","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_set","end_line":262,"library":"mathlib","line":261,"location_key":"061e50cdb070284330ccffb4f942445dfe71c333a45542215080353d09637144","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"d989b4c48fe8596f34188a8ec0bddacc2f0fa5607bcf07f54e90cfc757883db2","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_set {α : Type u} : Cardinal.mk (Set α) = 2 ^ Cardinal.mk α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"da7ff5810af6ab7de7e072221e59c9f53d295628671dad401cee6e1ed7a17e8c","prominence":"central","quote":{"exact":"Consequently, card ⁡ ( A ) < card ⁡ ( P ("},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Consequently, card ⁡ ( A ) < card ⁡ ( P ( A ) ) {\\displaystyle \\operatorname {card} (A)<\\operatorname {card} ({\\mathcal {P}}(A))} . ◼ {\\displaystyle \\blacksquare }","segments":[{"text":"Consequently, "},{"tex":"\\operatorname {card} (A)<\\operatorname {card} ({\\mathcal {P}}(A))"},{"text":" . "},{"tex":"\\blacksquare"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"2e7d9e932fc031a5593de8425483448cdc89e826a632e88b8e927fe387b8c0df"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #df310ac1","item":"In-text #df310ac1","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.le_def","end_line":104,"library":"mathlib","line":103,"location_key":"dfc8cd727dbda6a941890f220620fedc4e88eae8e32f3f6b920128ac1d46e9db","module":"Mathlib.SetTheory.Cardinal.Order","note":"It characterises the non-strict comparison of two cardinals by the existence of an embedding, and says nothing about bijections or about the strict comparison the passage characterises.","pair_key":"fbaf0fceec09507c20f5faa963534a237e832e499ced20af77b78ad379edc79a","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.le_def (α β : Type u) : Cardinal.mk α ≤ Cardinal.mk β ↔ Nonempty (α ↪ β)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.eq","end_line":116,"library":"mathlib","line":115,"location_key":"38c038c6dd278af8f57da3f963f5daa5c67695d1e7fb900d124bfd7dbb8912e4","module":"Mathlib.SetTheory.Cardinal.Defs","note":"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.","pair_key":"db1e837b65ec4cfaf1376771106f5e152ed139d60e8c5091eade9ec51dfc52a7","path":"Mathlib/SetTheory/Cardinal/Defs.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.eq {α β : Type u} : Cardinal.mk α = Cardinal.mk β ↔ Nonempty (α ≃ β)"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"8a3577cae57645e9cd50ffb77c9357226983c8a92d8b1f1761020ab40d715f59","prominence":"supporting","quote":{"exact":"By definition of cardinality, we have card ⁡ ( X ) <"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"By definition of cardinality, we have card ⁡ ( X ) < card ⁡ ( Y ) {\\displaystyle \\operatorname {card} (X)<\\operatorname {card} (Y)} for any two sets X {\\displaystyle X} and Y {\\displaystyle Y} if and only if there is an injective function but no bijective function from X {\\displaystyle X} to Y {\\displaystyle Y} .","segments":[{"text":"By definition of cardinality, we have "},{"tex":"\\operatorname {card} (X)<\\operatorname {card} (Y)"},{"text":" for any two sets "},{"tex":"X"},{"text":" and "},{"tex":"Y"},{"text":" if and only if there is an injective function but no bijective function from "},{"tex":"X"},{"text":" to "},{"tex":"Y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"0f845129718f3e57ab0de5f01fd6a80887d560596f05da8e6d851b195f274feb","coverage":null,"id":"enwiki-341442-1356713544::In-text #d36154a9","item":"In-text #d36154a9","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"0f845129718f3e57ab0de5f01fd6a80887d560596f05da8e6d851b195f274feb","module":"Mathlib.Logic.Function.Basic","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.","pair_key":"3b9f57b36ed31b35c1a272717eaee9bb5dc43c03fafd6e35541504136a308451","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"6ee54000579ac36337c28f97a459d2208f61c88c8cee70d96614c708f7fe1f41","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"7e1728e5e9f5681e0e8eb8d5a8441072b8927e5435f50f1a22cbf96d3b035be9","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_injective","end_line":382,"library":"mathlib","line":380,"location_key":"db19ddb8d56b108abb02f85054e3d03b1986fd903fbec1b22300c9c846648225","module":"Mathlib.Logic.Function.Basic","note":"It denies injectivity for maps running the other way, from the subsets of a type into the type, which is a different assertion.","pair_key":"ba8e4b0142586bc49507f9ea92b1134fb1961dff41d9cf39aa3897cab733cdba","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_injective {α : Type*} (f : Set α → α) : ¬Function.Injective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2d0d853c84d1eaf3745719de59ff641877e3db237e16b36343698dd4901b883d","prominence":"central","quote":{"exact":"This is the heart of Cantor's theorem: there is no surjective function"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"This is the heart of Cantor's theorem: there is no surjective function from any set A {\\displaystyle A} to its power set.","segments":[{"text":"This is the heart of Cantor's theorem: there is no surjective function from any set "},{"tex":"A"},{"text":" to its power set."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"fef426bad38d88e4972ad6011d3c1e2cbe63b16eda37640a523a5ee8f49b51b4"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #ae050b05","item":"In-text #ae050b05","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"3cca9280ba289160889508c96fe39fd1c3dc5895c255c8d69a585629fe45b168","module":"Mathlib.Logic.Function.Basic","note":"Its proof uses the construction the passage introduces, but the statement names no set and asserts the denial of surjectivity instead.","pair_key":"9aa4d3836cae7a97bf60f9f656ff60cade2094df832fbabd0bfd41378ccaee43","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b002e9bfebca2243ac1eac56b04864fc713538524bf6496062d935747c0bc15b","prominence":"central","quote":{"exact":"Recalling that each f ( x ) {\\displaystyle f(x)} is a subset"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Recalling that each f ( x ) {\\displaystyle f(x)} is a subset of A {\\displaystyle A} , such a subset is given by the following construction, sometimes called the Cantor diagonal set of f {\\displaystyle f} :[1][2] B = { x ∈ A ∣ x ∉ f ( x ) } . {\\displaystyle B=\\{x\\in A\\mid x\\not \\in f(x)\\}.}","segments":[{"text":"Recalling that each "},{"tex":"f(x)"},{"text":" is a subset of "},{"tex":"A"},{"text":" , such a subset is given by the following construction, sometimes called the Cantor diagonal set of "},{"tex":"f"},{"text":" :"},{"ref":"[1][2]"},{"text":" "},{"tex":"B=\\{x\\in A\\mid x\\not \\in f(x)\\}."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"99f8f48bf67f62b2c61c836b23ba1272a46fd35b4327fa2a0c2c56b182fdd54c"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #c2009cd0","item":"In-text #c2009cd0","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.mem_setOf_eq","end_line":80,"library":"mathlib","line":80,"location_key":"ec4e21109464430f67076e8a23a6012596f5c6779323e403772d8f1aff5d579a","module":"Mathlib.Data.Set.Operations","note":"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.","pair_key":"594b6f862d88a0878420b778484a2fbf9c6fc49d6b763f830af7541ff5c421d9","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Set.mem_ofPred_eq","elided":false,"text":"theorem Set.mem_setOf_eq {α : Type u} {x : α} {p : α → Prop} : (x ∈ {y | p y}) = p x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"70db5c351b40372811bcf5b0904a3a59bb54bc6242b2313b326cfaced2d8d933","prominence":"supporting","quote":{"exact":"This means, by definition, that for all x ∈ A {\\displaystyle x\\in"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"This means, by definition, that for all x ∈ A {\\displaystyle x\\in A} , x ∈ B {\\displaystyle x\\in B} if and only if x ∉ f ( x ) {\\displaystyle x\\notin f(x)} .","segments":[{"text":"This means, by definition, that for all "},{"tex":"x\\in A"},{"text":" , "},{"tex":"x\\in B"},{"text":" if and only if "},{"tex":"x\\notin f(x)"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"552af4d9aab4a2f34b6b3bbc32862bf1df5003ef528f4fce10018d1b6c2e16ae"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #a6754037","item":"In-text #a6754037","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Membership.mem.ne_of_notMem'","end_line":1036,"library":"mathlib","line":1036,"location_key":"e520049884e9158e4449b6e62b7ab1fb205e0367b843f5b9d63eb772b97a662a","module":"Mathlib.Basic.Logic.Basic","note":"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.","pair_key":"edf156fb7b450cfc0e422c29eefec79620036f5585a5e4a2e7a0cb1d4c12ae21","path":"Mathlib/Basic/Logic/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Membership.mem.ne_of_notMem' {α : Type*} {β : Type*} [Membership α β] {s t : β} {a : α} : a ∈ s → a ∉ t → s ≠ t"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"48dbe41b34838f280f0e1603ef7c117060830c4facf01aeed0aeaead95568bf2","prominence":"supporting","quote":{"exact":"For all x {\\displaystyle x} the sets B {\\displaystyle B} and f"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because B {\\displaystyle B} was constructed from elements of A {\\displaystyle A} whose images under f {\\displaystyle f} did not include themselves.","segments":[{"text":" because "},{"tex":"B"},{"text":" was constructed from elements of "},{"tex":"A"},{"text":" whose images under "},{"tex":"f"},{"text":" did not include themselves."}]},"layer":"For all x {\\displaystyle x} the sets B {\\displaystyle B} and f ( x ) {\\displaystyle f(x)} cannot be equal","segments":[{"text":"For all "},{"tex":"x"},{"text":" the sets "},{"tex":"B"},{"text":" and "},{"tex":"f(x)"},{"text":" cannot be equal"}]},"unresolved":null},{"absence":null,"basis":"68c0f513c558de0002d6a7d3d9a8eb1453ff1a3d67de5f81ff26462757268a4d","coverage":null,"id":"enwiki-341442-1356713544::In-text #7ca5d58b","item":"In-text #7ca5d58b","kind":"theorem","locations":[{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Classical.em","end_line":67,"library":"lean-core","line":36,"location_key":"68c0f513c558de0002d6a7d3d9a8eb1453ff1a3d67de5f81ff26462757268a4d","module":"Init.Classical","note":"The declaration is stated for an arbitrary proposition where the passage has one particular membership assertion.","pair_key":"a769ae9d6c74b3923332e50efed86e924e2785040afe68fe2624a7765eb726a2","path":"src/Init/Classical.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Classical.em (p : Prop) : p ∨ ¬p"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Decidable.or_not_self","end_line":505,"library":"lean-core","line":505,"location_key":"b75deedc22e79c9466b8b32d2b1eb93abe2910be2a0b32c8bb1b58421b1996e1","module":"Init.PropLemmas","note":"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.","pair_key":"bda2068ccd7301c8bb62fe73c8a3f84e9474c1f7f2b0372c693f81d134fc23f2","path":"src/Init/PropLemmas.lean","proof_status":"proved","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"abbrev Decidable.or_not_self (p : Prop) [Decidable p] : p ∨ ¬p"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b0fa47e6e2eddc11b6b9de753876a4f58b3c72100807a3882f1fdd85e813fdad","prominence":"supporting","quote":{"exact":"For all x ∈ A {\\displaystyle x\\in A} either x ∈ f"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"For all x ∈ A {\\displaystyle x\\in A} either x ∈ f ( x ) {\\displaystyle x\\in f(x)} or x ∉ f ( x ) {\\displaystyle x\\notin f(x)} .","segments":[{"text":"For all "},{"tex":"x\\in A"},{"text":" either "},{"tex":"x\\in f(x)"},{"text":" or "},{"tex":"x\\notin f(x)"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"4136fe09c6760f043b5d54e5aa77a984e7890780304ccb1e22f7af7981027bf0"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #cfc8acfe","item":"In-text #cfc8acfe","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Membership.mem.ne_of_notMem'","end_line":1036,"library":"mathlib","line":1036,"location_key":"bd5ddf2ba51b5008b3d670b03d41e3cc355120a70707f9d9bf58f55232ef568e","module":"Mathlib.Basic.Logic.Basic","note":"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.","pair_key":"061e23fdda1a1e675f8ef479bfcc3f2f4497024c522f39c31e37375f356ac968","path":"Mathlib/Basic/Logic/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Membership.mem.ne_of_notMem' {α : Type*} {β : Type*} [Membership α β] {s t : β} {a : α} : a ∈ s → a ∉ t → s ≠ t"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2ba5ff5876cb23e92a4b3db259afe8d5b324387e8e4462c202dd7ef2c25486c3","prominence":"supporting","quote":{"exact":"If x ∈ f ( x ) {\\displaystyle x\\in f(x)} then f"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because x ∈ f ( x ) {\\displaystyle x\\in f(x)} by assumption and x ∉ B {\\displaystyle x\\notin B} by definition.","segments":[{"text":" because "},{"tex":"x\\in f(x)"},{"text":" by assumption and "},{"tex":"x\\notin B"},{"text":" by definition."}]},"layer":"If x ∈ f ( x ) {\\displaystyle x\\in f(x)} then f ( x ) {\\displaystyle f(x)} cannot equal B {\\displaystyle B}","segments":[{"text":"If "},{"tex":"x\\in f(x)"},{"text":" then "},{"tex":"f(x)"},{"text":" cannot equal "},{"tex":"B"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"03881e5eb730797de19ba2467f10d2bda6438b0537b05d118e06fbcdd430c072"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #7278fe85","item":"In-text #7278fe85","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"3d2ddcbe7fa1aad85e234478db86d97a491d6bc67b1c9f72360107bfdd5c9e73","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"52d760ec452a7791570153fd8c3e580b08bef6cba870e3ff23dfb2df2784e977","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0e596b684c5c3a03805bf35aa2a3d088f0c058cff937364ff46a4eafcf55d7b9","prominence":"supporting","quote":{"exact":"If x ∉ f ( x ) {\\displaystyle x\\notin f(x)} then f"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because x ∉ f ( x ) {\\displaystyle x\\notin f(x)} by assumption and x ∈ B {\\displaystyle x\\in B} by the definition of B {\\displaystyle B} .","segments":[{"text":" because "},{"tex":"x\\notin f(x)"},{"text":" by assumption and "},{"tex":"x\\in B"},{"text":" by the definition of "},{"tex":"B"},{"text":" ."}]},"layer":"If x ∉ f ( x ) {\\displaystyle x\\notin f(x)} then f ( x ) {\\displaystyle f(x)} cannot equal B {\\displaystyle B}","segments":[{"text":"If "},{"tex":"x\\notin f(x)"},{"text":" then "},{"tex":"f(x)"},{"text":" cannot equal "},{"tex":"B"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":5,"sha256":"4cb1bb7231168d08fe4d2f5799bb10d767b3932e9d20269b86af9d18d4cf8414"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #70fd82b1","item":"In-text #70fd82b1","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.mem_setOf_eq","end_line":80,"library":"mathlib","line":80,"location_key":"6cab990b283e1553fd41e9021cf8fc46a8d8eefbefd99828d81b891713aae2e4","module":"Mathlib.Data.Set.Operations","note":null,"pair_key":"b99f01dc6c1d2a16bc277be852cdac65a1ff0e40fb44ec113230a5023f9e123c","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Set.mem_ofPred_eq","elided":false,"text":"theorem Set.mem_setOf_eq {α : Type u} {x : α} {p : α → Prop} : (x ∈ {y | p y}) = p x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"5b2a389674f32fcca279f153297764bc448641d336ff31eccfc76ce09934ccaa","prominence":"supporting","quote":{"exact":"Equivalently, and slightly more formally, we have just proved that the existence"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Equivalently, and slightly more formally, we have just proved that the existence of ξ ∈ A {\\displaystyle \\xi \\in A} such that f ( ξ ) = B {\\displaystyle f(\\xi )=B} implies the following contradiction: ξ ∈ B ⟺ ξ ∉ f ( ξ ) (by definition of B ) ; ξ ∈ B ⟺ ξ ∈ f ( ξ ) (by assumption that f ( ξ ) = B ) . {\\displaystyle {\\begin{aligned}\\xi \\in B&\\iff \\xi \\notin f(\\xi )&&{\\text{(by definition of }}B{\\text{)}};\\\\\\xi \\in B&\\iff \\xi \\in f(\\xi )&&{\\text{(by assumption that }}f(\\xi )=B{\\text{)}}.\\\\\\end{aligned}}}","segments":[{"text":"Equivalently, and slightly more formally, we have just proved that the existence of "},{"tex":"\\xi \\in A"},{"text":" such that "},{"tex":"f(\\xi )=B"},{"text":" implies the following contradiction: "},{"tex":"\\begin{aligned}\\xi \\in B&\\iff \\xi \\notin f(\\xi )&&{\\text{(by definition of }}B{\\text{)}};\\\\\\xi \\in B&\\iff \\xi \\in f(\\xi )&&{\\text{(by assumption that }}f(\\xi )=B{\\text{)}}.\\\\\\end{aligned}"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"74abef4b95df99a5362423d47fffd20941c9dbd8a9deeb8bb24b918e99e8c110"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #594bcaef","item":"In-text #594bcaef","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"15accbb9c87cce8a28736cd9ef03bc3730cc59b3f160ced60a14894e40fb022f","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"07b30551093fc622964eeeabd86ee94b13186dc1f7f3695475556559fc627c53","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d6d9fed09f0524d74289ff5d97e137ccf454721f1955cb7e8d414a03cf1c3521","prominence":"supporting","quote":{"exact":"Thus there is no ξ ∈ A {\\displaystyle \\xi \\in A} such"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" ; in other words, B {\\displaystyle B} is not in the image of f {\\displaystyle f} and f {\\displaystyle f} does not map onto every element of the power set of A {\\displaystyle A} , i.e., f {\\displaystyle f} is not surjective.","segments":[{"text":" ; in other words, "},{"tex":"B"},{"text":" is not in the image of "},{"tex":"f"},{"text":" and "},{"tex":"f"},{"text":" does not map onto every element of the power set of "},{"tex":"A"},{"text":" , i.e., "},{"tex":"f"},{"text":" is not surjective."}]},"layer":"Thus there is no ξ ∈ A {\\displaystyle \\xi \\in A} such that f ( ξ ) = B {\\displaystyle f(\\xi )=B}","segments":[{"text":"Thus there is no "},{"tex":"\\xi \\in A"},{"text":" such that "},{"tex":"f(\\xi )=B"}]},"unresolved":null},{"absence":null,"basis":"5839e5305da83a784e863f95e76eb7b41ed42f92cf57f2d648be0b25ee8f50e4","coverage":null,"id":"enwiki-341442-1356713544::In-text #a05caf50","item":"In-text #a05caf50","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"5839e5305da83a784e863f95e76eb7b41ed42f92cf57f2d648be0b25ee8f50e4","module":"Mathlib.Logic.Function.Basic","note":"Mathlib states it for a type standing for the article's set A, with the subsets of A collected as Set A.","pair_key":"4ca81a470b50217496443d9ecee7132c60a6998313c41fc9730647f2a2d98e97","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"ac1d562837defed3d334ccc2f0bb725ee9a5092923168ef7a3cc2fd85c804fef","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"92004d7f22b930d7b41546ef1fc08378b211151e3743a543f8be6f2276f74fd6","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c16f1a20dbf5a32364b924b2cccb8e5e18480f92fe5fa71ed42a387ec60b3ef9","prominence":"central","quote":{"exact":"in other words, B {\\displaystyle B} is not in the image of"},"quote_capped":true,"section":["Proof"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"Thus there is no ξ ∈ A {\\displaystyle \\xi \\in A} such that f ( ξ ) = B {\\displaystyle f(\\xi )=B} ; ","segments":[{"text":"Thus there is no "},{"tex":"\\xi \\in A"},{"text":" such that "},{"tex":"f(\\xi )=B"},{"text":" ; "}]},"layer":"in other words, B {\\displaystyle B} is not in the image of f {\\displaystyle f} and f {\\displaystyle f} does not map onto every element of the power set of A {\\displaystyle A} , i.e., f {\\displaystyle f} is not surjective.","segments":[{"text":"in other words, "},{"tex":"B"},{"text":" is not in the image of "},{"tex":"f"},{"text":" and "},{"tex":"f"},{"text":" does not map onto every element of the power set of "},{"tex":"A"},{"text":" , i.e., "},{"tex":"f"},{"text":" is not surjective."}]},"unresolved":null},{"absence":null,"basis":"cfe1628b55c0ecb951e928652358ca9bc421c248e9e69a64dcde98f2aee5cfb6","coverage":null,"id":"enwiki-341442-1356713544::In-text #cbcff10e","item":"In-text #cbcff10e","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"cfe1628b55c0ecb951e928652358ca9bc421c248e9e69a64dcde98f2aee5cfb6","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"415f4d59cf3bf87e63b4529b43cc2f7db87419a069eafe1b4228cf86cc83c384","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_set","end_line":262,"library":"mathlib","line":261,"location_key":"60e90b44f5d0ca5a56b4970ea462c128bd927c601eb8645c43a64c943dd99b3e","module":"Mathlib.SetTheory.Cardinal.Order","note":null,"pair_key":"e41ec9dd9e08d562f651246c5a4f0a043c2abdcd54ac75744d9dfbbb9ffd8982","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_set {α : Type u} : Cardinal.mk (Set α) = 2 ^ Cardinal.mk α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"94af388014df856b7d2f82e1a636b27241adea8f16a3f79c47f1838c987e7d34","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"ba45eb45e8ee4bf6aefc2d81a7b0132df6bfe2fc331cba1d5843425805c724e9","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c620ad5efdb7a34606471680df71f0340ba58c6a50187daa4076cf389ca360ff","prominence":"central","quote":{"exact":"we have established the strict inequality for any set A {\\displaystyle A}"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"The argument is now complete, and ","segments":[{"text":"The argument is now complete, and "}]},"layer":"we have established the strict inequality for any set A {\\displaystyle A} that card ⁡ ( A ) < card ⁡ ( P ( A ) ) {\\displaystyle \\operatorname {card} (A)<\\operatorname {card} ({\\mathcal {P}}(A))} .","segments":[{"text":"we have established the strict inequality for any set "},{"tex":"A"},{"text":" that "},{"tex":"\\operatorname {card} (A)<\\operatorname {card} ({\\mathcal {P}}(A))"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"ad3cf1f718a1b9c8d514ac7c26d2abab26999355ef9bac12576193e0ab05c432","coverage":null,"id":"enwiki-341442-1356713544::In-text #d55677e4","item":"In-text #d55677e4","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.Surjective.range_eq","end_line":600,"library":"mathlib","line":600,"location_key":"ad3cf1f718a1b9c8d514ac7c26d2abab26999355ef9bac12576193e0ab05c432","module":"Mathlib.Data.Set.Image","note":"Mathlib concludes that an onto map attains all of its codomain, and the passage reads that conclusion at the one subset it has built.","pair_key":"126ad62356b1ff4978fdc41db815427cfa27b66d9c3634d3ad7f5b2fe65b242b","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Surjective.range_eq {α : Type*} {ι : Sort*} {f : ι → α} : Function.Surjective f → Set.range f = Set.univ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.range_eq_univ","end_line":598,"library":"mathlib","line":597,"location_key":"ac317b37d0fab7930020554cbb151de7823b8397c612298fbec248a75654cee1","module":"Mathlib.Data.Set.Image","note":"Mathlib phrases being onto as the values of the map filling the whole codomain, which covers the subset the article builds.","pair_key":"c5239e743317fe4c8e708ae0c947c7f84081691d373bfa245d71d96cff3178e7","path":"Mathlib/Data/Set/Image.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.range_eq_univ {α : Type*} {ι : Sort*} {f : ι → α} : Set.range f = Set.univ ↔ Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a5a626ccf5ffa75a7e390f55563de0c993adc22b8cade43209bdbe4fbcc94787","prominence":"supporting","quote":{"exact":"For f {\\displaystyle f} to be onto, some element of A {\\displaystyle"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"For f {\\displaystyle f} to be onto, some element of A {\\displaystyle A} must map to B {\\displaystyle B} .","segments":[{"text":"For "},{"tex":"f"},{"text":" to be onto, some element of "},{"tex":"A"},{"text":" must map to "},{"tex":"B"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"70ebc1ee85a120516740251236d9f977f5a42a634775f422ecddf3b0df6cea60"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #3b42f828","item":"In-text #3b42f828","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"ffcb45f49a492543027aa032512b138ef040cbf77c9d37a4eeb966d0173c6edc","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"ab0ea126b1212289de1df43ad8614b88cf6f1d2eb3de757e548e2b35b6e73013","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"e77563d5a64b602803fbf90c93e57debc8352addcf7c06bd0d1a3cad503d7ec2","prominence":"supporting","quote":{"exact":"no element of B {\\displaystyle B} can map to B {\\displaystyle B}"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"But that leads to a contradiction: ","segments":[{"text":"But that leads to a contradiction: "}]},"layer":"no element of B {\\displaystyle B} can map to B {\\displaystyle B} because that would contradict the criterion of membership in B {\\displaystyle B} , thus the element mapping to B {\\displaystyle B} must not be an element of B {\\displaystyle B} meaning that it satisfies the criterion for membership in B {\\displaystyle B} , another contradiction.","segments":[{"text":"no element of "},{"tex":"B"},{"text":" can map to "},{"tex":"B"},{"text":" because that would contradict the criterion of membership in "},{"tex":"B"},{"text":" , thus the element mapping to "},{"tex":"B"},{"text":" must not be an element of "},{"tex":"B"},{"text":" meaning that it satisfies the criterion for membership in "},{"tex":"B"},{"text":" , another contradiction."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":3,"sha256":"ffcc5a70f20554113ff5b432a02266d19a7a3588b67a33c3ed6141d30e3fd528"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #5f42cc7c","item":"In-text #5f42cc7c","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"95febc9e07ae43b2cddf27399de1dbe4f10e71b435297337826e640fe091d004","module":"Mathlib.Logic.Function.Basic","note":null,"pair_key":"c2f2a4cd680247a84cc4491bf1acf4422fb0d11a38dbed3d176fb42f790a2c53","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"3594835cd8f013176f89ef0560150c495313fda1463b022a51a9f9314acab525","prominence":"supporting","quote":{"exact":"So the assumption that an element of A {\\displaystyle A} maps to"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":"; and f {\\displaystyle f} cannot be onto.","segments":[{"text":"; and "},{"tex":"f"},{"text":" cannot be onto."}]},"layer":"So the assumption that an element of A {\\displaystyle A} maps to B {\\displaystyle B} must be false","segments":[{"text":"So the assumption that an element of "},{"tex":"A"},{"text":" maps to "},{"tex":"B"},{"text":" must be false"}]},"unresolved":null},{"absence":null,"basis":"fc685d246b1ac9e22596b2fb12dc95425a0615a0b96d6775866e60d9256b0ed8","coverage":null,"id":"enwiki-341442-1356713544::In-text #1c374f62","item":"In-text #1c374f62","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"fc685d246b1ac9e22596b2fb12dc95425a0615a0b96d6775866e60d9256b0ed8","module":"Mathlib.Logic.Function.Basic","note":"Mathlib writes the subsets of A as the type Set A, and its Surjective is the passage's onto.","pair_key":"a04faadd1adbcef4eaf045a0b732ba57bae321bd2dfaad8485fda6f4f58a7d5f","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"b2304c54d88dba004556862990b0da300dc138e9aec028085c2e76f175084d92","module":"Mathlib.Logic.Function.Basic","note":"The Lawvere fixed point form of the same diagonal argument, for a map parameterising functions into an arbitrary codomain.","pair_key":"c66cde71d28ed47d516d88e83c9023ff7cb19c205b4354bf70f84bebc1c8eb42","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9952589734114713665aa5c9261bd69ff4c64aa805c3fa8055c5e2ae9cc8eb72","prominence":"central","quote":{"exact":"f {\\displaystyle f} cannot be onto."},"quote_capped":false,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"So the assumption that an element of A {\\displaystyle A} maps to B {\\displaystyle B} must be false; and ","segments":[{"text":"So the assumption that an element of "},{"tex":"A"},{"text":" maps to "},{"tex":"B"},{"text":" must be false; and "}]},"layer":"f {\\displaystyle f} cannot be onto.","segments":[{"tex":"f"},{"text":" cannot be onto."}]},"unresolved":null},{"absence":null,"basis":"b969769ab7c9f21801e56bb16ef39612b7b6575a3e1bfe054db308d48a52e955","coverage":null,"id":"enwiki-341442-1356713544::In-text #702b406a","item":"In-text #702b406a","kind":"construction","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.boolIndicator","end_line":28,"library":"mathlib","line":27,"location_key":"b969769ab7c9f21801e56bb16ef39612b7b6575a3e1bfe054db308d48a52e955","module":"Mathlib.Data.Set.BoolIndicator","note":"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.","pair_key":"b4f6d1c29fe5af9cf9409dd58318df7c5d124ca4295d809d07292490e9b01f6b","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.boolIndicator {α : Type*} : Set α → α → Bool"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.mem_iff_boolIndicator","end_line":32,"library":"mathlib","line":30,"location_key":"d6b90048d191c9c48735a63b7c808bde842929543c96dd8fb3786d807f3e4c59","module":"Mathlib.Data.Set.BoolIndicator","note":"A membership unfolding lemma for the Bool record, restating what that record means at one set and one point.","pair_key":"65889876fe338199a0feefc9987071efca13ca5712a1f1ec075447e78cf613f4","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∈ s ↔ s.boolIndicator x = Bool.true"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"576e244b51000246a13c1b53112e074bb2bac5f39ecff7f1614a2e0ce169bc59","prominence":"supporting","quote":{"exact":"each row is labelled by a unique x {\\displaystyle x} from A"},"quote_capped":true,"section":["Proof"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"For a countable (or finite) set, the argument of the proof given above can be illustrated by constructing a table in which ","lead_in":true,"segments":[{"text":"For a countable (or finite) set, the argument of the proof given above can be illustrated by constructing a table in which "}]},"layer":"each row is labelled by a unique x {\\displaystyle x} from A = { x 1 , x 2 , … } {\\displaystyle A=\\{x_{1},x_{2},\\ldots \\}} , in this order. A {\\displaystyle 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 {\\displaystyle y} from the power set of A {\\displaystyle A} ; the columns are ordered by the argument to f {\\displaystyle f} , i.e. the column labels are f ( x 1 ) , f ( x 2 ) {\\displaystyle f(x_{1}),f(x_{2})} , ..., in this order. the intersection of each row x {\\displaystyle x} and column y {\\displaystyle y} records a true/false bit whether x ∈ y {\\displaystyle x\\in y} .","segments":[{"text":"each row is labelled by a unique "},{"tex":"x"},{"text":" from "},{"tex":"A=\\{x_{1},x_{2},\\ldots \\}"},{"text":" , in this order. "},{"tex":"A"},{"text":" is assumed to admit a linear order so that such table can be constructed. each column of the table is labelled by a unique "},{"tex":"y"},{"text":" from the power set of "},{"tex":"A"},{"text":" ; the columns are ordered by the argument to "},{"tex":"f"},{"text":" , i.e. the column labels are "},{"tex":"f(x_{1}),f(x_{2})"},{"text":" , ..., in this order. the intersection of each row "},{"tex":"x"},{"text":" and column "},{"tex":"y"},{"text":" records a true/false bit whether "},{"tex":"x\\in y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"5100f7f413b28d96d0b991d90d3efe026bf52fc228f410fa13633bcda5f4ab2d","coverage":null,"id":"enwiki-341442-1356713544::In-text #c3883c76","item":"In-text #c3883c76","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Matrix.diag","end_line":295,"library":"mathlib","line":294,"location_key":"5100f7f413b28d96d0b991d90d3efe026bf52fc228f410fa13633bcda5f4ab2d","module":"Mathlib.Data.Matrix.Diagonal","note":"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.","pair_key":"7dacb92f51dbb27a639f636011bd604501348af4c9a395c36a88489e3a6506c8","path":"Mathlib/Data/Matrix/Diagonal.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Matrix.diag {n : Type*} {α : Type v} : Matrix n n α → n → α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.boolIndicator","end_line":28,"library":"mathlib","line":27,"location_key":"1db649a3a5555dadedc76c1c1663cc1345d618e7e756834dc777f017ef8ae67c","module":"Mathlib.Data.Set.BoolIndicator","note":"The Bool valued membership record whose values the cells along that diagonal carry.","pair_key":"26413e781f91e5bed748d7fad2c518056e06f1d95118bdb21610ef306e894477","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.boolIndicator {α : Type*} : Set α → α → Bool"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"7b564d0b1a5971729b9b219f6919ec539fee90535af6a50a6354e53204005af7","prominence":"supporting","quote":{"exact":"Given the order chosen for the row and column labels, the main"},"quote_capped":true,"section":["Proof"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Given the order chosen for the row and column labels, the main diagonal D {\\displaystyle D} of this table thus records whether x ∈ f ( x ) {\\displaystyle x\\in f(x)} for each x ∈ A {\\displaystyle x\\in A} .","segments":[{"text":"Given the order chosen for the row and column labels, the main diagonal "},{"tex":"D"},{"text":" of this table thus records whether "},{"tex":"x\\in f(x)"},{"text":" for each "},{"tex":"x\\in A"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"28ccfb633ce2b02451f396702535a25716906b26651f38a75fa755682166fbdc","coverage":null,"id":"enwiki-341442-1356713544::In-text #f1707013","item":"In-text #f1707013","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.preimage_boolIndicator_false","end_line":42,"library":"mathlib","line":41,"location_key":"28ccfb633ce2b02451f396702535a25716906b26651f38a75fa755682166fbdc","module":"Mathlib.Data.Set.BoolIndicator","note":"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.","pair_key":"c9d149f5265d4cb0edc6ab6318ea7fe6571d504ef3275cf64e3a1ca8ab1621e8","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.preimage_boolIndicator_false {α : Type*} (s : Set α) : s.boolIndicator ⁻¹' {Bool.false} = sᶜ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.notMem_iff_boolIndicator","end_line":36,"library":"mathlib","line":34,"location_key":"2bd3d4629779d5db17266745137dd8cc6be336953c8eb354225526cebe84fbb5","module":"Mathlib.Data.Set.BoolIndicator","note":"A non membership unfolding lemma for the Bool record at one fixed set and one point.","pair_key":"22e6fb65a721e8f5332ee9ba28be3836ab66ca1b83f649e5ceac6b06c24e0fd9","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.notMem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∉ s ↔ s.boolIndicator x = Bool.false"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c3857d956acf90ba0d284fefaa255225b8b9118d33d63e73f971f567ee7390ad","prominence":"supporting","quote":{"exact":"The set B {\\displaystyle B} constructed in the previous paragraphs coincides with"},"quote_capped":true,"section":["Proof"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"f ( x 1 ) f ( x 2 ) f ( x 3 ) f ( x 4 ) ⋯ x 1 T T F T ⋯ x 2 T F F F ⋯ x 3 F F T T ⋯ x 4 F T T T ⋯ ⋮ ⋮ ⋮ ⋮ ⋮ ⋱ {\\displaystyle {\\begin{array}{cccccc}&f(x_{1})&f(x_{2})&f(x_{3})&f(x_{4})&\\cdots \\\\\\hline x_{1}&{\\color {red}T}&T&F&T&\\cdots \\\\x_{2}&T&{\\color {red}F}&F&F&\\cdots \\\\x_{3}&F&F&{\\color {red}T}&T&\\cdots \\\\x_{4}&F&T&T&{\\color {red}T}&\\cdots \\\\\\vdots &\\vdots &\\vdots &\\vdots &\\vdots &\\ddots \\end{array}}} ","segments":[{"display":true,"tex":"\\begin{array}{cccccc}&f(x_{1})&f(x_{2})&f(x_{3})&f(x_{4})&\\cdots \\\\\\hline x_{1}&{\\color {red}T}&T&F&T&\\cdots \\\\x_{2}&T&{\\color {red}F}&F&F&\\cdots \\\\x_{3}&F&F&{\\color {red}T}&T&\\cdots \\\\x_{4}&F&T&T&{\\color {red}T}&\\cdots \\\\\\vdots &\\vdots &\\vdots &\\vdots &\\vdots &\\ddots \\end{array}"},{"text":" "}],"trimmed":true},"layer":"The set B {\\displaystyle B} constructed in the previous paragraphs coincides with the row labels for the subset of entries on this main diagonal D {\\displaystyle D} (which in above example, coloured red) where the table records that x ∈ f ( x ) {\\displaystyle x\\in f(x)} is false.[3]","segments":[{"text":"The set "},{"tex":"B"},{"text":" constructed in the previous paragraphs coincides with the row labels for the subset of entries on this main diagonal "},{"tex":"D"},{"text":" (which in above example, coloured red) where the table records that "},{"tex":"x\\in f(x)"},{"text":" is false."},{"ref":"[3]"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"d36478314af77cc0906cc91bf10a8507a216632439e0f4028e925c503fd06b08"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #b76fb2f4","item":"In-text #b76fb2f4","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.mem_iff_boolIndicator","end_line":32,"library":"mathlib","line":30,"location_key":"27fafd9fb3f7fc113550e5455e56ea84938581f1a94646fa454aed8b6bdbaf1e","module":"Mathlib.Data.Set.BoolIndicator","note":"A membership unfolding lemma: it restates what the Bool record of one set at one point means.","pair_key":"a7e42ad81872e626336aafcf434a10a38e155cfe0512abe24f8373e2b22e9471","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∈ s ↔ s.boolIndicator x = Bool.true"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"79942e6e09ed0d252b58bc887c266a0ebc20e0ce2169ada2a6589d51bd14632f","prominence":"supporting","quote":{"exact":"Each row records the values of the indicator function of the set"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Each row records the values of the indicator function of the set corresponding to the column.","segments":[{"text":"Each row records the values of the indicator function of the set corresponding to the column."}]},"unresolved":null},{"absence":null,"basis":"cf4d4e16903ab78a2552bce603e09135a635db8ab7784c5d47556e970a8343c8","coverage":null,"id":"enwiki-341442-1356713544::In-text #1b1d9c23","item":"In-text #1b1d9c23","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"low","declaration":"Set.preimage_boolIndicator_false","end_line":42,"library":"mathlib","line":41,"location_key":"cf4d4e16903ab78a2552bce603e09135a635db8ab7784c5d47556e970a8343c8","module":"Mathlib.Data.Set.BoolIndicator","note":"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.","pair_key":"82ee059bdc286178ec5034c4413c1191134bfe71f17f07a7c90268ab6305c664","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.preimage_boolIndicator_false {α : Type*} (s : Set α) : s.boolIndicator ⁻¹' {Bool.false} = sᶜ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.notMem_iff_boolIndicator","end_line":36,"library":"mathlib","line":34,"location_key":"79caa3444d1b6e5b11e98b30a6764a132248cd795bc23b980293cb7be7b48390","module":"Mathlib.Data.Set.BoolIndicator","note":"A non membership unfolding lemma for the Bool record of one set at one point.","pair_key":"06b1f27b7121324d3e6dedece02ce9eadbea86b7fb0047fc9a2cd8915f9813aa","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.notMem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∉ s ↔ s.boolIndicator x = Bool.false"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"181d527863d796c05618c766ad45a149d6124a8d3a14f5777f3dfeae49648bc8","prominence":"supporting","quote":{"exact":"The indicator function of B {\\displaystyle B} coincides with the logically negated"},"quote_capped":true,"section":["Proof"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"The indicator function of B {\\displaystyle B} coincides with the logically negated (swap \"true\" and \"false\") entries of the main diagonal.","segments":[{"text":"The indicator function of "},{"tex":"B"},{"text":" coincides with the logically negated (swap \"true\" and \"false\") entries of the main diagonal."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"edbe307f48b904313d8936914591782641475abaeb2bb68e37e0217ba28a7223"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #1331c95b","item":"In-text #1331c95b","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"e03c0c27d6ab0c5488b3ca5df005357651533fe1c70d6141f9d28db89652c588","module":"Mathlib.Logic.Function.Basic","note":"It denies that any map from A into its subsets is onto, without naming the set that is missed.","pair_key":"cc10a1feb8fefc236c2e13f268f3dcbadbada6728fd5350a17570b0b6dc01f20","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"d99150bdb3356740fadba37fed6aba2a532233fd16770f736f3dd6bc1a3d3534","prominence":"supporting","quote":{"exact":"Thus the indicator function of B {\\displaystyle B} does not agree with"},"quote_capped":true,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Thus the indicator function of B {\\displaystyle B} does not agree with any column in at least one entry.","segments":[{"text":"Thus the indicator function of "},{"tex":"B"},{"text":" does not agree with any column in at least one entry."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"08804d22d300d6858f15aa34102fb0d2f157253e10d1917a4871623b4c485780"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #6c4387b3","item":"In-text #6c4387b3","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"9abe8ac6b60fc4856c2151535fc2f1da20be74f7a6c3cdef7d1f7dd57942c955","module":"Mathlib.Logic.Function.Basic","note":"It denies that a map from A into its subsets is onto, leaving unnamed the subset that no argument reaches.","pair_key":"9b0c2f61a6ab0118b968cd2a77adbf1e263574067a79bef9aa5a85e4ad849507","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fcbd42d907b02292f2423dbd87632c59716869101f0563c263d640ea92bdf7a7","prominence":"supporting","quote":{"exact":"Consequently, no column represents B {\\displaystyle B} ."},"quote_capped":false,"section":["Proof"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Consequently, no column represents B {\\displaystyle B} .","segments":[{"text":"Consequently, no column represents "},{"tex":"B"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"90e71aeb15b10152f8e1be30a3d3124f8075d794ed8c158abaf553f9f6f0334a","coverage":null,"id":"enwiki-341442-1356713544::In-text #0dc558cc","item":"In-text #0dc558cc","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.infinite_range_of_injective","end_line":915,"library":"mathlib","line":912,"location_key":"90e71aeb15b10152f8e1be30a3d3124f8075d794ed8c158abaf553f9f6f0334a","module":"Mathlib.Data.Set.Finite.Basic","note":"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.","pair_key":"75e86dc9edf4f07df6ba81c257569dbda15b7ba30c70fa2fa8fe60752a57652d","path":"Mathlib/Data/Set/Finite/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.infinite_range_of_injective {α : Type u} {β : Type v} [Infinite α] {f : α → β} : Function.Injective f → (Set.range f).Infinite"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.powerset_univ","end_line":1070,"library":"mathlib","line":1069,"location_key":"7b3f45fe14347ac4eff5e4b2d352419055ec0ec7de31605979b5b3b574f20898","module":"Mathlib.Data.Set.Basic","note":"It is written for an arbitrary type and the passage reads it at the naturals.","pair_key":"60977861852271a40b74794c7e3b144fb87563495d4de5e2f343542f883d6145","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.powerset_univ {α : Type u} : 𝒫 Set.univ = Set.univ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.infinite_univ","end_line":840,"library":"mathlib","line":839,"location_key":"3ada84dfe0639186c45dda53368c8bcf0d09efcab75f7e374cac55d0ff0e7f84","module":"Mathlib.Data.Set.Finite.Basic","note":"It gives ℕ itself as the infinite member and says nothing about the even numbers the passage names as its illustration.","pair_key":"f2e5311d62517e2f5e501c63c911504bd71e594c7c53cbff5493a42b7c784bfe","path":"Mathlib/Data/Set/Finite/Basic.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.infinite_univ {α : Type u} [h : Infinite α] : Set.univ.Infinite"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"37d2de70cc5d82f7aa625540bafac0b133da789c20366e8b69cdb0bdf3c92e35","prominence":"supporting","quote":{"exact":"Indeed, P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains infinite"},"quote_capped":true,"section":["When A is countably infinite"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Indeed, P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains infinite subsets of N {\\displaystyle \\mathbb {N} } , e.g. the set of all positive even numbers { 2 , 4 , 6 , … } = { 2 k : k ∈ N } {\\displaystyle \\{2,4,6,\\ldots \\}=\\{2k:k\\in \\mathbb {N} \\}} , along with the empty set ∅ {\\displaystyle \\varnothing } .","segments":[{"text":"Indeed, "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" contains infinite subsets of "},{"tex":"\\mathbb {N}"},{"text":" , e.g. the set of all positive even numbers "},{"tex":"\\{2,4,6,\\ldots \\}=\\{2k:k\\in \\mathbb {N} \\}"},{"text":" , along with the empty set "},{"tex":"\\varnothing"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"3004f2bfced42428c53622bbfdd7dbf7077461e4418e581de8c194ee0f35e882"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #a953e569","item":"In-text #a953e569","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2c373d3f2fe9252bcb50b5d7da90ee143680ee0c9208b94f749954794e5e2d82","prominence":"supporting","quote":{"exact":"Let us call such numbers selfish."},"quote_capped":false,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Let us call such numbers selfish.","segments":[{"text":"Let us call such numbers selfish."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"e7d4dfbd54be86bb9b74ceb27abb552beaf4a5ad67feff5ac36333be51b010e7"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #b5cbf785","item":"In-text #b5cbf785","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9daf52c08b926a36a38c944acfc2c31b5e927d030ebedb165cf9aea515516eae","prominence":"supporting","quote":{"exact":"Call these numbers non-selfish."},"quote_capped":false,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Call these numbers non-selfish.","segments":[{"text":"Call these numbers non-selfish."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"812b2b79c653ad80cf4bac0904bf40ad76ff0577db7d1113abfa257d880c2d4e"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #1d8c0f5b","item":"In-text #1d8c0f5b","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"2b2cd2b1a1a60ec461963d3d06795b95dc27a317d1ae4ecfedf050946cd41cab","prominence":"supporting","quote":{"exact":"Let B {\\displaystyle B} be the set of all non-selfish natural numbers."},"quote_capped":false,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Let B {\\displaystyle B} be the set of all non-selfish natural numbers.","segments":[{"text":"Let "},{"tex":"B"},{"text":" be the set of all non-selfish natural numbers."}]},"unresolved":null},{"absence":null,"basis":"eb3c4c277a874ffc34dfeb51223b5fd65dbadc587384872faf24ee1b6bccb995","coverage":null,"id":"enwiki-341442-1356713544::In-text #ffce8dbb","item":"In-text #ffce8dbb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.powerset_univ","end_line":1070,"library":"mathlib","line":1069,"location_key":"eb3c4c277a874ffc34dfeb51223b5fd65dbadc587384872faf24ee1b6bccb995","module":"Mathlib.Data.Set.Basic","note":"It is written for an arbitrary type, and the passage takes it at the naturals.","pair_key":"24a31b2bc2610ab169bf2a9567b035c6c4f308118cc1a2c196ac31d737f3fd26","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.powerset_univ {α : Type u} : 𝒫 Set.univ = Set.univ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.mem_powerset_iff","end_line":1049,"library":"mathlib","line":1048,"location_key":"d0a416745bbb1f33617ced25dddc5a13aed4f907c095141a4046c7ec25d3e880","module":"Mathlib.Data.Set.Basic","note":"It unfolds what membership in a power set means rather than asserting that every set of naturals is such a member.","pair_key":"f13f558bcddf8b2ed57049a94e011ca098a801528e3cf86b7689ac04ee2321f2","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_powerset_iff {α : Type u} (x s : Set α) : x ∈ 𝒫 s ↔ x ⊆ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"6b4f9ea17a740d753028607c86d58df996d19fee961d80629b0a231370e17534","prominence":"supporting","quote":{"exact":"By definition, the power set P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":", and so it contains this set B {\\displaystyle B} as an element.","segments":[{"text":", and so it contains this set "},{"tex":"B"},{"text":" as an element."}]},"layer":"By definition, the power set P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains all sets of natural numbers","segments":[{"text":"By definition, the power set "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" contains all sets of natural numbers"}]},"unresolved":null},{"absence":null,"basis":"a1aac33f7d38574475e35110f5cb55fa794bfff92e3b48f4313ddac74c2e5a4c","coverage":null,"id":"enwiki-341442-1356713544::In-text #4dea7cad","item":"In-text #4dea7cad","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.powerset_univ","end_line":1070,"library":"mathlib","line":1069,"location_key":"a1aac33f7d38574475e35110f5cb55fa794bfff92e3b48f4313ddac74c2e5a4c","module":"Mathlib.Data.Set.Basic","note":"The declaration covers all sets of naturals at once, and the passage uses the one it calls B.","pair_key":"f522d890a999da4fc382c9b12ff5be72f09133daa97947f94669811c41e7fb9e","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.powerset_univ {α : Type u} : 𝒫 Set.univ = Set.univ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.mem_powerset_iff","end_line":1049,"library":"mathlib","line":1048,"location_key":"bcb09cdafad4d76923a05cff6dec8ef05d9b62d4ff808a99c115568d8713aa78","module":"Mathlib.Data.Set.Basic","note":"It states what power-set membership unfolds to and says nothing about the article's set B.","pair_key":"11ea140f3d58ce4f49692a10f6250cf0f2e61c20c4d66ecbfd149da96530bcb2","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_powerset_iff {α : Type u} (x s : Set α) : x ∈ 𝒫 s ↔ x ⊆ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5565ada82677d8d79e93ce0ac43c78671be554bded90085211967bfd2cbf89ad","prominence":"supporting","quote":{"exact":"it contains this set B {\\displaystyle B} as an element."},"quote_capped":false,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"By definition, the power set P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains all sets of natural numbers, and so ","segments":[{"text":"By definition, the power set "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" contains all sets of natural numbers, and so "}]},"layer":"it contains this set B {\\displaystyle B} as an element.","segments":[{"text":"it contains this set "},{"tex":"B"},{"text":" as an element."}]},"unresolved":null},{"absence":null,"basis":"96da14ac6270f789311658e84dcfc40a8201bc7a73eaf11edde14eb737d9b753","coverage":null,"id":"enwiki-341442-1356713544::In-text #d27ae5a1","item":"In-text #d27ae5a1","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Function.Bijective.surjective","end_line":189,"library":"mathlib","line":189,"location_key":"96da14ac6270f789311658e84dcfc40a8201bc7a73eaf11edde14eb737d9b753","module":"Mathlib.Logic.Function.Basic","note":"Obtaining the number paired with B is reading surjectivity at B, which needs no additional lemma.","pair_key":"c8c5337d544a244d5fae6599d546c230a845b9c72d4c29b5bee5610e3a2582a4","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.Bijective.surjective {α : Sort*} {β : Sort*} {f : α → β} : Function.Bijective f → Function.Surjective f"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"e8b329d35f44c0a244c1f0b10a6b7858ba9f026fe47da4b1c1f91c0cfb0fbb1f","module":"Mathlib.Logic.Function.Basic","note":"It denies that any map into the power set is onto, which is a different assertion from the passage's conditional about B.","pair_key":"29ec9a311d1a02f28d8f660852d111e84f52a67f78404571e9db76c09943d77c","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"54c6dae13f92c745f6c0acee6c7ff5ac1c93cb56cf84465e32c5dea53222bc0c","prominence":"supporting","quote":{"exact":"If the mapping is bijective, B {\\displaystyle B} must be paired off"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"If the mapping is bijective, B {\\displaystyle B} must be paired off with some natural number, say b {\\displaystyle b} .","segments":[{"text":"If the mapping is bijective, "},{"tex":"B"},{"text":" must be paired off with some natural number, say "},{"tex":"b"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"7956ed5ba7e17d7d9cf9ff4313dcb7af9c17f8e3deb7f15046e38c235993f5cf"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #13aab5bd","item":"In-text #13aab5bd","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0f24aec39cb0ed45f8ff3847ff8375bf64e00d9608c766cf6874caeae4dddbb0","prominence":"supporting","quote":{"exact":"If b {\\displaystyle b} is in B {\\displaystyle B} , then b"},"quote_capped":true,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because it is in the corresponding set, which contradicts the definition of B {\\displaystyle B} .","segments":[{"text":" because it is in the corresponding set, which contradicts the definition of "},{"tex":"B"},{"text":" ."}]},"layer":"If b {\\displaystyle b} is in B {\\displaystyle B} , then b {\\displaystyle b} is selfish","segments":[{"text":"If "},{"tex":"b"},{"text":" is in "},{"tex":"B"},{"text":" , then "},{"tex":"b"},{"text":" is selfish"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"edbd465600f08dc5162c548704aadc69f30c88e8178eabd05e986a7cb683125f"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #5f52b5e8","item":"In-text #5f52b5e8","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"727113b9cda2ae209cecf419b9b815d186c2713c5d1cc26fc84b55a98e426dd8","module":"Mathlib.Logic.Function.Basic","note":"The packaged Cantor theorem never names the number paired with the diagonal set, so neither step of this case split appears in it.","pair_key":"6fc7f1407366cb087f21a81d0cba01cbbfb2b99f968c83f033f17ae6dfd3c425","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"0d2e6581860e862838900d092a0f1cbaa33c674899ec49a37e75adf68ec41cb1","prominence":"supporting","quote":{"exact":"If b {\\displaystyle b} is not in B {\\displaystyle B} , then"},"quote_capped":true,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"If b {\\displaystyle b} is not in B {\\displaystyle B} , then it is non-selfish and it should instead be a member of B {\\displaystyle B} .","segments":[{"text":"If "},{"tex":"b"},{"text":" is not in "},{"tex":"B"},{"text":" , then it is non-selfish and it should instead be a member of "},{"tex":"B"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"e62b43ad8a196c385da7e222309399314cc674ecf3a0caeee59d1c7133833199"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #6f1be061","item":"In-text #6f1be061","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"40fcb90e99e1c1aa08592d24e32188dd2c7e494064f6cc37657cbd81c80fb0f2","module":"Mathlib.Logic.Function.Basic","note":"It says some subset escapes the map without identifying which one, while this sentence identifies the escaping subset.","pair_key":"29fb9b50a242904acd17d9d55cf42f547816db1a3fdf129b789aad938e6f5cf0","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"fc8644b3ca1e0c2902308342b8b725f803eda7b1a1e9b78c648ce0dddb3931ac","prominence":"supporting","quote":{"exact":"Therefore, no such element b {\\displaystyle b} which maps to B {\\displaystyle"},"quote_capped":true,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Therefore, no such element b {\\displaystyle b} which maps to B {\\displaystyle B} can exist.","segments":[{"text":"Therefore, no such element "},{"tex":"b"},{"text":" which maps to "},{"tex":"B"},{"text":" can exist."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"9bff4131bfac6f5252af4cf435f19cefe340994b78809cb2356f0795fbf6e156"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #f6ac48b1","item":"In-text #f6ac48b1","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"56cbc89861d404ad9ee96af12e4a67c3ef7f4cbcd00984af840deb62228253d9","prominence":"supporting","quote":{"exact":"Note that the set B {\\displaystyle B} may be empty."},"quote_capped":false,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Note that the set B {\\displaystyle B} may be empty.","segments":[{"text":"Note that the set "},{"tex":"B"},{"text":" may be empty."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"1f5e21006902eb2d0a52803b02d908fe7029ad505451db2a57d112462f881832"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #4a36fe29","item":"In-text #4a36fe29","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.eq_empty_iff_forall_notMem","end_line":461,"library":"mathlib","line":460,"location_key":"25b1b3fc211ca5990c22b036a07869f2ca322761298f6bc256b69c5da850b159","module":"Mathlib.Data.Set.Basic","note":"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).","pair_key":"8f0675c60a26355211ac329861c6c7811327f5a42f8bafaaefe8abb41ed1e640","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.eq_empty_iff_forall_notMem {α : Type u} {s : Set α} : s = ∅ ↔ ∀ (x : α), x ∉ s"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"111cc62eab4e256420e28def639cd9d4781386c580b8a15f104076a669649584","prominence":"supporting","quote":{"exact":"This would mean that every natural number x {\\displaystyle x} maps to"},"quote_capped":true,"section":["When A is countably infinite"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"This would mean that every natural number x {\\displaystyle x} maps to a subset of natural numbers that contains x {\\displaystyle x} .","segments":[{"text":"This would mean that every natural number "},{"tex":"x"},{"text":" maps to a subset of natural numbers that contains "},{"tex":"x"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"43e112ce9f94ccfc16957ba46c108a84f60377a8529fa9b1f2264d2daba90706","coverage":null,"id":"enwiki-341442-1356713544::In-text #5309a626","item":"In-text #5309a626","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.nonempty_of_mem","end_line":354,"library":"mathlib","line":353,"location_key":"43e112ce9f94ccfc16957ba46c108a84f60377a8529fa9b1f2264d2daba90706","module":"Mathlib.Data.Set.Basic","note":"The declaration is stated for an arbitrary type and an arbitrary set, and the passage uses it at ℕ with the paired subsets.","pair_key":"f0ba300ef895b0c871cd7de2c177114cddb829a6925970c4fa24a41d48031d64","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.nonempty_of_mem {α : Type u} {s : Set α} {x : α} : x ∈ s → s.Nonempty"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.Nonempty.ne_empty","end_line":492,"library":"mathlib","line":492,"location_key":"f1a2d58be876bd575a83a6746c8797b7c7618d4cb189675c34ddb11a6154f48a","module":"Mathlib.Data.Set.Basic","note":"Stated for an arbitrary type and set; here it is used at ℕ and at the subsets the pairing assigns.","pair_key":"13c97fe2225a822391b15deb7ecbac41e0ac7b115853b7f192439f870b369422","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.Nonempty.ne_empty {α : Type u} {s : Set α} : s.Nonempty → s ≠ ∅"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"ea65413490919c6b35b14e946379c32c1642626b20a66b5fad11bc7ced8393d7","prominence":"supporting","quote":{"exact":"Then, every number maps to a nonempty set and no number maps"},"quote_capped":true,"section":["When A is countably infinite"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Then, every number maps to a nonempty set and no number maps to the empty set.","segments":[{"text":"Then, every number maps to a nonempty set and no number maps to the empty set."}]},"unresolved":null},{"absence":null,"basis":"2fdae0c1eb19de1304ccbed353852af5f891958c77445ce362f694842efb209d","coverage":null,"id":"enwiki-341442-1356713544::In-text #07e6f764","item":"In-text #07e6f764","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.empty_subset","end_line":454,"library":"mathlib","line":453,"location_key":"2fdae0c1eb19de1304ccbed353852af5f891958c77445ce362f694842efb209d","module":"Mathlib.Data.Set.Basic","note":"Mathlib encodes membership in the power set as containment (PD10), and states this for an arbitrary type and set where the passage fixes ℕ.","pair_key":"575c87283d71d2cad0092b3977f5d4cce845271bafaf8ea90bd3060d18d5fd43","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.empty_subset {α : Type u} (s : Set α) : ∅ ⊆ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5acbecb7fb564a7f31a46f9f28bd1e5ede1020bdda66289ed0617c1d81eda5ad","prominence":"supporting","quote":{"exact":"But the empty set is a member of P ( N )"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" , so the mapping still does not cover P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} .","segments":[{"text":" , so the mapping still does not cover "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" ."}]},"layer":"But the empty set is a member of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )}","segments":[{"text":"But the empty set is a member of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"}]},"unresolved":null},{"absence":null,"basis":"faa0aa368301cb131ff8e780466407de4c7891dbfef6be6e1b287f57f3ef9ce2","coverage":null,"id":"enwiki-341442-1356713544::In-text #61201b8d","item":"In-text #61201b8d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"faa0aa368301cb131ff8e780466407de4c7891dbfef6be6e1b287f57f3ef9ce2","module":"Mathlib.Logic.Function.Basic","note":"Mathlib writes the collection of all sets of naturals as the type Set ℕ, and states the result for an arbitrary type in place of ℕ.","pair_key":"1ec234cbd33e876ed83ffbc52ba07eebc520b1e7af123d100e677be9197be9bd","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"0250b61be8e5693b3c30acd11b218857857bf9b384583c205bdf1a86a28c0f1d","prominence":"supporting","quote":{"exact":"the mapping still does not cover P ( N ) {\\displaystyle {\\mathcal"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"But the empty set is a member of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} , so ","segments":[{"text":"But the empty set is a member of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" , so "}]},"layer":"the mapping still does not cover P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} .","segments":[{"text":"the mapping still does not cover "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"12454ca4cb4a78e317352ed7d6ae963664ddf24bc7036fa6f9dee86ffd8d6c30","coverage":null,"id":"enwiki-341442-1356713544::In-text #9cbf495b","item":"In-text #9cbf495b","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"12454ca4cb4a78e317352ed7d6ae963664ddf24bc7036fa6f9dee86ffd8d6c30","module":"Mathlib.SetTheory.Cardinal.Order","note":"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).","pair_key":"edc718a3e024da8eee65769ed8f60dff84081f95f6011febaee02402d5b2d09e","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.mk_set_nat","end_line":77,"library":"mathlib","line":77,"location_key":"84da5f8f7f15a594fdb3647cbf613385f9847910e286f7413fcad08510be70fe","module":"Mathlib.SetTheory.Cardinal.Continuum","note":"It is the declaration stated for ℕ itself, but it computes a value rather than comparing the two cardinals.","pair_key":"0047838aa2c34f662914a4313d50b4023ac306636772f1385d7730ebf1b68518","path":"Mathlib/SetTheory/Cardinal/Continuum.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.mk_set_nat : Cardinal.mk (Set ℕ) = Cardinal.continuum"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f624fed713b9b12a52d83b61f36cc2fada26d17e486c5fbc9528797221ee5437","prominence":"supporting","quote":{"exact":"Through this proof by contradiction we have proven that the cardinality of"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Through this proof by contradiction we have proven that the cardinality of N {\\displaystyle \\mathbb {N} } and P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} cannot be equal.","segments":[{"text":"Through this proof by contradiction we have proven that the cardinality of "},{"tex":"\\mathbb {N}"},{"text":" and "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" cannot be equal."}]},"unresolved":null},{"absence":null,"basis":"4e8f3f3bb01b3410c88fff30e77e36fd36fd9833927edcba296a7234722862c1","coverage":null,"id":"enwiki-341442-1356713544::In-text #c09536a6","item":"In-text #c09536a6","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.aleph0_le_continuum","end_line":69,"library":"mathlib","line":68,"location_key":"4e8f3f3bb01b3410c88fff30e77e36fd36fd9833927edcba296a7234722862c1","module":"Mathlib.SetTheory.Cardinal.Continuum","note":"Mathlib names the two cardinals aleph-null and the continuum, which are the counts of the naturals and of the sets of naturals.","pair_key":"30e07c3dcc89f9c0cdf1cf445cb7d257191b58634d7e050eb3e187207a219d7f","path":"Mathlib/SetTheory/Cardinal/Continuum.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.aleph0_le_continuum : Cardinal.aleph0 ≤ Cardinal.continuum"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.aleph0_lt_continuum","end_line":66,"library":"mathlib","line":65,"location_key":"8a2e82ece114b06c9ecf253f32a622937133a0b6010fc07fee9ee4e365fd10be","module":"Mathlib.SetTheory.Cardinal.Continuum","note":"The declaration compares the very same two cardinals and rules out equality as well.","pair_key":"0a5df975730c9d047857a4259ebbcfd080a3c128f092acc1c52fa9310196a1b6","path":"Mathlib/SetTheory/Cardinal/Continuum.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.aleph0_lt_continuum : Cardinal.aleph0 < Cardinal.continuum"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"1d2853e917ff4a133023daac1c8c66a484614827031d76744adde3c6ccb9b1b2","module":"Mathlib.SetTheory.Cardinal.Order","note":"Mathlib writes the count of the subsets of a set as two raised to that set's cardinal.","pair_key":"ab5a34582959d714bb6ec5a0235c0a07fec8a01e8736515940ff60af7585ecdf","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d0d3c14a0f757752e66441bfd0884199f4545e72a4b89946a7513a633e74158d","prominence":"supporting","quote":{"exact":"We also know that the cardinality of P ( N ) {\\displaystyle"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" because P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains all singletons, by definition, and these singletons form a \"copy\" of N {\\displaystyle \\mathbb {N} } inside of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} .","segments":[{"text":" because "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" contains all singletons, by definition, and these singletons form a \"copy\" of "},{"tex":"\\mathbb {N}"},{"text":" inside of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" ."}]},"layer":"We also know that the cardinality of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} cannot be less than the cardinality of N {\\displaystyle \\mathbb {N} }","segments":[{"text":"We also know that the cardinality of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" cannot be less than the cardinality of "},{"tex":"\\mathbb {N}"}]},"unresolved":null},{"absence":null,"basis":"e5edae8010f959ef2bd71241db655085de7fa720db7d6af4481d91f1286282b2","coverage":null,"id":"enwiki-341442-1356713544::In-text #316730eb","item":"In-text #316730eb","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.subset_univ","end_line":586,"library":"mathlib","line":586,"location_key":"e5edae8010f959ef2bd71241db655085de7fa720db7d6af4481d91f1286282b2","module":"Mathlib.Data.Set.Basic","note":"Mathlib expresses membership in a power set as inclusion in the ambient set, and this lemma covers every subset at once.","pair_key":"35a28e7333441b04958665839281714bf26fb6672ff2875c44d3c3539c9be222","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.subset_univ {α : Type u} (s : Set α) : s ⊆ Set.univ"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.mem_powerset_iff","end_line":1049,"library":"mathlib","line":1048,"location_key":"ec84b87e051eb3741591c6240f108194fcecdb9ba8b9845d535a0c5404b07bb7","module":"Mathlib.Data.Set.Basic","note":"This lemma only unfolds what membership in a power set means.","pair_key":"fad0560bc66e1e704dfb5ea5cd1569ac266f7c67f24d87a5a5d44775c754a0cf","path":"Mathlib/Data/Set/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.mem_powerset_iff {α : Type u} (x s : Set α) : x ∈ 𝒫 s ↔ x ⊆ s"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"4cc129199009d01344bbd88d379044d834f5165331b7e565136ac37a1bfbe2f7","prominence":"supporting","quote":{"exact":"P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains all singletons,"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":", and these singletons form a \"copy\" of N {\\displaystyle \\mathbb {N} } inside of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} .","segments":[{"text":", and these singletons form a \"copy\" of "},{"tex":"\\mathbb {N}"},{"text":" inside of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" ."}]},"before":{"layer":"We also know that the cardinality of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} cannot be less than the cardinality of N {\\displaystyle \\mathbb {N} } because ","segments":[{"text":"We also know that the cardinality of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" cannot be less than the cardinality of "},{"tex":"\\mathbb {N}"},{"text":" because "}]},"layer":"P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains all singletons, by definition","segments":[{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" contains all singletons, by definition"}]},"unresolved":null},{"absence":null,"basis":"c3e9f9675aa710b7b6fb10d48cb0effc9249a84f5c6129189e6400c4c0af30a7","coverage":null,"id":"enwiki-341442-1356713544::In-text #ed07e42d","item":"In-text #ed07e42d","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.singleton_injective","end_line":191,"library":"mathlib","line":190,"location_key":"c3e9f9675aa710b7b6fb10d48cb0effc9249a84f5c6129189e6400c4c0af30a7","module":"Mathlib.Data.Set.Insert","note":"Mathlib states the injectivity of the singleton map for an arbitrary type of elements.","pair_key":"2d65f0b7a714a8d9ddbb7585036274f1d915a2cf7fbd880c356f4eb8af972f49","path":"Mathlib/Data/Set/Insert.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Set.singleton_injective {α : Type*} : Function.Injective Singleton.singleton"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.powersetCard.ofSingleton","end_line":137,"library":"mathlib","line":133,"location_key":"95175e06b4d00cb9f849ae9b85420db0340b730654de625519c5508bfb13c1e5","module":"Mathlib.Data.Set.PowersetCard","note":"Mathlib records the one element subsets as finite sets and bundles the correspondence as an equivalence.","pair_key":"8c529880b4d21179fc1184120bf4821ba3649a5725c20aa710c811a273c86011","path":"Mathlib/Data/Set/PowersetCard.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.powersetCard.ofSingleton {α : Type*} : α ≃ ↑(Set.powersetCard α 1)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"909bedfa34445b323d33f0c0a11e2c538999d00f93cd07b094060e66842d91f1","prominence":"supporting","quote":{"exact":"these singletons form a \"copy\" of N {\\displaystyle \\mathbb {N} } inside"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"We also know that the cardinality of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} cannot be less than the cardinality of N {\\displaystyle \\mathbb {N} } because P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} contains all singletons, by definition, and ","segments":[{"text":"We also know that the cardinality of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" cannot be less than the cardinality of "},{"tex":"\\mathbb {N}"},{"text":" because "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" contains all singletons, by definition, and "}]},"layer":"these singletons form a \"copy\" of N {\\displaystyle \\mathbb {N} } inside of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} .","segments":[{"text":"these singletons form a \"copy\" of "},{"tex":"\\mathbb {N}"},{"text":" inside of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"993b7f2df87203bccd07a7b2430970135cd60964f38c23b29fd709c12a7da57b","coverage":null,"id":"enwiki-341442-1356713544::In-text #e69d0625","item":"In-text #e69d0625","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.aleph0_lt_continuum","end_line":66,"library":"mathlib","line":65,"location_key":"993b7f2df87203bccd07a7b2430970135cd60964f38c23b29fd709c12a7da57b","module":"Mathlib.SetTheory.Cardinal.Continuum","note":"Mathlib names the count of the naturals aleph-null and the count of the sets of naturals the continuum.","pair_key":"90ef697086ab0231b575c33a135cb0800b8322d024ae21764091152f87549a3b","path":"Mathlib/SetTheory/Cardinal/Continuum.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.aleph0_lt_continuum : Cardinal.aleph0 < Cardinal.continuum"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"0ed159a9756f456a436eb3a70acb360e7a72d46dba2a59e3b3015fc62b535a15","module":"Mathlib.SetTheory.Cardinal.Order","note":"Mathlib writes the count of the subsets of a set as two raised to that set's cardinal.","pair_key":"f1194cc8d42e6d641d7b4b1f3055638eed74b05816b97d913389b9f16420234c","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.cantor'","end_line":311,"library":"mathlib","line":309,"location_key":"ff255cb74aa855be73543a1fb0fffe48dd1010119f68374c7e9ddb33961f3b73","module":"Mathlib.SetTheory.Cardinal.Basic","note":"The declaration allows any base above one in place of the two that counts subsets.","pair_key":"09e5ace049745b3293c5735b44d813b07d2f3a9363abff73b8686848523395a8","path":"Mathlib/SetTheory/Cardinal/Basic.lean","proof_status":"proved","rank":3,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor' (a : Cardinal) {b : Cardinal} : 1 < b → a < b ^ a"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"95d9adb6ea3ef110a9570d1106b8640ec3035d7ac1643aef9a3178fdabdda483","prominence":"central","quote":{"exact":"that is that the cardinality of P ( N ) {\\displaystyle {\\mathcal"},"quote_capped":true,"section":["When A is countably infinite"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"Therefore, only one possibility remains, and ","segments":[{"text":"Therefore, only one possibility remains, and "}]},"layer":"that is that the cardinality of P ( N ) {\\displaystyle {\\mathcal {P}}(\\mathbb {N} )} is strictly greater than the cardinality of N {\\displaystyle \\mathbb {N} } , proving Cantor's theorem.","segments":[{"text":"that is that the cardinality of "},{"tex":"{\\mathcal {P}}(\\mathbb {N} )"},{"text":" is strictly greater than the cardinality of "},{"tex":"\\mathbb {N}"},{"text":" , proving Cantor's theorem."}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"e5cb375fb93da464b707b0195fb1f7359194fb07c516900433e5a7bb40fb71b1"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #7ba80092","item":"In-text #7ba80092","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"327b68ac965c035df67a4c5d079e309969c5a539708bf1b149989d621b4894ef","prominence":"central","quote":{"exact":"Cantor's paradox is the name given to a contradiction following from Cantor's"},"quote_capped":true,"section":["Related paradoxes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"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 {\\displaystyle V} .","segments":[{"text":"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 "},{"tex":"V"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"9ec439b84df5468d168aea3a853e5613592fe1be44c904f2b9614670361f7008","coverage":null,"id":"enwiki-341442-1356713544::In-text #2f193edd","item":"In-text #2f193edd","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Cardinal.cantor","end_line":340,"library":"mathlib","line":335,"location_key":"9ec439b84df5468d168aea3a853e5613592fe1be44c904f2b9614670361f7008","module":"Mathlib.SetTheory.Cardinal.Order","note":"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.","pair_key":"4f5d4bfd48335a5af7e4b714ea965885e88f3b17959360e4ee95590c7184ee35","path":"Mathlib/SetTheory/Cardinal/Order.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor (a : Cardinal) : a < 2 ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Cardinal.cantor'","end_line":311,"library":"mathlib","line":309,"location_key":"ede6b941816c17366300ed68816751a0554a70900ba22d22cd6dea846fb34dcd","module":"Mathlib.SetTheory.Cardinal.Basic","note":"The declaration permits any base above one where the passage uses the count of subsets.","pair_key":"60946d3669f4cf19921c93d53b17dcb3ba3a74ed5fd3f025e368a7ecc8c2d459","path":"Mathlib/SetTheory/Cardinal/Basic.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Cardinal.cantor' (a : Cardinal) {b : Cardinal} : 1 < b → a < b ^ a"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"b7ae1b57f36010ff33f3e10dca854d3f03bd2833fa3ea552d09a2a585a723fd0","module":"Mathlib.Logic.Function.Basic","note":"It denies surjectivity of any map from a type to its sets and makes no cardinal comparison.","pair_key":"cf0256ce90c1bba2c3ce9e0aef2c3c106b087a821d3cbd4d96930d2d75ffcc5a","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFSet.card_powerset","end_line":70,"library":"mathlib","line":68,"location_key":"6a779951e586e89bc49509e2167c399b2271d1e39a20362f4a48cc10306e8186","module":"Mathlib.SetTheory.ZFC.Cardinal","note":"It computes the cardinal of a pure set's power set as a power of two.","pair_key":"6c95439235acc20e5c84aefd8437a25f556164e706683844808f50188978fb05","path":"Mathlib/SetTheory/ZFC/Cardinal.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.card_powerset (x : ZFSet) : x.powerset.card = 2 ^ x.card"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5196aa2c80eb7f57dd8f8fb667fc720635dd752eabffd7832c6a87613b1dd7ba","prominence":"central","quote":{"exact":"By Cantor's theorem | P ( X ) | > | X"},"quote_capped":true,"section":["Related paradoxes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"By Cantor's theorem | P ( X ) | > | X | {\\displaystyle |{\\mathcal {P}}(X)|>|X|} for any set X {\\displaystyle X} .","segments":[{"text":"By Cantor's theorem "},{"tex":"|{\\mathcal {P}}(X)|>|X|"},{"text":" for any set "},{"tex":"X"},{"text":" ."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"9704b3d73a16ab7bed3c060f21148cc096e85c52c861e3646817fce6a2753c02"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #51660697","item":"In-text #51660697","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"f9bf90e981a1c3e091bb25d7885c10676a2fdda082a7fc02c960a22d1e7d2a39","prominence":"supporting","quote":{"exact":"On the other hand, all elements of P ( V ) {\\displaystyle"},"quote_capped":true,"section":["Related paradoxes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"after":{"layer":" , therefore | P ( V ) | ≤ | V | {\\displaystyle |{\\mathcal {P}}(V)|\\leq |V|} .","segments":[{"text":" , therefore "},{"tex":"|{\\mathcal {P}}(V)|\\leq |V|"},{"text":" ."}]},"layer":"On the other hand, all elements of P ( V ) {\\displaystyle {\\mathcal {P}}(V)} are sets, and thus contained in V {\\displaystyle V}","segments":[{"text":"On the other hand, all elements of "},{"tex":"{\\mathcal {P}}(V)"},{"text":" are sets, and thus contained in "},{"tex":"V"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":3,"sha256":"9148d511d0bb5a56791181311ce6f0b0de5cc6e49eb00f6bc8137123ffd41eb8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #84af416e","item":"In-text #84af416e","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"b434e80afeea49f56a5143600f556853b5d451c10c3c2d19382a0d9a94d68223","prominence":"supporting","quote":{"exact":"| P ( V ) | ≤ | V | {\\displaystyle |{\\mathcal"},"quote_capped":true,"section":["Related paradoxes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"On the other hand, all elements of P ( V ) {\\displaystyle {\\mathcal {P}}(V)} are sets, and thus contained in V {\\displaystyle V} , therefore ","segments":[{"text":"On the other hand, all elements of "},{"tex":"{\\mathcal {P}}(V)"},{"text":" are sets, and thus contained in "},{"tex":"V"},{"text":" , therefore "}]},"layer":"| P ( V ) | ≤ | V | {\\displaystyle |{\\mathcal {P}}(V)|\\leq |V|} .","segments":[{"tex":"|{\\mathcal {P}}(V)|\\leq |V|"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"5b5e778cb440f58f2f85ca87987a9ce4ac25c694495e0d2d221983f276638826","coverage":null,"id":"enwiki-341442-1356713544::In-text #3fee103f","item":"In-text #3fee103f","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZFSet.sep","end_line":374,"library":"mathlib","line":366,"location_key":"5b5e778cb440f58f2f85ca87987a9ce4ac25c694495e0d2d221983f276638826","module":"Mathlib.SetTheory.ZFC.Basic","note":"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.","pair_key":"192f777c55eb298b0dd1a0d94c94ef9126b367b3a76d32127bf2b42af11215a0","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def ZFSet.sep : (ZFSet → Prop) → ZFSet → ZFSet"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"d212a0094f8e392fb1dd83fdc716a1faa7351b051f5de7014e4eed175af8deec","prominence":"central","quote":{"exact":"this turns Cantor's diagonal set into what is sometimes called the Russell"},"quote_capped":true,"section":["Related paradoxes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"Another paradox can be derived from the proof of Cantor's theorem by instantiating the function f with the identity function; ","segments":[{"text":"Another paradox can be derived from the proof of Cantor's theorem by instantiating the function f with the identity function; "}]},"layer":"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 } . {\\displaystyle R_{A}=\\left\\{\\,x\\in A:x\\not \\in x\\,\\right\\}.}","segments":[{"text":"this turns Cantor's diagonal set into what is sometimes called the Russell set of a given set A:"},{"ref":"[1]"},{"text":" "},{"tex":"R_{A}=\\left\\{\\,x\\in A:x\\not \\in x\\,\\right\\}."}]},"unresolved":null},{"absence":null,"basis":"4393fb972d4544bc1b8761bea3c33fa34ee816104892dba3fdcc35c40a871071","coverage":null,"id":"enwiki-341442-1356713544::In-text #a3ee9053","item":"In-text #a3ee9053","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"ZFSet.mem_sep","end_line":384,"library":"mathlib","line":381,"location_key":"4393fb972d4544bc1b8761bea3c33fa34ee816104892dba3fdcc35c40a871071","module":"Mathlib.SetTheory.ZFC.Basic","note":"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.","pair_key":"7cd72c6dff948076dd47229bd3b7e5fd412a46f49130909f16a8278a16a6dd56","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFClass.univ_notCMem_univ","end_line":71,"library":"mathlib","line":71,"location_key":"84eb7a9f8a414901c2d4abe012910a5da1971d41c1a9dcd9dee64a08a8a672ba","module":"Mathlib.SetTheory.ZFC.Class","note":"This records the conclusion drawn from the contradiction rather than the membership equivalence the passage exhibits.","pair_key":"9055dc4d4c9f861600b106991a27bb60067a579bf838e6bf0c4939e965216aab","path":"Mathlib/SetTheory/ZFC/Class.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFClass.univ_notCMem_univ : ¬ZFClass.CMem Set.univ Set.univ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"9532c632eea0187ae07388d722ac0602fe112c260122d84888e48cb1b33bf0ef","prominence":"supporting","quote":{"exact":"The proof of Cantor's theorem is straightforwardly adapted to show that assuming"},"quote_capped":true,"section":["Related paradoxes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"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 . {\\displaystyle R_{U}\\in R_{U}\\iff R_{U}\\notin R_{U}.}","segments":[{"text":"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: "},{"tex":"R_{U}\\in R_{U}\\iff R_{U}\\notin R_{U}."}]},"unresolved":null},{"absence":null,"basis":"181247cf5575d8799e89fcf2242143fb737a787871bdcd849ac22002f28743b7","coverage":null,"id":"enwiki-341442-1356713544::In-text #3a09159a","item":"In-text #3a09159a","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFClass.univ_notCMem_univ","end_line":71,"library":"mathlib","line":71,"location_key":"181247cf5575d8799e89fcf2242143fb737a787871bdcd849ac22002f28743b7","module":"Mathlib.SetTheory.ZFC.Class","note":"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.","pair_key":"4fb6c5f21b6b8906793bf9cef52b62f27839e302276a040927b33bbcf8592433","path":"Mathlib/SetTheory/ZFC/Class.lean","proof_status":"proved","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFClass.univ_notCMem_univ : ¬ZFClass.CMem Set.univ Set.univ"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Class.univ_notMem_univ","end_line":307,"library":"mathlib","line":306,"location_key":"aa7a304f7198e64bcfc4c70f877a39115c5510cf2416ecdea8b51c910ba3e671","module":"Mathlib.SetTheory.ZFC.Class","note":"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.","pair_key":"a55ea894e7be1a6ad793cbd9f2b19a340e1ce0852ebb309b6e2de0a4140eb242","path":"Mathlib/SetTheory/ZFC/Class.lean","proof_status":"proved","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"ZFClass.univ_notCMem_univ","elided":false,"text":"theorem Class.univ_notMem_univ : Class.univ ∉ Class.univ"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"385f30077dec3bdc3b4bb8ccefc081d9b81a420842e1e001f01a4357ff5131a8","prominence":"supporting","quote":{"exact":"we can conclude from the contradiction obtained that we must reject the"},"quote_capped":true,"section":["Related paradoxes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"As a point of subtlety, the version of Russell's paradox we have presented here is actually a theorem of Zermelo;[4] ","segments":[{"text":"As a point of subtlety, the version of Russell's paradox we have presented here is actually a theorem of Zermelo;"},{"ref":"[4]"},{"text":" "}]},"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"a6745a2e7b25a7b36e9aea84980493db30e737937db4aae511b90c64e4135a89","coverage":null,"id":"enwiki-341442-1356713544::In-text #5d9c5dee","item":"In-text #5d9c5dee","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFSet.mem_sep","end_line":384,"library":"mathlib","line":381,"location_key":"a6745a2e7b25a7b36e9aea84980493db30e737937db4aae511b90c64e4135a89","module":"Mathlib.SetTheory.ZFC.Basic","note":"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.","pair_key":"a1b633787e6aaa8243fb9dcad9c49e3dc8616b9eb249a543478b37ed972df7b3","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.mem_sep {p : ZFSet → Prop} {x y : ZFSet} : y ∈ ZFSet.sep p x ↔ y ∈ x ∧ p y"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"aec7394ef659f198bd2606ed06be4c1183501755d46c43bfd8207116ab71c754","prominence":"supporting","quote":{"exact":"This was possible because we have used restricted comprehension (as featured in"},"quote_capped":true,"section":["Related paradoxes"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"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 ) . {\\displaystyle R_{U}\\in R_{U}\\iff (R_{U}\\in U\\wedge R_{U}\\notin R_{U}).}","segments":[{"text":"This was possible because we have used restricted comprehension (as featured in ZFC) in the definition of RA above, which in turn entailed that "},{"tex":"R_{U}\\in R_{U}\\iff (R_{U}\\in U\\wedge R_{U}\\notin R_{U})."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":2,"queries":4,"sha256":"f80537d560e612aa429073d7ecc914e82f0b0803b47067594eee9639aa427002"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #56c37f61","item":"In-text #56c37f61","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"9a2c6625c3d661002c8f476e0a1636c6aa3d5a3313a4b78b5a048a61630d7901","prominence":"supporting","quote":{"exact":"Had we used unrestricted comprehension (as in Frege's system for instance) by"},"quote_capped":true,"section":["Related paradoxes"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"Had we used unrestricted comprehension (as in Frege's system for instance) by defining the Russell set simply as R = { x : x ∉ x } {\\displaystyle R=\\left\\{\\,x:x\\not \\in x\\,\\right\\}} , then the axiom system itself would have entailed the contradiction, with no further hypotheses needed.","segments":[{"text":"Had we used unrestricted comprehension (as in Frege's system for instance) by defining the Russell set simply as "},{"tex":"R=\\left\\{\\,x:x\\not \\in x\\,\\right\\}"},{"text":" , then the axiom system itself would have entailed the contradiction, with no further hypotheses needed."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":1,"queries":4,"sha256":"bcb964e64ad2c246122fff37da811f030e30ad69a0360c6fe0d9f5e8b85b6b48"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-341442-1356713544::In-text #dc56b18c","item":"In-text #dc56b18c","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.cantor_surjective","end_line":376,"library":"mathlib","line":374,"location_key":"3aa07c488cfd896fd277258669308d9f8a2fe6db4397acf8bec17623701f7354","module":"Mathlib.Logic.Function.Basic","note":"Mathlib concludes that no map into the power set reaches everything, while the passage asserts of one named function that it is missed.","pair_key":"4f386662f3994c81f0c3b580127679e9a2df8c00779fe2f72f19c26c55aa682b","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.cantor_surjective {α : Type*} (f : α → Set α) : ¬Function.Surjective f"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"17f3f1c8b0e95722ab2e60c90309d3dc782610f1e192081366a567ad0063c414","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"e38a51fdf3327b1be43dfca7022c811941454d3dd4d1597ab6e876a15b356e91","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"04ddd5725ce7a306c9107063125a898c9bef20dd26d4bdef9992a2792b4f3ad0","prominence":"supporting","quote":{"exact":"He showed that if f is a function defined on X whose"},"quote_capped":true,"section":["History"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"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.","segments":[{"text":"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."}]},"unresolved":null},{"absence":null,"basis":"4d33431d2436abc66f3fd0d275d104e31763f14c0df15b979fb60e7121faab1c","coverage":null,"id":"enwiki-341442-1356713544::In-text #f6ef9651","item":"In-text #f6ef9651","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"4d33431d2436abc66f3fd0d275d104e31763f14c0df15b979fb60e7121faab1c","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"3e20148a458a187dc5ac2b957e4f2a8270de70b9ed5f1fd88ac833769a00997f","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5d5b56005f69a33d0caa511f22d0490bd8fc1039ebf155371511462f815b9f0e","prominence":"central","quote":{"exact":"let C {\\displaystyle {\\mathcal {C}}} be such a category, and let 1"},"quote_capped":true,"section":["Generalizations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"before":{"layer":"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] ","segments":[{"text":"Lawvere's fixed-point theorem provides for a broad generalization of Cantor's theorem to any category with finite products in the following way:"},{"ref":"[8]"},{"text":" "}]},"layer":"let C {\\displaystyle {\\mathcal {C}}} be such a category, and let 1 {\\displaystyle 1} be a terminal object in C {\\displaystyle {\\mathcal {C}}} . Suppose that Y {\\displaystyle Y} is an object in C {\\displaystyle {\\mathcal {C}}} and that there exists an endomorphism α : Y → Y {\\displaystyle \\alpha :Y\\to Y} that does not have any fixed points; that is, there is no morphism y : 1 → Y {\\displaystyle y:1\\to Y} that satisfies α ∘ y = y {\\displaystyle \\alpha \\circ y=y} . Then there is no object T {\\displaystyle T} of C {\\displaystyle {\\mathcal {C}}} such that a morphism f : T × T → Y {\\displaystyle f:T\\times T\\to Y} can parameterize all morphisms T → Y {\\displaystyle T\\to Y} .","segments":[{"text":"let "},{"tex":"\\mathcal {C}"},{"text":" be such a category, and let "},{"tex":"1"},{"text":" be a terminal object in "},{"tex":"\\mathcal {C}"},{"text":" . Suppose that "},{"tex":"Y"},{"text":" is an object in "},{"tex":"\\mathcal {C}"},{"text":" and that there exists an endomorphism "},{"tex":"\\alpha :Y\\to Y"},{"text":" that does not have any fixed points; that is, there is no morphism "},{"tex":"y:1\\to Y"},{"text":" that satisfies "},{"tex":"\\alpha \\circ y=y"},{"text":" . Then there is no object "},{"tex":"T"},{"text":" of "},{"tex":"\\mathcal {C}"},{"text":" such that a morphism "},{"tex":"f:T\\times T\\to Y"},{"text":" can parameterize all morphisms "},{"tex":"T\\to Y"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"956d3f95926688723939363b3e0e1902a5293c2297b46d19ec37df10a057b7d6","coverage":null,"id":"enwiki-341442-1356713544::In-text #700f2a2f","item":"In-text #700f2a2f","kind":"theorem","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Function.exists_fixed_point_of_surjective","end_line":370,"library":"mathlib","line":367,"location_key":"956d3f95926688723939363b3e0e1902a5293c2297b46d19ec37df10a057b7d6","module":"Mathlib.Logic.Function.Basic","note":"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.","pair_key":"b1feb29f814fd949673e49753d4a14a5d006e61e6c552069976544509cca9735","path":"Mathlib/Logic/Function/Basic.lean","proof_status":"proved","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem Function.exists_fixed_point_of_surjective {α : Type*} {β : Type*} (f : α → α → β) : Function.Surjective f → ∀ (g : β → β), ∃ x, g x = x"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"193076a7ffe38738bd6cb71a70dc4aaef992d48d472101679f8cacdcd651f0b9","prominence":"supporting","quote":{"exact":"In other words, for every object T {\\displaystyle T} and every morphism"},"quote_capped":true,"section":["Generalizations"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=341442&oldid=1356713544","text":{"layer":"In other words, for every object T {\\displaystyle T} and every morphism f : T × T → Y {\\displaystyle f:T\\times T\\to Y} , an attempt to write maps T → Y {\\displaystyle T\\to Y} as maps of the form f ( − , x ) : T → Y {\\displaystyle f(-,x):T\\to Y} must leave out at least one map T → Y {\\displaystyle T\\to Y} .","segments":[{"text":"In other words, for every object "},{"tex":"T"},{"text":" and every morphism "},{"tex":"f:T\\times T\\to Y"},{"text":" , an attempt to write maps "},{"tex":"T\\to Y"},{"text":" as maps of the form "},{"tex":"f(-,x):T\\to Y"},{"text":" must leave out at least one map "},{"tex":"T\\to Y"},{"text":" ."}]},"unresolved":null}],"provenance":{"challenge":{"harvested":"2026-11-01T14:25:17Z","mode":"locate-challenge","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"chal-tierA-b1","sampling":{"absence_sample_rate":0.25,"sample_rate":0.2,"seed":0,"strong_sample_rate":0.5},"skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-11-01T03:19:32Z"},"inventory":{"harvested":"2026-10-30T20:00:47Z","mode":"locate-inventory","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"inv-tierA-b1r","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-30T07:23:03Z"},"locate":{"harvested":"2026-11-01T03:06:57Z","mode":"locate","model":"claude-opus-5","model_name":"Claude Opus 5","operator":"jack","reviewer_model":"claude-opus-5","reviewer_model_name":"Claude Opus 5","run_id":"loc-tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","started":"2026-10-31T04:59:09Z"}},"reader":{"bytes":294365,"images":[{"author":"KSmrq","file":"Hasse_diagram_of_powerset_of_3.svg","licence":"CC BY-SA 3.0","licence_url":"https://creativecommons.org/licenses/by-sa/3.0/","project":"commons"},{"author":"Headbomb","file":"Lock-gray-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"User:Trappist the monk","file":"Lock-green.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"VulpesVulpes42, Headbomb","file":"Lock-red-alt-2.svg","licence":"CC0","licence_url":"https://creativecommons.org/publicdomain/zero/1.0/deed.en","project":"commons"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"},{"author":"Cepheus","file":"Venn_A_intersect_B.svg","licence":"Public domain","licence_url":null,"project":"commons"}],"marks":493,"passages":72,"sha256":"54be7ebbd784f7cf7b46c411d5f264615f3b83e00ed8869d748bb81bc232e29f","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"fb7e333c128d0ca925f48c1e1f91cad03ec588dd7dcb00c40e75fb12cc3b9377","revision":1356713544,"schema":"wikilean.articles.article/1","seal":{"created":"2026-11-01T14:25:17Z","schema":"cf-locate-recordset/2","set_id":"tierA-b1b","skill_commit":"d85385aa4eb2818373e9b6b8b41b765ffaf53750","status_rule":3},"source":{"html_sha256":"2fb0c6a2ddb0dd124b566fe69a3a653512aa61ecfb20da46cf84dd409dd24068","layer_sha256":"db6782db8b82c0ef17049a52db69b7d0e8629ba909407b8cd1fec51174dfdd82","renderer":"web-html/3"},"source_id":"enwiki-341442-1356713544","summary":{"by_library":{"lean-core":{"complete":5,"incomplete":0,"locations":5,"passages":3,"related":1},"mathlib":{"complete":59,"incomplete":0,"locations":59,"passages":42,"related":56}},"by_prominence":{"central":{"by_status":{"formalized":11,"not_formalized":2,"partial":2,"statement_only":0,"unresolved":0},"passages":15},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":22,"not_formalized":25,"partial":8,"statement_only":1,"unresolved":0},"passages":56}},"by_proof_status":{"definition":7,"proved":114},"by_relation":{"broadMatch":31,"closeMatch":9,"exactMatch":9,"hasPart":9,"narrowMatch":6,"relatedMatch":57},"by_status":{"formalized":34,"not_formalized":27,"partial":10,"statement_only":1,"unresolved":0},"locations":64,"passages":72,"related":57},"supplements":{"audit_summary":{"schema":"wikilean.articles.audit-summary/1","sha256":"53b29c5773caa9a3a339ccb36db38548137820e05477c4eff49dfb63a91b74df"},"passage_text":{"schema":"wikilean.articles.passage-text/1","sha256":"c0c740562cd14bdcabe43ac1d7ba81039d8e41ef850fd199d7151de6bb774885"},"provenance":{"schema":"wikilean.articles.provenance/1","sha256":"ea245b590ba9078bc0b79003dc1e311dc1421475fe49483e3e3a905ed7c7ec4e"},"reader_html":{"schema":"wikilean.articles.reader-html/1","sha256":"738196c11695087fc8e74590f5ac362acd61af48a8950c0a049559dd3902d2df"},"signatures":{"corpus_built":"2026-10-18T06:14:30Z","corpus_sha256":"a364fd6aede529da1c9f2fa13fda6230a26381f27dafc8801c4205e2b5cf5221","schema":"wikilean.articles.signatures/1","sha256":"2ebb5eebf8b2ebd1f615518abce6169661140cc54d5fcad5f4443150cc62d874","universe":"u1"}},"title":"Cantor's theorem","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q474881"}
