Preliminary: these links have not yet had an independent audit.
Predicate (logic)
18 passages·✓8 formalized·◐1 statement only·◔3 partial·✕6 not formalized
More ways to filter
Library
TauCeti related only
About this page
This page
Wikipedia revision 1366978755, pinned: the text here is that revision, not today's article.
WikiProject Mathematics: Start-class, High importance
18 passages checked, 24 Lean locations (and 10 related declarations).
Central statements: 4 of the 18 passages state the article's subject or a named result or definition; the other 14 are supporting (examples, setup). Of these 4: ✓2 formalized,◐1 statement only,◔1 partial.
✓ Formalized a Lean declaration states it, proved, or a Lean definition defines it
◐ Statement only Lean states it, but the proof is not finished
◔ Partial Lean states part of it, or a more general or special form
✕ Not formalized searched every library and not found
Libraries searched
Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).
How these links were made
Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location on a central or subject passage (7 locations); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 10 of 17 locations and 1 of 6 absences. In all, 17 of 24 Lean locations (71%) and 1 of 6 absences (17%) were re-checked.
Passage text: 18 of 18 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.
How the text is shown
Each passage is shown in full, as revision 1366978755 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.
Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.
Passages
What “exact match”, “more general” and the other labels mean
exact match states the passage exactly
close match states it up to a convention or a difference the note names
more general states a more general result, which implies it
special case states a special case of it
states part states one part of it
related states something related but different; never counted
Definition · Subject of the article
✓Formalized
Formalized: Mathlib states a more general result (a definition).
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.
Why more general: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Formalized: Mathlib states a more general result (proved).
For instance, in the first-order formula P(a), the symbol P is a predicate that applies to the individual constant a which evaluates to either true or false.
Why more general: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why only part: The construction alone makes the formula and says nothing about its truth value in any interpretation.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why more general: The declaration accepts arbitrary terms in the two argument places, where the passage uses individual constants.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why more general: This is the same construction at an arbitrary arity, so it covers the passage's binary case among all the others.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why more general: 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`.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why a special case: This is the passage read at one particular language and one particular predicate rather than at an arbitrary one.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Formalized: Mathlib states a more general result (proved).
For instance, in a standard semantics for first-order logic, the formula R(a, b) would be true on an interpretation if the entities denoted by a and b stand in the relation denoted by R
Why more general: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
FirstOrder.Language.Formula.realize_relmore general
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)
Why more general: This is the same truth condition at an arbitrary arity, covering the passage's binary case among the rest.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 4 candidates examined (receipt 61d1468b6a8a).
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: upheld.
Partial: Mathlib states part of this (a definition).
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.
Why only part: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 83245ab.
Why close, not exact: Lean defines Eq as an inductive type whose unique constructor is reflexivity (Eq.refl) and whose eliminator is substitution, so equality is characterized solely by those two properties, as the passage says. Convention difference: Lean's eliminator substitutes into any type family (a dependent recursor), not only into formulas as in a first-order substitution schema.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
Why only part: It gives reflexivity alone and says nothing about substitution or about the sufficiency of the two together.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
Why only part: It gives the substitution property alone, without reflexivity and without the claim that the two characterise equality.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
Why only part: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why only part: Lean's core proof of this theorem goes through reflexivity and the substitution principle, as the passage describes.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
Why only part: Like symmetry, this is derived in Lean's prelude rather than assumed.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
How it differs: This is the substitution principle the passage starts from, rather than one of the properties it says follow from it.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit c9afcdd.
Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 99bebdf6081e).
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
ZFSet.ext_iffrelated
theorem ZFSet.ext_iff{x y : ZFSet} :x = y ↔∀ (z : ZFSet),z ∈ x ↔z ∈ y
How it differs: It is extensionality for the library's model of set theory, fixing equality of two sets by their members.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: It gives membership in the power set of a ZFSet, another of the facts the library proves about its model.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Definition · main statement · Predicates in different systems
◔Partial
Partial: Mathlib states a special case (a Prop-valued definition: it states the claim without proving it).
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.
Why a special case: Mathlib gives this for formulas of a first-order language, which are one kind of the assertions with variables the passage describes.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why a special case: The passage's notion is not tied to a first-order language, while this type is.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 23d8e434c7a4).
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Related, but states something else
FirstOrder.Language.Relations.formularelated
def FirstOrder.Language.Relations.formula{L : FirstOrder.Language}{α : Type u'}{n : ℕ} :L.Relations n →(Fin n → L.Term α) →L.Formula α
How it differs: It builds a formula from a relation symbol of any arity in a first-order language, with no propositional atoms in sight.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: It says which first-order formulas count as atomic, namely equalities and applications of relation symbols.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why only part: Relations.formula applies an n-ary relation symbol to n terms and returns the resulting formula, which is the passage's clause about forming an atomic formula (Mathlib's IsAtomic counts these as atomic). It does not define what a predicate is: in Mathlib the relation symbols themselves are the family L.Relations n of a language. So it states one clause of the passage.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
FirstOrder.Language.Relations.boundedFormulastates part
def FirstOrder.Language.Relations.boundedFormula{L : FirstOrder.Language}{α : Type u'}{n l : ℕ} :L.Relations n →(Fin n → L.Term (α ⊕ Fin l)) →L.BoundedFormula α l
Why only part: Relations.boundedFormula applies an n-ary relation symbol to n terms (which may also mention bound variables) and returns the formula built by BoundedFormula.rel, which Mathlib's IsAtomic counts as atomic. That covers the passage's clause about forming an atomic formula, but it does not define what a predicate is; Mathlib's relation symbols are the family L.Relations n of a language.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why close, not exact: L.Relations n is the type of n-ary relation symbols of a first-order language L. Equality is built into the syntax separately, so these are the non-logical relation symbols. BoundedFormula.rel applies one to n terms, and IsAtomic counts the result as atomic. The difference is packaging: Mathlib groups the symbols by arity in a family attached to the language, where the passage gives each predicate its own arity.
How it differs: It says which formulas are atomic, covering equalities alongside applications of relation symbols.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: It defines a language as families of function and relation symbols indexed by arity.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 4 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Definition · supporting · Predicates in different systems
✓Formalized
Formalized: Mathlib states this up to a convention difference (a definition).
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).
Why close, not exact: 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.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, medium confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Why close, not exact: Mathlib packages the identification of a set with its truth-valued membership function as an equivalence carrying both directions at once.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, medium confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: It links membership in a set with the indicator taking the value true.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, high confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Note: Mathlib's braces notation elaborates to this function, which turns a predicate into the set it defines.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 1 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: Set.mem_setOf_eq, now a deprecated alias of Set.mem_ofPred_eq, says that x belongs to the set built by set-builder notation from p exactly when p x holds. It is the unfolding lemma for the notation, not the notation or the set-forming construction itself, which is Set.ofPred (setOf).
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 2 for this passage, high confidence.
Re-checked by Claude Opus 5 (claude-opus-5) on 1 Nov 2026 (UTC), challenge run chal-tierA-b1 by jack: it survived.
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
How it differs: This is the parser declaration for the braces syntax, which elaborates to a set or to a finite set according to context.
Details
Found by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: candidate 3 for this passage, medium confidence.
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Record set tierA-b1b, exported 1 Nov 2026 by formal-companion d85385a.
Lean code: the declaration's type as Lean prints it, laid out as a header (the corpus keeps no hypothesis names), from the declaration corpus of universe u1 at commit 3dfb8e2.
Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 7aa127176754).
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt f550227d6df3).
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).
Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 3 candidates examined (receipt e66ec497531f).
Not re-checked: sampled out of challenge run chal-tierA-b1 by jack, in which Claude Opus 5 (claude-opus-5) re-checked a sample on 1 Nov 2026 (UTC).