AFTD Auto-Formalizing Theoretical Domains

Cslib.FLTS.mtr_concat_eq

theoremverifiedformalizationimported Lean

Cslib.FLTS.mtr_concat_eq

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {State Label : Type*} in
@[simp, scoped grind =]
theorem Cslib.FLTS.mtr_concat_eq {flts : FLTS State Label} {s : State} {μs : List Label} {μ : Label} :
    flts.mtr s (μs ++ [μ]) = flts.tr (flts.mtr s μs) μ
Formalizes
CSLib, `Cslib.FLTS.mtr_concat_eq`
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
Classical.choiceQuot.soundpropext
Built on 2
  • Cslib.FLTS.mtrExtended transition function. Implementation note: compared to [Hopcroft2006], the definition consumes the input list of symbols from the…
  • Cslib.FLTSA Functional Labelled Transition System (FLTS) for a type of states (State) and a type of transition labels (Label) consists of a…
Used by 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {State Label : Type*} in@[simp, scoped grind =]theorem Cslib.FLTS.mtr_concat_eq {flts : FLTS State Label} {s : State} {μs : List Label} {μ : Label} :    flts.mtr s (μs ++ [μ]) = flts.tr (flts.mtr s μs) μ := by  grind
See it in the graphDiscuss this resultChallenge it