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.Cslib.LTS.reflTransGen_unlabelledTr_iff← Cslib.LTS.reflTransGen_unlabelledTr_iff (Cslib/Foundations/Semantics/LTS/Relation.lean:57): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 9
- 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.CanReachA state
s1can reach a states2if there exists a multistep transition froms1tos2. - Cslib.LTS.MTr.toReflTransGenA multistep transition induces a reflexive-transitive 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.LTS.CanReach.reflAny state can reach itself.
- 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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