AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.chooseFLTS

defimported Lean

Choose an FLTS that is a "sub-LTS" of a total LTS.

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
noncomputable def Cslib.LTS.chooseFLTS (lts : LTS State Label) [h : lts.Total] : FLTS State Label
Defined in
CSLib, `Cslib.LTS.chooseFLTS`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Ching-Tsun Chou. 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 5
  • Cslib.LTS.TotalAn LTS is total iff every state has a μ-derivative for every label μ.
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…
  • Cslib.FLTSA Functional Labelled Transition System (FLTS) for a type of states (State) and a type of transition labels (Label) consists of a…
  • Cslib.FLTS.mtr_nil_eqCslib.FLTS.mtr_nil_eq
  • Cslib.FLTS.mtr_concat_eqCslib.FLTS.mtr_concat_eq
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
/-- Choose an FLTS that is a "sub-LTS" of a total LTS. -/
noncomputable def Cslib.LTS.chooseFLTS (lts : LTS State Label) [h : lts.Total] : FLTS State Label where
  tr s μ := Classical.choose <| h.total s μ
See it in the graphDiscuss this resultChallenge it