AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.Execution.of_mTr

theoremverifiedformalizationimported Lean

A multistep transition implies the existence of an execution.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
variable {State Label : Type*} {lts : LTS State Label} in
@[grind →]
theorem Cslib.LTS.Execution.of_mTr {lts : LTS State Label}
    {s1 : State} {μs : List Label} {s2 : State}
    (h : lts.MTr s1 μs s2) : ∃ ss : List State, lts.Execution s1 μs s2 ss
Formalizes
CSLib, `Cslib.LTS.Execution.of_mTr`
Lean proof
By Fabrizio Montesi, Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 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.Execution.of_mTr
--- Cslib/Foundations/Semantics/LTS/Execution.lean:55 (Cslib.LTS.Execution.of_mTr)
+++ as compiled here
@@ -1,4 +1,7 @@
-/-- A multistep transition implies the existence of an execution. -/
-@[scoped grind →]
-theorem Execution.of_mTr {lts : LTS State Label}
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib Cslib.LTS in
+variable {State Label : Type*} {lts : LTS State Label} in
+@[grind →]
+theorem Cslib.LTS.Execution.of_mTr {lts : LTS State Label}
     {s1 : State} {μs : List Label} {s2 : State}
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
  • Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
  • Cslib.LTS.ExecutionExecution extends MTr by providing the intermediate states of a multistep transition.
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • Cslib.LTS.Execution.stepLEquivalent of MTr.stepL for executions.
  • Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
  • Cslib.LTS.Execution.reflEvery state has an execution of zero steps terminating in itself.
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
variable {State Label : Type*} {lts : LTS State Label} in
/-- A multistep transition implies the existence of an execution. -/
@[grind →]
theorem Cslib.LTS.Execution.of_mTr {lts : LTS State Label}
    {s1 : State} {μs : List Label} {s2 : State}
    (h : lts.MTr s1 μs s2) : ∃ ss : List State, lts.Execution s1 μs s2 ss := by
  induction h
  case refl t =>
    use [t]
    grind
  case stepL t1 μ t2 μs t3 htr hmtr ih =>
    obtain ⟨ss', _⟩ := ih
    use t1 :: ss'
    grind
See it in the graphDiscuss this resultChallenge it