{"assessment":{"class":"Start","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":285109,"passages":[{"absence":null,"basis":"3a50fe09c679a3814987817b3b862837b8a9617beac61b8c04dc4985ea9afdf6","coverage":null,"id":"enwiki-285109-1366978755::In-text #a92130fc","item":"In-text #a92130fc","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language","end_line":63,"library":"mathlib","line":59,"location_key":"3a50fe09c679a3814987817b3b862837b8a9617beac61b8c04dc4985ea9afdf6","module":"Mathlib.ModelTheory.Basic","note":"The declaration packages the relation symbols together with the function symbols of the language, which the passage does not discuss; the predicates are the relation part, and they are bare data.","pair_key":"6407e429d2e1a90c27a3f453ff9da060f2e0462dcfda435304d20f68967be95c","path":"Mathlib/ModelTheory/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure FirstOrder.Language"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"dce46a12bcc9d5831510b999fe59c4ddfa991d32ee096ee3590f97f7215071b8","prominence":"subject","quote":{"exact":"In logic, a predicate is a non-logical symbol that represents a property"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In logic, a predicate is a non-logical symbol that represents a property or a relation, though, formally, does not need to represent anything at all.","segments":[{"text":"In logic, a predicate is a non-logical symbol that represents a property or a relation, though, formally, does not need to represent anything at all."}]},"unresolved":null},{"absence":null,"basis":"15429ce740fd8e53a9044f30658122ee2b182595094a426408c58371cebd381c","coverage":null,"id":"enwiki-285109-1366978755::In-text #a5e7560c","item":"In-text #a5e7560c","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.Formula.realize_rel₁","end_line":561,"library":"mathlib","line":557,"location_key":"15429ce740fd8e53a9044f30658122ee2b182595094a426408c58371cebd381c","module":"Mathlib.ModelTheory.Semantics","note":"Lean sends the realized formula into `Prop`, the type of truth values, and the declaration says which value it takes; it allows any term where the passage uses a single individual constant.","pair_key":"a38fece98387ba5868ad1329183870026e470e6f95a134e7ed32265eeb36cb10","path":"Mathlib/ModelTheory/Semantics.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FirstOrder.Language.Formula.realize_rel₁ {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} {v : α → M} {R : L.Relations 1} {t : L.Term α} : (R.formula₁ t).Realize v ↔ FirstOrder.Language.Structure.RelMap R ![FirstOrder.Language.Term.realize v t]"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Relations.formula₁","end_line":358,"library":"mathlib","line":357,"location_key":"41338ce18dcf599d036297b6d9e42439384330bdccffb14d2d5fdffc635aa945","module":"Mathlib.ModelTheory.Syntax","note":"The construction alone makes the formula and says nothing about its truth value in any interpretation.","pair_key":"dc797a0a66852dfbe60050f9c0b014c066e100c3f28f5f5b0042654efee80728","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Relations.formula₁ {L : FirstOrder.Language} {α : Type u'} : L.Relations 1 → L.Term α → L.Formula α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"fc2aef9564e679cb8885fcbeb0238b3ed2555fb3e3a28a5f896b7b84b95f18a3","prominence":"supporting","quote":{"exact":"For instance, in the first-order formula P ( a ) {\\displaystyle P(a)}"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"For instance, in the first-order formula P ( a ) {\\displaystyle P(a)} , the symbol P {\\displaystyle P} is a predicate that applies to the individual constant a {\\displaystyle a} which evaluates to either true or false.","segments":[{"text":"For instance, in the first-order formula "},{"tex":"P(a)"},{"text":" , the symbol "},{"tex":"P"},{"text":" is a predicate that applies to the individual constant "},{"tex":"a"},{"text":" which evaluates to either true or false."}]},"unresolved":null},{"absence":null,"basis":"f8a2cd0da840a86ad48f907ee49338766ec8f1a1098e3f830f9877880f18cdb7","coverage":null,"id":"enwiki-285109-1366978755::In-text #6fb220d6","item":"In-text #6fb220d6","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Relations.formula₂","end_line":362,"library":"mathlib","line":361,"location_key":"f8a2cd0da840a86ad48f907ee49338766ec8f1a1098e3f830f9877880f18cdb7","module":"Mathlib.ModelTheory.Syntax","note":"The declaration accepts arbitrary terms in the two argument places, where the passage uses individual constants.","pair_key":"0c9b3e5b2cc253746815354655575ad173a839559cafd6cdc86583c7be48c4fb","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Relations.formula₂ {L : FirstOrder.Language} {α : Type u'} : L.Relations 2 → L.Term α → L.Term α → L.Formula α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Relations.formula","end_line":354,"library":"mathlib","line":353,"location_key":"13f5e5c1f7c125f81898eecde8ad04188426f669f20b0b2f20c487f732aaab8a","module":"Mathlib.ModelTheory.Syntax","note":"This is the same construction at an arbitrary arity, so it covers the passage's binary case among all the others.","pair_key":"0c3f615f7a538d03bedfd641b6290faadbad98f5be3d9c514b8c8edd7310650f","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Relations.formula {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.Relations n → (Fin n → L.Term α) → L.Formula α"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"b5333e948b6e84daf6cc2609bf7c1787ced5ec0dd1cb31b22eecc970c91d45fe","prominence":"supporting","quote":{"exact":"Similarly, in the formula R ( a , b ) {\\displaystyle R(a,b)}"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"Similarly, in the formula R ( a , b ) {\\displaystyle R(a,b)} , the symbol R {\\displaystyle R} is a predicate that applies to the individual constants a {\\displaystyle a} and b {\\displaystyle b} .","segments":[{"text":"Similarly, in the formula "},{"tex":"R(a,b)"},{"text":" , the symbol "},{"tex":"R"},{"text":" is a predicate that applies to the individual constants "},{"tex":"a"},{"text":" and "},{"tex":"b"},{"text":" ."}]},"unresolved":null},{"absence":null,"basis":"131416b61c099a2a6162d148cef4dbd1ac9f6a49491746124e7fe4b72efd4685","coverage":null,"id":"enwiki-285109-1366978755::In-text #b41b0a88","item":"In-text #b41b0a88","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Structure","end_line":161,"library":"mathlib","line":155,"location_key":"131416b61c099a2a6162d148cef4dbd1ac9f6a49491746124e7fe4b72efd4685","module":"Mathlib.ModelTheory.Basic","note":"The class also interprets the function symbols of the language, which the passage does not mention, and it presents an n-ary relation on the domain as a map from tuples indexed by `Fin n` into `Prop`.","pair_key":"f86a90892c6815336a9fd5b0d764f518d9422945195cd3654f970be0ec86d38c","path":"Mathlib/ModelTheory/Basic.lean","proof_status":"definition","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"class FirstOrder.Language.Structure : FirstOrder.Language → Type w → Type (max (max u v) w)"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"SimpleGraph.structure","end_line":58,"library":"mathlib","line":57,"location_key":"ee43ad24b657b606ae0c15070cf998e05219acf6c8bb19483d249e41f56c7976","module":"Mathlib.ModelTheory.Graph","note":"This is the passage read at one particular language and one particular predicate rather than at an arbitrary one.","pair_key":"e8792467d3ce939088c52979e262b9c08c746d338598c4ee271ef07705ce13c0","path":"Mathlib/ModelTheory/Graph.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def SimpleGraph.structure {V : Type u} : SimpleGraph V → FirstOrder.Language.graph.Structure V"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"c0019172b9d13fba59e4a869f20638ca1da2cc7e24a606e131e4f2e62ffb79d1","prominence":"central","quote":{"exact":"In the semantics of logic, predicates are interpreted as relations."},"quote_capped":false,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In the semantics of logic, predicates are interpreted as relations.","segments":[{"text":"In the semantics of logic, predicates are interpreted as relations."}]},"unresolved":null},{"absence":null,"basis":"e32e49215b8c3e3b202a357ef383aa10ffdf41081b56854ac1a5bbd6f7ebf8de","coverage":null,"id":"enwiki-285109-1366978755::In-text #e7384e24","item":"In-text #e7384e24","kind":"example","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Formula.realize_rel₂","end_line":569,"library":"mathlib","line":564,"location_key":"e32e49215b8c3e3b202a357ef383aa10ffdf41081b56854ac1a5bbd6f7ebf8de","module":"Mathlib.ModelTheory.Semantics","note":"The declaration allows arbitrary terms in the two places, where the passage uses individual constants, and it reads the values of those terms under the assignment that the interpretation fixes.","pair_key":"87240f09822eac86af7ba9df12785c30cac552cb6c936707554eb5b51efd52fc","path":"Mathlib/ModelTheory/Semantics.lean","proof_status":"proved","rank":1,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FirstOrder.Language.Formula.realize_rel₂ {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} {v : α → M} {R : L.Relations 2} {t₁ t₂ : L.Term α} : (R.formula₂ t₁ t₂).Realize v ↔ FirstOrder.Language.Structure.RelMap R ![FirstOrder.Language.Term.realize v t₁, FirstOrder.Language.Term.realize v t₂]"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Formula.realize_rel","end_line":554,"library":"mathlib","line":552,"location_key":"27df69cdc2b884514399f248d0d20bb6f6bded268ad452348d6f5c8f09cfb98c","module":"Mathlib.ModelTheory.Semantics","note":"This is the same truth condition at an arbitrary arity, covering the passage's binary case among the rest.","pair_key":"0aa42b94dc32f27e94a4c4407400e1f00ded9f3ff19512b3bb8fc4eea7f8a202","path":"Mathlib/ModelTheory/Semantics.lean","proof_status":"proved","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem FirstOrder.Language.Formula.realize_rel {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} {v : α → M} {k : ℕ} {R : L.Relations k} {ts : Fin k → L.Term α} : (R.formula ts).Realize v ↔ FirstOrder.Language.Structure.RelMap R fun i ↦ FirstOrder.Language.Term.realize v (ts i)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2f7766877890313f37b021fd8bf3373fb3570e9a5e70593740919e7bf5a8d809","prominence":"supporting","quote":{"exact":"For instance, in a standard semantics for first-order logic, the formula R"},"quote_capped":true,"section":[],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"For instance, in a standard semantics for first-order logic, the formula R ( a , b ) {\\displaystyle R(a,b)} would be true on an interpretation if the entities denoted by a {\\displaystyle a} and b {\\displaystyle b} stand in the relation denoted by R {\\displaystyle R}","segments":[{"text":"For instance, in a standard semantics for first-order logic, the formula "},{"tex":"R(a,b)"},{"text":" would be true on an interpretation if the entities denoted by "},{"tex":"a"},{"text":" and "},{"tex":"b"},{"text":" stand in the relation denoted by "},{"tex":"R"}]},"unresolved":null},{"absence":{"challenge":"survived","libraries":48,"receipt":{"candidates":4,"queries":4,"sha256":"61d1468b6a8aa2899ab3111dc39baf26544d78a4b1830153e4da14847dde44db"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-285109-1366978755::In-text #d051e7b8","item":"In-text #d051e7b8","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"4f80f8a0bd37e6a1b6a859926f700b0d3a25e2733808ee7cfc5841bf71f699b7","prominence":"supporting","quote":{"exact":"they can denote different relations depending on the interpretation given to them."},"quote_capped":false,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"before":{"layer":"Since predicates are non-logical symbols, ","segments":[{"text":"Since predicates are non-logical symbols, "}]},"layer":"they can denote different relations depending on the interpretation given to them.","segments":[{"text":"they can denote different relations depending on the interpretation given to them."}]},"unresolved":null},{"absence":null,"basis":"dd8356ab904b10279131c23e9bfb35dc1d09260c6cb642044e0b2da7e8b096e3","coverage":null,"id":"enwiki-285109-1366978755::In-text #62334d92","item":"In-text #62334d92","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.BoundedFormula","end_line":316,"library":"mathlib","line":309,"location_key":"dd8356ab904b10279131c23e9bfb35dc1d09260c6cb642044e0b2da7e8b096e3","module":"Mathlib.ModelTheory.Syntax","note":"The inductive type fixes the first-order case; it makes no claim about logics whose predicates take collections of objects as arguments, so the second conjunct is left unstated.","pair_key":"10d7fa0200c1b92caadcecdb235173684d109b57af2e4755081b3b20413d233b","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"inductive FirstOrder.Language.BoundedFormula : FirstOrder.Language → Type u' → ℕ → Type (max u v u')"},"statement":false},{"challenge":"sampled_out","commit":"83245abb3e4a4377e8d779ac045363a90c7e3a86","confidence":"medium","declaration":"FirstOrder.Language.BoundedFormulaInf","end_line":87,"library":"tauceti","line":72,"location_key":"8f2cc6ff6eb965e0e02314379972b0e0ec1319074b249bb6f7f4e2cbf9f72a44","module":"TauCeti.ModelTheory.Infinitary.Syntax","note":"An infinitary logic that adds conjunctions and disjunctions branching over an index type; its predicates are still applied to terms, so it is not a logic whose predicates take collections of objects as arguments.","pair_key":"fac9b652a0c11715ccb3e0ccaa6bd36e1ad5c6d39523c783dc0171794e5ae416","path":"TauCeti/ModelTheory/Infinitary/Syntax.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/TauCetiProject/TauCeti","signature":{"elided":false,"text":"inductive FirstOrder.Language.BoundedFormulaInf : FirstOrder.Language → Type uι → Type u' → ℕ → Type (max u v u' uι)"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"8582695b691f84d4b4d8a71d5b0660ace1532447b4a2fd8079e56b0106a2d1c2","prominence":"supporting","quote":{"exact":"While first-order logic only includes predicates that apply to individual objects, other"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"While first-order logic only includes predicates that apply to individual objects, other logics may allow predicates that apply to collections of objects defined by other predicates.","segments":[{"text":"While first-order logic only includes predicates that apply to individual objects, other logics may allow predicates that apply to collections of objects defined by other predicates."}]},"unresolved":null},{"absence":null,"basis":"89a4e8756027fa113da37d6977b5f217501443fbc5a34ac2e715192af534b786","coverage":null,"id":"enwiki-285109-1366978755::In-text #8785ae6a","item":"In-text #8785ae6a","kind":"example","locations":[{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Eq","end_line":76,"library":"lean-core","line":73,"location_key":"89a4e8756027fa113da37d6977b5f217501443fbc5a34ac2e715192af534b786","module":"Init.Prelude","note":"The declaration realizes the two properties the passage names, reflexivity as the introduction rule and substitution as the elimination rule, but it states no claim that these two suffice.","pair_key":"c400723662096c75944a0a967682abf7c8448bf9538206e6f805b0a08373022e","path":"src/Init/Prelude.lean","proof_status":"definition","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"inductive Eq {α : Sort u_1} : α → α → Prop"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"rfl","end_line":343,"library":"lean-core","line":343,"location_key":"579683df3d5cd882f84f861e9c088083cbb06adbe77d5b863041f165531fdd2a","module":"Init.Prelude","note":"It gives reflexivity alone and says nothing about substitution or about the sufficiency of the two together.","pair_key":"f6cb82fd7034a15df3c918a4b22eb3ebdb9d86ccec0f945771a5da5fca2feb86","path":"src/Init/Prelude.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"def rfl {α : Sort u} {a : α} : a = a"},"statement":false},{"challenge":"survived","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Eq.subst","end_line":362,"library":"lean-core","line":361,"location_key":"eccc872c00c46d45aaeea397f0bf8fe4587da4c283234057434c5a9d6be98af2","module":"Init.Prelude","note":"It gives the substitution property alone, without reflexivity and without the claim that the two characterise equality.","pair_key":"b6afe8fbe8f30ebcfa32e0dcbb29d67f6059b396e72e9fde1a8121206b6b169c","path":"src/Init/Prelude.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"f58e588fd1b4aa4b89073cb71e82e95b3fe6b0609744eb8fa799278e7aa6ce8c","prominence":"supporting","quote":{"exact":"For example, equality may be understood solely through its reflexive and substitution"},"quote_capped":true,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"For example, equality may be understood solely through its reflexive and substitution properties (cf. Equality (mathematics) § Axioms).","segments":[{"text":"For example, equality may be understood solely through its reflexive and substitution properties (cf. Equality (mathematics) § Axioms)."}]},"unresolved":null},{"absence":null,"basis":"f7ec378465455e088d4ddcfa6091bf801f06677b9bdae985124d868db75337f5","coverage":null,"id":"enwiki-285109-1366978755::In-text #b147b05f","item":"In-text #b147b05f","kind":"theorem","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"eq_equivalence","end_line":465,"library":"mathlib","line":464,"location_key":"f7ec378465455e088d4ddcfa6091bf801f06677b9bdae985124d868db75337f5","module":"Mathlib.Basic.Logic.Basic","note":"Mathlib records the three properties of Eq as one Equivalence structure; the claim that they are derivable from reflexivity and substitution is itself left outside the statement.","pair_key":"98c327bd345950874921723c0daf0a582dd3aa27e939246ec0b310a4789f4f66","path":"Mathlib/Basic/Logic/Basic.lean","proof_status":"proved","rank":1,"relation":"hasPart","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem eq_equivalence {α : Sort*} : Equivalence Eq"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Eq.symm","end_line":373,"library":"lean-core","line":372,"location_key":"6d751dd54c0f4b43b851b54f83bbb2d1746bd3a7691b55f23b6885f7f479715b","module":"Init.Prelude","note":"Lean's core proof of this theorem goes through reflexivity and the substitution principle, as the passage describes.","pair_key":"34b196754cd5666a3357c2ce529cd683335955db37bff39d93c987f4149d7838","path":"src/Init/Prelude.lean","proof_status":"proved","rank":2,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.symm {α : Sort u} {a b : α} : a = b → b = a"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"medium","declaration":"Eq.trans","end_line":389,"library":"lean-core","line":388,"location_key":"3bca4116b242bcc5cdc909c8e771083507a03419230ed361ff9f748ae7ed2c39","module":"Init.Prelude","note":"Like symmetry, this is derived in Lean's prelude rather than assumed.","pair_key":"d5f085447672c6f26fce7be22cbb3bd8ade5268bc8cc2ca73717c442d92b2394","path":"src/Init/Prelude.lean","proof_status":"proved","rank":3,"relation":"hasPart","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.trans {α : Sort u} {a b c : α} : a = b → b = c → a = c"},"statement":false},{"challenge":"sampled_out","commit":"c9afcddf514a6772bd4d649f7cfc04eff0b9f15e","confidence":"high","declaration":"Eq.subst","end_line":362,"library":"lean-core","line":361,"location_key":"1a3de635b692226dd73d9968cd3501b1125d984510f784e312faef49ba8ad7d6","module":"Init.Prelude","note":"This is the substitution principle the passage starts from, rather than one of the properties it says follow from it.","pair_key":"d1b402c0d067d711b139c126f77a48e31c9cc223c754ec9da6474144d450ab32","path":"src/Init/Prelude.lean","proof_status":"proved","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover/lean4","signature":{"elided":false,"text":"theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"5510e0c5a083f194c6308b623bbb4e8c604170912579328d4ddae28c4f4cf424","prominence":"supporting","quote":{"exact":"Other properties can be derived from these"},"quote_capped":false,"section":[],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"after":{"layer":", and they are sufficient for proving theorems in mathematics.","segments":[{"text":", and they are sufficient for proving theorems in mathematics."}]},"layer":"Other properties can be derived from these","segments":[{"text":"Other properties can be derived from these"}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":4,"sha256":"99bebdf6081e96e63dabb0043e7ad46a365dc5822e60383b6ddfa7dc856ea7e8"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-285109-1366978755::In-text #16e860c7","item":"In-text #16e860c7","kind":"example","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFSet.ext_iff","end_line":186,"library":"mathlib","line":186,"location_key":"88e58840ba7db43e806c8e7586eb98e98fbfe670cdeadd700ecd4f80af62c91d","module":"Mathlib.SetTheory.ZFC.Basic","note":"It is extensionality for the library's model of set theory, fixing equality of two sets by their members.","pair_key":"fa1dddcc42ff9c85b9e3249edb187df8c4160f992f6a905058040aad6c134370","path":"Mathlib/SetTheory/ZFC/Basic.lean","proof_status":"proved","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"theorem ZFSet.ext_iff {x y : ZFSet} : x = y ↔ ∀ (z : ZFSet), z ∈ x ↔ z ∈ y"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"ZFSet.mem_powerset","end_line":414,"library":"mathlib","line":413,"location_key":"d9bcf1331b3024c60be905964681e60e9ee97b95ba0bed73a41c6b2bc79940ab","module":"Mathlib.SetTheory.ZFC.Basic","note":"It gives membership in the power set of a ZFSet, another of the facts the library proves about its model.","pair_key":"10e0dbb2477dfec67c59562d4f9e97c12501495ec5aa532d0d116f0b74906986","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":"b1bc1ba57cbd145b4e22b45aaa2190af62434787fc6a5fa55653d9d42a5ae611","prominence":"supporting","quote":{"exact":"Similarly, set membership can be understood solely through the axioms of Zermelo–Fraenkel"},"quote_capped":true,"section":[],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"Similarly, set membership can be understood solely through the axioms of Zermelo–Fraenkel set theory.","segments":[{"text":"Similarly, set membership can be understood solely through the axioms of Zermelo–Fraenkel set theory."}]},"unresolved":null},{"absence":null,"basis":"5e4064ebc3371c40ccb46184d3e369f61c7f5752b8e09693bc603fe044361afa","coverage":null,"id":"enwiki-285109-1366978755::In-text #ee0a8ed4","item":"In-text #ee0a8ed4","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.Formula.Realize","end_line":527,"library":"mathlib","line":526,"location_key":"5e4064ebc3371c40ccb46184d3e369f61c7f5752b8e09693bc603fe044361afa","module":"Mathlib.ModelTheory.Semantics","note":"Mathlib gives this for formulas of a first-order language, which are one kind of the assertions with variables the passage describes.","pair_key":"7c6385fdd17900b1a536c074b763caedba69c7b9379f0ceda2dde6d378c513f1","path":"Mathlib/ModelTheory/Semantics.lean","proof_status":"definition","rank":1,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Formula.Realize {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} : L.Formula α → (α → M) → Prop"},"statement":true},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.Formula","end_line":321,"library":"mathlib","line":320,"location_key":"85cc78f54247ff876aa6c58e59da3dbc063022d0d858f3d2a0652be7f7dad8dd","module":"Mathlib.ModelTheory.Syntax","note":"The passage's notion is not tied to a first-order language, while this type is.","pair_key":"7cd615b4547e8e289526df1ceaf3012cc578af4b9f498e709c631b1397a85a6b","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":2,"relation":"narrowMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"abbrev FirstOrder.Language.Formula : FirstOrder.Language → Type u' → Type (max u v u')"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"79b883f8298797a551755cc100310fb6910fe1544524a1db1ae9637136073d77","prominence":"central","quote":{"exact":"A predicate is a statement or mathematical assertion that contains variables, sometimes"},"quote_capped":true,"section":["Predicates in different systems"],"status":"partial","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"A predicate is a statement or mathematical assertion that contains variables, sometimes referred to as predicate variables, and may be true or false depending on those variables’ value or values.","segments":[{"text":"A predicate is a statement or mathematical assertion that contains variables, sometimes referred to as predicate variables, and may be true or false depending on those variables’ value or values."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"23d8e434c7a477ea7ddadb4584d792be8c146f2491ce3238888be884e964c4bd"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-285109-1366978755::In-text #974eb90b","item":"In-text #974eb90b","kind":"definition","locations":[{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.Relations.formula","end_line":354,"library":"mathlib","line":353,"location_key":"d2eb2cf4db2610252818cd48ae1cf640a5a67b7290e8e21f80f369addbcb85d2","module":"Mathlib.ModelTheory.Syntax","note":"It builds a formula from a relation symbol of any arity in a first-order language, with no propositional atoms in sight.","pair_key":"439d38740986c31b84090ffed6b9eb3156f99ba83cb2f427baf0758308dfc2cc","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":1,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Relations.formula {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.Relations n → (Fin n → L.Term α) → L.Formula α"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"FirstOrder.Language.BoundedFormula.IsAtomic","end_line":53,"library":"mathlib","line":50,"location_key":"8feff7e7672b6cb8324cdc18cc826a49e95820da4162452ec5be2fd45d95efbc","module":"Mathlib.ModelTheory.Complexity","note":"It says which first-order formulas count as atomic, namely equalities and applications of relation symbols.","pair_key":"5871b763c4e687e0cf147d34fbec34a4f8fbcae11ad2a92977ef130a863bbb1f","path":"Mathlib/ModelTheory/Complexity.lean","proof_status":"definition","rank":2,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"inductive FirstOrder.Language.BoundedFormula.IsAtomic {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.BoundedFormula α n → Prop"},"statement":false}],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"15e90f312ea608f9d35a7fe2bd7cc2df374de57e19c8bc4606eb01b1239a1826","prominence":"supporting","quote":{"exact":"In propositional logic, atomic formulas are sometimes regarded as zero-place predicates.[1] In"},"quote_capped":true,"section":["Predicates in different systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In propositional logic, atomic formulas are sometimes regarded as zero-place predicates.[1] In a sense, these are nullary (i.e. 0-arity) predicates.","segments":[{"text":"In propositional logic, atomic formulas are sometimes regarded as zero-place predicates."},{"ref":"[1]"},{"text":" In a sense, these are nullary (i.e. 0-arity) predicates."}]},"unresolved":null},{"absence":null,"basis":"97bd0a1ea85427e23ba7dccbe58c2247b9b52fd9397fa561fd02487dd8a1edb1","coverage":null,"id":"enwiki-285109-1366978755::In-text #fcc7ef15","item":"In-text #fcc7ef15","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Relations.formula","end_line":354,"library":"mathlib","line":353,"location_key":"97bd0a1ea85427e23ba7dccbe58c2247b9b52fd9397fa561fd02487dd8a1edb1","module":"Mathlib.ModelTheory.Syntax","note":"Mathlib encodes the arity-n relation symbols of a language as the family L.Relations n and their arguments as an n-tuple of terms, and IsAtomic classifies the resulting formula as atomic.","pair_key":"fdb52564fe54bfaf50078fa58c05ad88c11f99c33f347aec2cfd386472b2085c","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Relations.formula {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.Relations n → (Fin n → L.Term α) → L.Formula α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.Relations.boundedFormula","end_line":336,"library":"mathlib","line":334,"location_key":"ae5b5cae15af3e07224100fb7504fb671992838d22a4906a4f9fc3e2f5562386","module":"Mathlib.ModelTheory.Syntax","note":"It also allows bound variables in scope, a case beyond the passage with real content of its own.","pair_key":"7d4add9163449be32ca4ac94e2cebc79e54caf7fa818539ccc3edf8a9b9e24d2","path":"Mathlib/ModelTheory/Syntax.lean","proof_status":"definition","rank":2,"relation":"broadMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def FirstOrder.Language.Relations.boundedFormula {L : FirstOrder.Language} {α : Type u'} {n l : ℕ} : L.Relations n → (Fin n → L.Term (α ⊕ Fin l)) → L.BoundedFormula α l"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language.BoundedFormula.IsAtomic","end_line":53,"library":"mathlib","line":50,"location_key":"1f0af6f0db9e133fbfce84fcd09c94bb36ca98b03b3b2664efa0c55392e7e53f","module":"Mathlib.ModelTheory.Complexity","note":"It says which formulas are atomic, covering equalities alongside applications of relation symbols.","pair_key":"fa05c3ea59d81b1bb5bafda6b36d2e4977aef5867b6b1c4e0001a44a58c6f54d","path":"Mathlib/ModelTheory/Complexity.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"inductive FirstOrder.Language.BoundedFormula.IsAtomic {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.BoundedFormula α n → Prop"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"FirstOrder.Language","end_line":63,"library":"mathlib","line":59,"location_key":"61643f80eb6b06da9c04279b277937561424719cca0b7325b4e2fc4471e861a7","module":"Mathlib.ModelTheory.Basic","note":"It defines a language as families of function and relation symbols indexed by arity.","pair_key":"743aed96ceb162244546072eb6f97f4d3f1dc9609970a10540461c71e7bdd44e","path":"Mathlib/ModelTheory/Basic.lean","proof_status":"definition","rank":4,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"structure FirstOrder.Language"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"a9ed8ebb175b2b38a5fff5b62a6a183c17917d637b14dd0cee5a03eb23af88ea","prominence":"central","quote":{"exact":"In first-order logic, a predicate is a non-logical relation symbol, which forms"},"quote_capped":true,"section":["Predicates in different systems"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In first-order logic, a predicate is a non-logical relation symbol, which forms an atomic formula when applied to an appropriate number of terms.","segments":[{"text":"In first-order logic, a predicate is a non-logical relation symbol, which forms an atomic formula when applied to an appropriate number of terms."}]},"unresolved":null},{"absence":null,"basis":"2e7d5a7eb3d9ffa4e679fb0b50eaada2a6237b400c7c161907a4bb49121a6cfa","coverage":null,"id":"enwiki-285109-1366978755::In-text #68da9e87","item":"In-text #68da9e87","kind":"definition","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.boolIndicator","end_line":28,"library":"mathlib","line":27,"location_key":"2e7d5a7eb3d9ffa4e679fb0b50eaada2a6237b400c7c161907a4bb49121a6cfa","module":"Mathlib.Data.Set.BoolIndicator","note":"Mathlib writes the truth values as the two-element type Bool and takes the set inside an ambient type, with the value at x being true exactly when x lies in s.","pair_key":"8ceb5847d864b380fdf3021ce90f18a2eeab8b04d82d86e552ebfb8a19426aaa","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"definition","rank":1,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.boolIndicator {α : Type*} : Set α → α → Bool"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Set.memEquiv","end_line":76,"library":"mathlib","line":74,"location_key":"2d9b2554ae71ca78fd6540e11c9727d16757a30c55885fc1728f7d1d0ea7b151","module":"Mathlib.Data.Set.Basic","note":"Mathlib packages the identification of a set with its truth-valued membership function as an equivalence carrying both directions at once.","pair_key":"923054553384bb519e34499e5c9d392eb0c9938096b0dc58dbf9dd85c12ed0c1","path":"Mathlib/Data/Set/Basic.lean","proof_status":"definition","rank":2,"relation":"closeMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Set.memEquiv {α : Type u} : Set α ≃ (α → Prop)"},"statement":false},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.mem_iff_boolIndicator","end_line":32,"library":"mathlib","line":30,"location_key":"557db215db54b5e9628f6c31202dbf90f2d2c17984338161efca9505b9577dac","module":"Mathlib.Data.Set.BoolIndicator","note":"It links membership in a set with the indicator taking the value true.","pair_key":"748814b61c434c618b8147efd8220e89c1b999e0d0ffc8083993bbd8c6d6b481","path":"Mathlib/Data/Set/BoolIndicator.lean","proof_status":"proved","rank":3,"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":"de813412154351b46333885a16e8487b58a000d74ada8d3aa460a161a5ec7933","prominence":"supporting","quote":{"exact":"In set theory with the law of excluded middle, predicates are understood"},"quote_capped":true,"section":["Predicates in different systems"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In set theory with the law of excluded middle, predicates are understood to be characteristic functions or set indicator functions (i.e., functions from a set element to a truth value).","segments":[{"text":"In set theory with the law of excluded middle, predicates are understood to be characteristic functions or set indicator functions (i.e., functions from a set element to a truth value)."}]},"unresolved":null},{"absence":null,"basis":"c7e146a28c00fb43e33cb0011977c5db367280eabef90734182c0e34a8fd043d","coverage":null,"id":"enwiki-285109-1366978755::In-text #a53297b9","item":"In-text #a53297b9","kind":"notation","locations":[{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"setOf","end_line":66,"library":"mathlib","line":66,"location_key":"c7e146a28c00fb43e33cb0011977c5db367280eabef90734182c0e34a8fd043d","module":"Mathlib.Data.Set.Defs","note":"Mathlib's braces notation elaborates to this function, which turns a predicate into the set it defines.","pair_key":"dc0e91197b0423f98f6b09cea15a6524221868285228b3c56c70a71282f433ea","path":"Mathlib/Data/Set/Defs.lean","proof_status":"definition","rank":1,"relation":"exactMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"deprecated_to":"Set.ofPred","elided":false,"text":"def setOf {α : Type u} : (α → Prop) → Set α"},"statement":false},{"challenge":"survived","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"high","declaration":"Set.mem_setOf_eq","end_line":80,"library":"mathlib","line":80,"location_key":"c2075426069b21eb8b89f42c4f9a6cf80919f434e26b90b8f729f1037ecdeb0a","module":"Mathlib.Data.Set.Operations","note":"It unfolds the braces notation, giving the defining equation of the set the notation builds.","pair_key":"3c09ae026141faefcb7238a48fcf614013aa6fc3262cf8e85ff60eb0c93707cb","path":"Mathlib/Data/Set/Operations.lean","proof_status":"proved","rank":2,"relation":"closeMatch","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},{"challenge":"sampled_out","commit":"3dfb8e22b67042b31fac228dee0e1169a1a7820f","confidence":"medium","declaration":"Mathlib.Meta.setBuilder","end_line":109,"library":"mathlib","line":109,"location_key":"16636770b8095bdc98a52e4f9fdf98d06e4ce92ed2371483a897a8f4699cffdd","module":"Mathlib.Data.Set.Defs","note":"This is the parser declaration for the braces syntax, which elaborates to a set or to a finite set according to context.","pair_key":"ec589338ad58147e117c69ab3b5f71457afdda0ed80b960b785d4207fdef0ca2","path":"Mathlib/Data/Set/Defs.lean","proof_status":"definition","rank":3,"relation":"relatedMatch","repo":"https://github.com/leanprover-community/mathlib4","signature":{"elided":false,"text":"def Mathlib.Meta.setBuilder : Lean.ParserDescr"},"statement":false}],"outcome":"located","passage_ends_in_suffix":false,"passage_key":"2613254fb5f55adbbdea0ffbab0ac065401fb069fadf286e43a78a532ebb782c","prominence":"supporting","quote":{"exact":"Set-builder notation makes use of predicates to define sets."},"quote_capped":false,"section":["Predicates in different systems"],"status":"formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"Set-builder notation makes use of predicates to define sets.","segments":[{"text":"Set-builder notation makes use of predicates to define sets."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":0,"queries":3,"sha256":"7aa12717675409f0df84b15a3c8542fecd0b079484eafac1e5f338076f5d0a42"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-285109-1366978755::In-text #ea87bc5b","item":"In-text #ea87bc5b","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"ee4fcb2202f01db05621b9dbeeaf5df02c5983a0c4c7c4c9e5289f5feeb0915d","prominence":"supporting","quote":{"exact":"In autoepistemic logic, which rejects the law of excluded middle, predicates may"},"quote_capped":true,"section":["Predicates in different systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In autoepistemic logic, which rejects the law of excluded middle, predicates may be true, false, or simply unknown.","segments":[{"text":"In autoepistemic logic, which rejects the law of excluded middle, predicates may be true, false, or simply unknown."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"f550227d6df3a2eaaa47afce1c0a3ca815fb0683127504bd638b2ee1ff142d58"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-285109-1366978755::In-text #f036adde","item":"In-text #f036adde","kind":"theorem","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"263c36ddf34a0c5c4e4c46c4f224975146bb51c58ccc0be4e21226040923fdd1","prominence":"supporting","quote":{"exact":"In particular, a given collection of facts may be insufficient to determine"},"quote_capped":true,"section":["Predicates in different systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In particular, a given collection of facts may be insufficient to determine the truth or falsehood of a predicate.","segments":[{"text":"In particular, a given collection of facts may be insufficient to determine the truth or falsehood of a predicate."}]},"unresolved":null},{"absence":{"challenge":"sampled_out","libraries":48,"receipt":{"candidates":3,"queries":5,"sha256":"e66ec497531f361a68595e93c42f8341d1bb7b8da15c7e08c6b78ac34b916483"},"universe":"u1","universe_sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"basis":null,"coverage":null,"id":"enwiki-285109-1366978755::In-text #3d31c176","item":"In-text #3d31c176","kind":"definition","locations":[],"outcome":"absent","passage_ends_in_suffix":false,"passage_key":"93201845704da6f63dad1aad5312d625057e44b417671d9fa24f5ecff821b7b3","prominence":"supporting","quote":{"exact":"In fuzzy logic, the strict true/false valuation of the predicate is replaced"},"quote_capped":true,"section":["Predicates in different systems"],"status":"not_formalized","subject_uri":"https://en.wikipedia.org/w/index.php?curid=285109&oldid=1366978755","text":{"layer":"In fuzzy logic, the strict true/false valuation of the predicate is replaced by a quantity interpreted as the degree of truth.","segments":[{"text":"In fuzzy logic, the strict true/false valuation of the predicate is replaced by a quantity interpreted as the degree of truth."}]},"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":89373,"images":[{"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":"https://phabricator.wikimedia.org/diffusion/GOJU/browse/master/AUTHORS.txt","file":"OOjs_UI_icon_edit-ltr-progressive.svg","licence":"PD","licence_url":null,"project":"en"},{"author":"Newbzy","file":"Square_root_of_x.svg","licence":"GPL","licence_url":"https://www.gnu.org/licenses/gpl.html","project":"commons"}],"marks":104,"passages":18,"sha256":"bd42d57110ac2628e1232b5b1c47b7dfb656714dfd60d970543747347af778a9","unplaced":[]},"record_set":"23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602","records_sha256":"cc32e401ed737737c9ea18b7b097c4e772ff8e2c94f1ffbad7428025d8784143","revision":1366978755,"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":"f681712367158df3f36050312af5cd4db4db30126d964cf72d6bcc9103ecdfa8","layer_sha256":"b532072cf3a5bb755aebdc481b399da03361e92ff3bf0cf773f7f20b750341c9","renderer":"web-html/3"},"source_id":"enwiki-285109-1366978755","summary":{"by_library":{"lean-core":{"complete":5,"incomplete":0,"locations":5,"passages":2,"related":1},"mathlib":{"complete":19,"incomplete":0,"locations":19,"passages":11,"related":8},"tauceti":{"complete":0,"incomplete":0,"locations":0,"passages":0,"related":1}},"by_prominence":{"central":{"by_status":{"formalized":2,"not_formalized":0,"partial":1,"statement_only":0,"unresolved":0},"passages":3},"subject":{"by_status":{"formalized":1,"not_formalized":0,"partial":0,"statement_only":0,"unresolved":0},"passages":1},"supporting":{"by_status":{"formalized":5,"not_formalized":6,"partial":3,"statement_only":0,"unresolved":0},"passages":14}},"by_proof_status":{"definition":21,"proved":13},"by_relation":{"broadMatch":8,"closeMatch":4,"exactMatch":1,"hasPart":8,"narrowMatch":3,"relatedMatch":10},"by_status":{"formalized":8,"not_formalized":6,"partial":4,"statement_only":0,"unresolved":0},"locations":24,"passages":18,"related":10},"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":"Predicate (logic)","universe":{"frozen":"2026-10-17","id":"u1","libraries":48,"sha256":"12e9eacf66816a249dcecba39f20dd7ca977c042af3e6acdb16ac7a45a4a9e76"},"wikidata":"Q1144319"}
