AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.Execution.cons_invert

theoremverifiedformalizationimported Lean

Deconstruction of executions with List.cons.

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.cons_invert (h : lts.Execution s1 (μ :: μs) s2 (s1 :: ss)) :
    lts.Execution (ss[0]'(by grind)) μs s2 ss
Formalizes
CSLib, `Cslib.LTS.Execution.cons_invert`
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…
Used by 1

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/-- Deconstruction of executions with `List.cons`. -/theorem Cslib.LTS.Execution.cons_invert (h : lts.Execution s1 (μ :: μs) s2 (s1 :: ss)) :    lts.Execution (ss[0]'(by grind)) μs s2 ss := by  obtain ⟨_, _, _, h4⟩ := h  exists (by grind)  constructorm* _∧_  · rfl  · grind  · intro k valid    specialize h4 k <;> grind
See it in the graphDiscuss this resultChallenge it