AFTD Auto-Formalizing Theoretical Domains

Cslib.FLTS.toLTS_tr

theoremverifiedformalizationimported Lean

FLTS.toLTS correctly characterises transitions.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {State Label : Type*} in
@[scoped grind =]
theorem Cslib.FLTS.toLTS_tr {flts : FLTS State Label} {s1 : State} {μ : Label} {s2 : State} :
  flts.toLTS.Tr s1 μ s2 ↔ flts.tr s1 μ = s2
Formalizes
CSLib, `Cslib.FLTS.toLTS_tr`
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.FLTS.toLTSFLTS is a special case of LTS.
  • Cslib.FLTS.instCoeLTSCslib.FLTS.instCoeLTS
  • Cslib.FLTSA Functional Labelled Transition System (FLTS) for a type of states (State) and a type of transition labels (Label) consists of a…
  • 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 invariable {State Label : Type*} in/-- `FLTS.toLTS` correctly characterises transitions. -/@[scoped grind =]theorem Cslib.FLTS.toLTS_tr {flts : FLTS State Label} {s1 : State} {μ : Label} {s2 : State} :  flts.toLTS.Tr s1 μ s2 ↔ flts.tr s1 μ = s2 := by rfl
See it in the graphDiscuss this resultChallenge it