AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.MTr.toRelation

defimported Lean

Returns the relation that relates all states s1 and s2 via a fixed list of transition labels μs.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
variable {State Label : Type*} in
def Cslib.LTS.MTr.toRelation (lts : LTS State Label) (μs : List Label) : State → State → Prop
Defined in
CSLib, `Cslib.LTS.MTr.toRelation`
Lean proof
By Fabrizio Montesi, 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
none listed
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…

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*} in
/-- Returns the relation that relates all states `s1` and `s2` via a fixed list of transition labels `μs`. -/
def Cslib.LTS.MTr.toRelation (lts : LTS State Label) (μs : List Label) : State → State → Prop :=
  fun s1 s2 => lts.MTr s1 μs s2
See it in the graphDiscuss this resultChallenge it