AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • Cslib.LTS.ExecutionExecution extends MTr by 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…

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it