AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.generatedBy

defimported Lean

The LTS generated by a state s is the LTS given by all the states reachable from s.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) in
@[grind =]
def Cslib.LTS.generatedBy (s : State) : LTS {s' : State // lts.CanReach s s'} Label
Defined in
CSLib, `Cslib.LTS.generatedBy`
Lean proof
By Fabrizio Montesi, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Fabrizio Montesi. 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.
What was changed in Cslib.LTS.generatedBy
--- Cslib/Foundations/Semantics/LTS/Basic.lean:212 (Cslib.LTS.generatedBy)
+++ as compiled here
@@ -1,4 +1,8 @@
-/-- The LTS generated by a state `s` is the LTS given by all the states reachable from `s`. -/
-@[scoped grind =]
-def generatedBy (s : State) : LTS {s' : State // lts.CanReach s s'} Label where
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib Cslib.LTS in
+universe u v in
+variable {State : Type u} {Label : Type v} (lts : LTS State Label) in
+@[grind =]
+def Cslib.LTS.generatedBy (s : State) : LTS {s' : State // lts.CanReach s s'} Label where
   Tr := fun s1 μ s2 => lts.CanReach s s1 ∧ lts.CanReach s s2 ∧ lts.Tr s1 μ s2
Verified
08 Oct 2026
Axioms
none listed
Built on 4
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • Cslib.LTS.CanReachA state s1 can reach a state s2 if there exists a multistep transition from s1 to s2.
  • Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) in
/-- The LTS generated by a state `s` is the LTS given by all the states reachable from `s`. -/
@[grind =]
def Cslib.LTS.generatedBy (s : State) : LTS {s' : State // lts.CanReach s s'} Label where
  Tr := fun s1 μ s2 => lts.CanReach s s1 ∧ lts.CanReach s s2 ∧ lts.Tr s1 μ s2
See it in the graphDiscuss this resultChallenge it