AFTD Auto-Formalizing Theoretical Domains

Cslib.instCategoryLTSCat

instanceimported Lean

Finally, we prove that these form a category.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {State Label : Type*} in
instance Cslib.instCategoryLTSCat : CategoryTheory.Category LTSCat
Defined in
CSLib, `Cslib.instCategoryLTSCat`
Lean proof
By Ayberk Tosun, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Ayberk Tosun (Zeroth Research). All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 6
  • Cslib.LTS.Morphism.idThe identity LTS morphism.
  • Cslib.LTS.Morphism.compComposition of LTS morphisms. We use Kleisli composition to define this.
  • Cslib.LTSCatThe definition of labelled transition system (with the type of states and the type of labels as part of the structure).
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…
  • Cslib.LTS.withIdleWe first define what is denoted Tran* in [WinskelNielsen1995]: the extension of a transition relation with idle transitions.
  • Cslib.LTS.MorphismA morphism between two labelled transition systems consists of (1) a function on states, (2) a partial function on labels, and a proof…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {State Label : Type*} in
/-- Finally, we prove that these form a category. -/
instance Cslib.instCategoryLTSCat : CategoryTheory.Category LTSCat where
  Hom := LTS.Morphism
  id := LTS.Morphism.id
  comp := LTS.Morphism.comp
  comp_id _ := by
    simp only [LTS.Morphism.comp, LTS.Morphism.id]
    congr 1
    rw [fish_pure]
  assoc _ _ _ := by
    simp only [LTS.Morphism.comp]
    congr 1
    rw [fish_assoc]
See it in the graphDiscuss this resultChallenge it