AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.MTr.single

theoremverifiedformalizationimported Lean

Any transition is also a multistep transition.

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 →]
theorem Cslib.LTS.MTr.single {s1 : State} {μ : Label} {s2 : State} :
  lts.Tr s1 μ s2 → lts.MTr s1 [μ] s2
Formalizes
CSLib, `Cslib.LTS.MTr.single`
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.MTr.single
--- Cslib/Foundations/Semantics/LTS/Basic.lean:108 (Cslib.LTS.MTr.single)
+++ as compiled here
@@ -1,4 +1,8 @@
-/-- Any transition is also a multistep transition. -/
-@[scoped grind →]
-theorem MTr.single {s1 : State} {μ : Label} {s2 : State} :
+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 →]
+theorem Cslib.LTS.MTr.single {s1 : State} {μ : Label} {s2 : State} :
   lts.Tr s1 μ s2 → lts.MTr s1 [μ] s2 := by
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 3
  • Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • 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 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LTS inuniverse u v invariable {State : Type u} {Label : Type v} (lts : LTS State Label) in/-- Any transition is also a multistep transition. -/@[grind →]theorem Cslib.LTS.MTr.single {s1 : State} {μ : Label} {s2 : State} :  lts.Tr s1 μ s2 → lts.MTr s1 [μ] s2 := by  intro h  apply MTr.stepL  · exact h  · apply MTr.refl
See it in the graphDiscuss this resultChallenge it