AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.transGen_unlabelledTr_iff

theoremverifiedformalizationimported Lean

The transitive closure of the underlying unlabelled transition relation is exactly the nonempty multistep transitions of the LTS.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
variable {State Label : Type*} in
variable (lts : LTS State Label) in
theorem Cslib.LTS.transGen_unlabelledTr_iff :
    Relation.TransGen lts.UnlabelledTr s1 s2 ↔
      ∃ μs, μs ≠ [] ∧ lts.MTr s1 μs s2
Formalizes
CSLib, `Cslib.LTS.transGen_unlabelledTr_iff`
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
propext
Built on 8
  • Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
  • Cslib.LTS.MTr.stepRAny multistep transition can be extended by adding a transition.
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • Cslib.LTS.MTr.singleAny transition is also a multistep transition.
  • Cslib.LTS.MTr.toTransGenA nonempty multistep transition induces a nonempty path in the underlying unlabelled transition relation.
  • 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…
  • Cslib.LTS.UnlabelledTrThe unlabelled transition relation underlying an LTS.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LTS invariable {State Label : Type*} invariable (lts : LTS State Label) in/-- The transitive closure of the underlying unlabelled transition relation is exactly the nonempty multistep transitions of the LTS. -/theorem Cslib.LTS.transGen_unlabelledTr_iff :    Relation.TransGen lts.UnlabelledTr s1 s2 ↔      ∃ μs, μs ≠ [] ∧ lts.MTr s1 μs s2 := by  constructor  · intro h    induction h with    | single htr =>        obtain ⟨μ, htr⟩ := htr        exact ⟨[μ], by simp, MTr.single lts htr⟩    | tail _ htr ih =>        obtain ⟨μs, hne, hmtr⟩ := ih        obtain ⟨μ, htr⟩ := htr        exact ⟨μs ++ [μ], by simp, hmtr.stepR lts htr⟩  · rintro ⟨μs, hne, hmtr⟩    exact hmtr.toTransGen lts hne
See it in the graphDiscuss this resultChallenge it