Cslib.LTS.MTr.stepR
theoremverifiedformalizationimported Lean
Any multistep transition can be extended by adding a 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 theorem Cslib.LTS.MTr.stepR {s1 : State} {μs : List Label} {s2 : State} {μ : Label} {s3 : State} : lts.MTr s1 μs s2 → lts.Tr s2 μ s3 → lts.MTr s1 (μs ++ [μ]) s3
- Formalizes
- CSLib, `Cslib.LTS.MTr.stepR`
- 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.Cslib.LTS.MTr.stepR← Cslib.LTS.MTr.stepR (Cslib/Foundations/Semantics/LTS/Basic.lean:126): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 4
- 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.LTS.MTr.singleAny transition is also a multistep transition.
- 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 2
- Cslib.LTS.transGen_unlabelledTr_iffThe transitive closure of the underlying unlabelled transition relation is exactly the nonempty multistep transitions of the LTS.
- Cslib.LTS.reflTransGen_unlabelledTr_iffThe reflexive-transitive closure of the underlying unlabelled transition relation is exactly reachability in the LTS.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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 multistep transition can be extended by adding a transition. -/theorem Cslib.LTS.MTr.stepR {s1 : State} {μs : List Label} {s2 : State} {μ : Label} {s3 : State} : lts.MTr s1 μs s2 → lts.Tr s2 μ s3 → lts.MTr s1 (μs ++ [μ]) s3 := by intro h1 h2 induction h1 case refl s1' => exact MTr.single lts h2 case stepL s1' μ' s2' μs' s3' h1' h3 ih => apply MTr.stepL · exact h1' · apply ih h2