AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.reflTransGen_unlabelledTr_iff

theoremverifiedformalizationimported Lean

The reflexive-transitive closure of the underlying unlabelled transition relation is exactly reachability in 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.reflTransGen_unlabelledTr_iff :
    Relation.ReflTransGen lts.UnlabelledTr s1 s2 ↔ lts.CanReach s1 s2
Formalizes
CSLib, `Cslib.LTS.reflTransGen_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
none — Lean reports it depends on no axioms
Built on 9

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 reflexive-transitive closure of the underlying unlabelled transition relation is exactly reachability in the LTS. -/theorem Cslib.LTS.reflTransGen_unlabelledTr_iff :    Relation.ReflTransGen lts.UnlabelledTr s1 s2 ↔ lts.CanReach s1 s2 := by  constructor  · intro h    induction h with    | refl => exact ⟨[], .refl⟩    | tail _ htr ih =>        obtain ⟨μs, hmtr⟩ := ih        obtain ⟨μ, htr⟩ := htr        exact ⟨μs ++ [μ], hmtr.stepR lts htr⟩  · rintro ⟨μs, hmtr⟩    exact hmtr.toReflTransGen lts
See it in the graphDiscuss this resultChallenge it