Separating example: the two theories are categorically equivalent
ProvedMoritaEquiv.thm52_categoricalcategory-theorydefinabilitymany-sorted-logicmodel-theorymorita-equivalencephilosophy-of-sciencetheoretical-equivalence
Over one sort and unary predicates , the theories and have equivalent categories of models.
Preamble
import Mathlib import Definitions.Def_MoritaEquiv_defs open CategoryTheory
Formal statement
namespace MoritaEquiv
/-- Barrett–Halvorson, Theorem 5.2 (first half): the theories `T₁ = {∃=1 x (x = x)}` and
`T₂ = T₁ ∪ {∀y (q₀ y → qᵢ y) : i ∈ ℕ}` over one sort and countably many unary predicates have
equivalent categories of models (both are discrete with `2^ℵ₀` isomorphism classes). -/
theorem thm52_categorical : CategoricallyEquivalent Thm52.T1 Thm52.T2 := by sorry
end MoritaEquivSource
T. W. Barrett, H. Halvorson, Morita Equivalence, Rev. Symb. Logic 9 (2016) 556-582, https://arxiv.org/abs/1506.04675 (numbering as in arXiv v1), §5, Theorem 5.2 (first half of the proof)
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Over one sort and unary predicates , let and . Then the categories and (models in nonempty carriers, arrows elementary embeddings) are equivalent.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.