Cslib.LTS.Execution.split
theoremverifiedformalizationimported Lean
An execution can be split at any intermediate state into two executions.
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.split {lts : LTS State Label} {s t : State} {μs : List Label} {ss : List State} (he : lts.Execution s μs t ss) (n : ℕ) (hn : n ≤ μs.length) : lts.Execution s (μs.take n) (ss[n]'(by grind)) (ss.take (n + 1)) ∧ lts.Execution (ss[n]'(by grind)) (μs.drop n) t (ss.drop n)
- Formalizes
- CSLib, `Cslib.LTS.Execution.split`
- 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.split← Cslib.LTS.Execution.split (Cslib/Foundations/Semantics/LTS/Execution.lean:130): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- 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.Execution
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/-- An execution can be split at any intermediate state into two executions. -/theorem Cslib.LTS.Execution.split {lts : LTS State Label} {s t : State} {μs : List Label} {ss : List State} (he : lts.Execution s μs t ss) (n : ℕ) (hn : n ≤ μs.length) : lts.Execution s (μs.take n) (ss[n]'(by grind)) (ss.take (n + 1)) ∧ lts.Execution (ss[n]'(by grind)) (μs.drop n) t (ss.drop n) := by have : n + (ss.length - n - 1) = ss.length - 1 := by grind simp [Execution] grind