AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.Execution.stepL

theoremverifiedformalizationimported Lean

Equivalent of MTr.stepL for 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.stepL {lts : LTS State Label} (htr : lts.Tr s1 μ s2)
    (hexec : lts.Execution s2 μs s3 ss) : lts.Execution s1 (μ :: μs) s3 (s1 :: ss)
Formalizes
CSLib, `Cslib.LTS.Execution.stepL`
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 in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
variable {State Label : Type*} {lts : LTS State Label} in
/-- Equivalent of `MTr.stepL` for executions. -/
theorem Cslib.LTS.Execution.stepL {lts : LTS State Label} (htr : lts.Tr s1 μ s2)
    (hexec : lts.Execution s2 μs s3 ss) : lts.Execution s1 (μ :: μs) s3 (s1 :: ss) := by grind
See it in the graphDiscuss this resultChallenge it