AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.toFLTS_mem_tr

theoremverifiedformalizationimported Lean

Characterisation of transitions in LTS.toFLTS wrt transitions in the original LTS.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
variable {State Label : Type*} in
@[grind =]
theorem Cslib.LTS.toFLTS_mem_tr {lts : LTS State Label} {S : Set State} {s' : State} {μ : Label} :
  s' ∈ lts.toFLTS.tr S μ ↔ ∃ s ∈ S, lts.Tr s μ s'
Formalizes
CSLib, `Cslib.LTS.toFLTS_mem_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.
What was changed in Cslib.LTS.toFLTS_mem_tr
--- Cslib/Foundations/Semantics/FLTS/LTSToFLTS.lean:27 (Cslib.LTS.toFLTS_mem_tr)
+++ as compiled here
@@ -1,4 +1,7 @@
-/-- Characterisation of transitions in `LTS.toFLTS` wrt transitions in the original `LTS`. -/
-@[scoped grind =]
-theorem toFLTS_mem_tr {lts : LTS State Label} {S : Set State} {s' : State} {μ : Label} :
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib Cslib.LTS in
+variable {State Label : Type*} in
+@[grind =]
+theorem Cslib.LTS.toFLTS_mem_tr {lts : LTS State Label} {S : Set State} {s' : State} {μ : Label} :
   s' ∈ lts.toFLTS.tr S μ ↔ ∃ s ∈ S, lts.Tr s μ s' := by
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
  • Cslib.LTS.setImageThe μ-image of a set of states S is the union of all μ-images of the states in S.
  • Cslib.LTS.imageThe μ-image of a state s is the set of all μ-derivatives of s.
  • Cslib.LTS.toFLTSConverts an LTS into an FLTS using the subset construction.
  • 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

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LTS invariable {State Label : Type*} in/-- Characterisation of transitions in `LTS.toFLTS` wrt transitions in the original `LTS`. -/@[grind =]theorem Cslib.LTS.toFLTS_mem_tr {lts : LTS State Label} {S : Set State} {s' : State} {μ : Label} :  s' ∈ lts.toFLTS.tr S μ ↔ ∃ s ∈ S, lts.Tr s μ s' := by  simp only [LTS.toFLTS, LTS.setImage, Set.mem_iUnion, exists_prop]  grind
See it in the graphDiscuss this resultChallenge it