Cslib.LTS.CanReach
defimported Lean
A state s1 can reach a state s2 if there exists a multistep transition from s1 to s2.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in universe u v in variable {State : Type u} {Label : Type v} (lts : LTS State Label) in @[grind =] def Cslib.LTS.CanReach (s1 s2 : State) : Prop
- Defined in
- CSLib, `Cslib.LTS.CanReach`
- 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.Cslib.LTS.CanReach← Cslib.LTS.CanReach (Cslib/Foundations/Semantics/LTS/Basic.lean:201): adapted
What was changed in
Cslib.LTS.CanReach--- Cslib/Foundations/Semantics/LTS/Basic.lean:201 (Cslib.LTS.CanReach) +++ as compiled here @@ -1,5 +1,8 @@ -/-- A state `s1` can reach a state `s2` if there exists a multistep transition from -`s1` to `s2`. -/ -@[scoped grind =] -def CanReach (s1 s2 : State) : Prop := +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib Cslib.LTS in +universe u v in +variable {State : Type u} {Label : Type v} (lts : LTS State Label) in +@[grind =] +def Cslib.LTS.CanReach (s1 s2 : State) : Prop := ∃ μs, lts.MTr s1 μs s2 - Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
- Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
- 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…
- Used by 4
- Cslib.LTS.generatedByThe LTS generated by a state
sis the LTS given by all the states reachable froms. - Cslib.LTS.reflTransGen_unlabelledTr_iffThe reflexive-transitive closure of the underlying unlabelled transition relation is exactly reachability in the LTS.
- Cslib.LTS.MayTerminateA state 'may terminate' if it can reach a terminated state. The definition of
Terminatedis a parameter. - Cslib.LTS.CanReach.reflAny state can reach itself.
- Cslib.LTS.generatedByThe LTS generated by a state
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in universe u v in variable {State : Type u} {Label : Type v} (lts : LTS State Label) in /-- A state `s1` can reach a state `s2` if there exists a multistep transition from `s1` to `s2`. -/ @[grind =] def Cslib.LTS.CanReach (s1 s2 : State) : Prop := ∃ μs, lts.MTr s1 μs s2