AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.MTr.split

theoremverifiedformalizationimported Lean

A multistep transition over a concatenation can be split into two multistep transitions.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) in
theorem Cslib.LTS.MTr.split {lts : LTS State Label} (h : lts.MTr s1 (μs ++ μs') s2) :
    ∃ s, lts.MTr s1 μs s ∧ lts.MTr s μs' s2
Formalizes
CSLib, `Cslib.LTS.MTr.split`
Lean proof
By Fabrizio Montesi, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 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
none — Lean reports it depends on no axioms
Built on 4
  • Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
  • 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
  • Cslib.LTS.MTr.append_iffMultistep-transitions over μs ++ μs' are exactly multistep transitions over μs and μs' with a common end & start state (respectively).

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LTS inuniverse u v invariable {State : Type u} {Label : Type v} (lts : LTS State Label) in/-- A multistep transition over a concatenation can be split into two multistep transitions. -/theorem Cslib.LTS.MTr.split {lts : LTS State Label} (h : lts.MTr s1 (μs ++ μs') s2) :    ∃ s, lts.MTr s1 μs s ∧ lts.MTr s μs' s2 := by  induction μs generalizing s1 s2 with  | nil => use s1, .refl, h  | cons μ μs ih =>    rw [List.cons_append] at h    cases h    case stepL s htr hmtr =>      obtain ⟨s', hmtr', hmtr''⟩ := ih hmtr      use s', .stepL htr hmtr', hmtr''
See it in the graphDiscuss this resultChallenge it