Cslib.LTS.Execution.refl
theoremverifiedformalizationimported Lean
Every state has an execution of zero steps terminating in itself.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in variable {State Label : Type*} {lts : LTS State Label} in @[grind ⇒] theorem Cslib.LTS.Execution.refl (lts : LTS State Label) (s : State) : lts.Execution s [] s [s]
- Formalizes
- CSLib, `Cslib.LTS.Execution.refl`
- Lean proof
- By Fabrizio Montesi, Ching-Tsun Chou, 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.Execution.refl← Cslib.LTS.Execution.refl (Cslib/Foundations/Semantics/LTS/Execution.lean:35): adapted
What was changed in
Cslib.LTS.Execution.refl--- Cslib/Foundations/Semantics/LTS/Execution.lean:35 (Cslib.LTS.Execution.refl) +++ as compiled here @@ -1,4 +1,7 @@ -/-- Every state has an execution of zero steps terminating in itself. -/ -@[scoped grind ⇒] -theorem Execution.refl (lts : LTS State Label) (s : State) : lts.Execution s [] s [s] := by +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib Cslib.LTS in +variable {State Label : Type*} {lts : LTS State Label} in +@[grind ⇒] +theorem Cslib.LTS.Execution.refl (lts : LTS State Label) (s : State) : lts.Execution s [] s [s] := by grind - Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Cslib.LTS.Execution
ExecutionextendsMTrby providing the intermediate states of a multistep transition. - 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.Execution
- Used by 1
- Cslib.LTS.Execution.of_mTrA multistep transition implies the existence of an execution.
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*} {lts : LTS State Label} in/-- Every state has an execution of zero steps terminating in itself. -/@[grind ⇒]theorem Cslib.LTS.Execution.refl (lts : LTS State Label) (s : State) : lts.Execution s [] s [s] := by grind