AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.CanReach.refl

theoremverifiedformalizationimported Lean

Any state can reach itself.

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 .]
theorem Cslib.LTS.CanReach.refl (s : State) : lts.CanReach s s
Formalizes
CSLib, `Cslib.LTS.CanReach.refl`
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.CanReach.refl
--- Cslib/Foundations/Semantics/LTS/Basic.lean:206 (Cslib.LTS.CanReach.refl)
+++ as compiled here
@@ -1,4 +1,8 @@
-/-- Any state can reach itself. -/
-@[scoped grind .]
-theorem CanReach.refl (s : State) : lts.CanReach s s := by
+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 .]
+theorem Cslib.LTS.CanReach.refl (s : State) : lts.CanReach s s := by
   exists []
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 5
  • 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.CanReachA state s1 can reach a state s2 if there exists a multistep transition from s1 to s2.
  • 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 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.LTS inuniverse u v invariable {State : Type u} {Label : Type v} (lts : LTS State Label) in/-- Any state can reach itself. -/@[grind .]theorem Cslib.LTS.CanReach.refl (s : State) : lts.CanReach s s := by  exists []  apply MTr.refl
See it in the graphDiscuss this resultChallenge it