Cslib.LTS.Execution.isChain
theoremverifiedformalizationimported Lean
The states visited by an execution form a chain in the underlying unlabelled relation.
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 theorem Cslib.LTS.Execution.isChain (hexec : lts.Execution s1 μs s2 ss) : ss.IsChain lts.UnlabelledTr
- Formalizes
- CSLib, `Cslib.LTS.Execution.isChain`
- 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.Cslib.LTS.Execution.isChain← Cslib.LTS.Execution.isChain (Cslib/Foundations/Semantics/LTS/Execution.lean:88): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- Cslib.LTS.Execution
ExecutionextendsMTrby providing the intermediate states of 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… - Cslib.LTS.UnlabelledTrThe unlabelled transition relation underlying an LTS.
- Cslib.LTS.Execution
- Used by 1
- Cslib.LTS.Acyclic.toBoundedUpToOn a finite state space, an acyclic LTS has execution length strictly less than the number of states.
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 invariable {State Label : Type*} {lts : LTS State Label} in/-- The states visited by an execution form a chain in the underlying unlabelled relation. -/theorem Cslib.LTS.Execution.isChain (hexec : lts.Execution s1 μs s2 ss) : ss.IsChain lts.UnlabelledTr := by grind [Execution, List.isChain_iff_getElem, UnlabelledTr]