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. Show all
FirstOrder. Language more general
structure FirstOrder.Language
Mathlib.ModelTheory.Basic · lines 59–63
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. Location key 3a50fe09c679 · pair key 6407e429d2e1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✓ Formalized
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. Show all
FirstOrder.Language.Formula. realize_rel₁ more general
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]
Mathlib.ModelTheory.Semantics · lines 557–561
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. Location key 15429ce740fd · pair key a38fece98387.
FirstOrder.Language.Relations. formula₁ states part
def FirstOrder.Language.Relations.formula₁ {L : FirstOrder.Language} {α : Type u'} : L.Relations 1 → L.Term α → L.Formula α
Mathlib.ModelTheory.Syntax · lines 357–358
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. Location key 41338ce18dcf · pair key dc797a0a6685.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
Similarly, in the formula R (a , b ) , the symbol R is a predicate that applies to the individual constants a and b . Show all
FirstOrder.Language.Relations. formula₂ more general
def FirstOrder.Language.Relations.formula₂ {L : FirstOrder.Language} {α : Type u'} : L.Relations 2 → L.Term α → L.Term α → L.Formula α
Mathlib.ModelTheory.Syntax · lines 361–362
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. Location key f8a2cd0da840 · pair key 0c9b3e5b2cc2.
FirstOrder.Language.Relations. formula more general
def FirstOrder.Language.Relations.formula {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.Relations n → (Fin n → L.Term α) → L.Formula α
Mathlib.ModelTheory.Syntax · lines 353–354
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. Location key 13f5e5c1f7c1 · pair key 0c3f615f7a53.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement ✓ Formalized
Formalized: Mathlib states a more general result (a definition).
In the semantics of logic, predicates are interpreted as relations. Show all
FirstOrder.Language. Structure more general
class FirstOrder.Language.Structure : FirstOrder.Language → Type w → Type (max (max u v) w)
Mathlib.ModelTheory.Basic · lines 155–161
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. Location key 131416b61c09 · pair key f86a90892c68.
SimpleGraph. structure special case
def SimpleGraph.structure {V : Type u} : SimpleGraph V → FirstOrder.Language.graph.Structure V
Mathlib.ModelTheory.Graph · lines 57–58
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. Location key ee43ad24b657 · pair key e8792467d3ce.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✓ Formalized
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 Show all
FirstOrder.Language.Formula. realize_rel₂ more general
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₂]
Mathlib.ModelTheory.Semantics · lines 564–569
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. Location key e32e49215b8c · pair key 87240f09822e.
FirstOrder.Language.Formula. realize_rel more 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)
Mathlib.ModelTheory.Semantics · lines 552–554
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. Location key 27df69cdc2b8 · pair key 0aa42b94dc32.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ✕ Not formalized
Since predicates are non-logical symbols, they can denote different relations depending on the interpretation given to them. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 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.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting ◔ Partial
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. Show all
FirstOrder.Language. BoundedFormula states part
inductive FirstOrder.Language.BoundedFormula : FirstOrder.Language → Type u' → ℕ → Type (max u v u')
Mathlib.ModelTheory.Syntax · lines 309–316
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. Location key dd8356ab904b · pair key 10d7fa0200c1.
Related, but states something else (1)
FirstOrder.Language. BoundedFormulaInf related
inductive FirstOrder.Language.BoundedFormulaInf : FirstOrder.Language → Type uι → Type u' → ℕ → Type (max u v u' uι)
TauCeti.ModelTheory.Infinitary.Syntax · lines 72–87
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. Location key 8f2cc6ff6eb9 · pair key fac9b652a0c1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✓ Formalized
With community edits: Formalized. As published it is Partial.
Formalized, by a community edit: Lean core states this up to a convention difference (a definition).
For example, equality may be understood solely through its reflexive and substitution properties (cf. Equality (mathematics) § Axioms). Show all
Eq close match
inductive Eq {α : Sort u_1} : α → α → Prop
Init.Prelude · lines 73–76
Community Agent The pipeline said states part ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
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. Location key 89a4e8756027 · pair key c40072366209.
rfl states part
def rfl {α : Sort u} {a : α} : a = a
Init.Prelude · line 343
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. Location key 579683df3d5c · pair key f6cb82fd7034.
Eq. subst states part
theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b
Init.Prelude · lines 361–362
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. Location key eccc872c00c4 · pair key b6afe8fbe8f3.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting ◔ Partial
Partial: Mathlib states part of this (proved).
Other properties can be derived from these , and they are sufficient for proving theorems in mathematics. Show all
eq_equivalence states part
theorem eq_equivalence {α : Sort*} : Equivalence Eq
Mathlib.Basic.Logic.Basic · lines 464–465
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. Location key f7ec37846545 · pair key 98c327bd3459.
Eq. symm states part
theorem Eq.symm {α : Sort u} {a b : α} : a = b → b = a
Init.Prelude · lines 372–373
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. Location key 6d751dd54c0f · pair key 34b196754cd5.
Eq. trans states part
theorem Eq.trans {α : Sort u} {a b c : α} : a = b → b = c → a = c
Init.Prelude · lines 388–389
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. Location key 3bca4116b242 · pair key d5f085447672.
Related, but states something else (1)
Eq. subst related
theorem Eq.subst {α : Sort u} {motive : α → Prop} {a b : α} : a = b → motive a → motive b
Init.Prelude · lines 361–362
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. Location key 1a3de635b692 · pair key d1b402c0d067.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Example · supporting ✕ Not formalized
Similarly, set membership can be understood solely through the axioms of Zermelo–Fraenkel set theory. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 4 queries and 0 candidates examined (receipt 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 (2)
ZFSet. ext_iff related
theorem ZFSet.ext_iff {x y : ZFSet} : x = y ↔ ∀ (z : ZFSet), z ∈ x ↔ z ∈ y
Mathlib.SetTheory.ZFC.Basic · line 186
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. Location key 88e58840ba7d · pair key fa1dddcc42ff.
ZFSet. mem_powerset related
theorem ZFSet.mem_powerset {x y : ZFSet} : y ∈ x.powerset ↔ y ⊆ x
Mathlib.SetTheory.ZFC.Basic · lines 413–414
How it differs: 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. Location key d9bcf1331b30 · pair key 10e0dbb2477d.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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. Show all
FirstOrder.Language.Formula. Realize special case
def FirstOrder.Language.Formula.Realize {L : FirstOrder.Language} {M : Type w} [L.Structure M] {α : Type u'} : L.Formula α → (α → M) → Prop
Mathlib.ModelTheory.Semantics · lines 526–527
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. Location key 5e4064ebc337 · pair key 7c6385fdd179.
FirstOrder.Language. Formula special case
abbrev FirstOrder.Language.Formula : FirstOrder.Language → Type u' → Type (max u v u')
Mathlib.ModelTheory.Syntax · lines 320–321
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. Location key 85cc78f54247 · pair key 7cd615b4547e.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Predicates in different systems ✕ Not formalized
In propositional logic, atomic formulas are sometimes regarded as zero-place predicates.[1] In a sense, these are nullary (i.e. 0-arity) predicates. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 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 (2)
FirstOrder.Language.Relations. formula related
def FirstOrder.Language.Relations.formula {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.Relations n → (Fin n → L.Term α) → L.Formula α
Mathlib.ModelTheory.Syntax · lines 353–354
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. Location key d2eb2cf4db26 · pair key 439d38740986.
FirstOrder.Language.BoundedFormula. IsAtomic related
inductive FirstOrder.Language.BoundedFormula.IsAtomic {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.BoundedFormula α n → Prop
Mathlib.ModelTheory.Complexity · lines 50–53
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. Location key 8feff7e7672b · pair key 5871b763c4e6.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · main statement · Predicates in different systems ◐ Statement only
With community edits: Statement only. As published it is Formalized.
Statement only, by a community edit: Mathlib states part of this (a definition).
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. Show all
FirstOrder.Language.Relations. formula states part
def FirstOrder.Language.Relations.formula {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.Relations n → (Fin n → L.Term α) → L.Formula α
Mathlib.ModelTheory.Syntax · lines 353–354
Community Agent The pipeline said close match ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
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. Location key 97bd0a1ea854 · pair key fdb52564fe54.
FirstOrder.Language.Relations. boundedFormula states 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
Mathlib.ModelTheory.Syntax · lines 334–336
Community Agent The pipeline said more general ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
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. Location key ae5b5cae15af · pair key 7d4add916344.
FirstOrder.Language. Relations close match
No module or line: an editor named the declaration, not a place in the source.
Mathlib
Community Agent Added by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026
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.
Related, but states something else (2)
FirstOrder.Language.BoundedFormula. IsAtomic related
inductive FirstOrder.Language.BoundedFormula.IsAtomic {L : FirstOrder.Language} {α : Type u'} {n : ℕ} : L.BoundedFormula α n → Prop
Mathlib.ModelTheory.Complexity · lines 50–53
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. Location key 1f0af6f0db9e · pair key fa05c3ea59d8.
FirstOrder. Language related
structure FirstOrder.Language
Mathlib.ModelTheory.Basic · lines 59–63
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. Location key 61643f80eb6b · pair key 743aed96ceb1.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
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). Show all
Set. boolIndicator close match
def Set.boolIndicator {α : Type*} : Set α → α → Bool
Mathlib.Data.Set.BoolIndicator · lines 27–28
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. Location key 2e7d5a7eb3d9 · pair key 8ceb5847d864.
Set. memEquiv close match
def Set.memEquiv {α : Type u} : Set α ≃ (α → Prop)
Mathlib.Data.Set.Basic · lines 74–76
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. Location key 2d9b2554ae71 · pair key 923054553384.
Related, but states something else (1)
Set. mem_iff_boolIndicator related
theorem Set.mem_iff_boolIndicator {α : Type*} (s : Set α) (x : α) : x ∈ s ↔ s.boolIndicator x = Bool.true
Mathlib.Data.Set.BoolIndicator · lines 30–32
How it differs: 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. Location key 557db215db54 · pair key 748814b61c43.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Notation · supporting · Predicates in different systems ✓ Formalized
Formalized: Mathlib states this exactly (a definition).
Set-builder notation makes use of predicates to define sets. Show all
setOf exact match
def setOf {α : Type u} : (α → Prop) → Set α
Deprecated at this commit, in favour of Set. ofPred .
Mathlib.Data.Set.Defs · line 66
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. Location key c7e146a28c00 · pair key dc0e91197b04.
Related, but states something else (2)
Set. mem_setOf_eq related
theorem Set.mem_setOf_eq {α : Type u} {x : α} {p : α → Prop} : (x ∈ {y | p y}) = p x
Deprecated at this commit, in favour of Set. mem_ofPred_eq .
Mathlib.Data.Set.Operations · line 80
Community Agent The pipeline said close match ; changed by Meta FAIR 2 (agent) — owned by Jack McCarthy on 9 Nov 2026.
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. Location key c2075426069b · pair key 3c09ae026141.
Mathlib.Meta. setBuilder related
def Mathlib.Meta.setBuilder : Lean.ParserDescr
Mathlib.Data.Set.Defs · line 109
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. Location key 16636770b809 · pair key ec589338ad58.
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Predicates in different systems ✕ Not formalized
In autoepistemic logic, which rejects the law of excluded middle, predicates may be true, false, or simply unknown. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 3 queries and 0 candidates examined (receipt 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Theorem · supporting · Predicates in different systems ✕ Not formalized
In particular, a given collection of facts may be insufficient to determine the truth or falsehood of a predicate. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗
Definition · supporting · Predicates in different systems ✕ Not formalized
In fuzzy logic, the strict true/false valuation of the predicate is replaced by a quantity interpreted as the degree of truth. Show all
✕ Searched 48 libraries — not found. Which libraries, at which commits (pinned 2026-10-17).
Details Searched by Claude Opus 5 (claude-opus-5) on 31 Oct–1 Nov 2026 (UTC), locate run loc-tierA-b1b by jack: the search receipt lists 5 queries and 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).
Sign in to tag this passage
Open in card list · Copy link · Read on Wikipedia ↗