Cslib.LTS.totalize.nonsink_mtr_iff
theoremverifiedformalizationimported Lean
In totalize, the multistep transitions between non-sink states correspond exactly to the multistep transitions in the original LTS.
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 @[simp] theorem Cslib.LTS.totalize.nonsink_mtr_iff {μs : List Label} {s t : State} : lts.totalize.MTr (some s) μs (some t) ↔ lts.MTr s μs t
- Formalizes
- CSLib, `Cslib.LTS.totalize.nonsink_mtr_iff`
- Lean proof
- By Ching-Tsun Chou, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Ching-Tsun Chou. 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.totalize.nonsink_mtr_iff← Cslib.LTS.totalize.nonsink_mtr_iff (Cslib/Foundations/Semantics/LTS/Total.lean:99): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
- Cslib.LTS.totalize.nonsink_tr_iffIn
totalize, the transitions between non-sink states correspond exactly to the transitions in the original LTS. - Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
- Cslib.LTS.instTotalOptionTotalizeThe LTS constructed by
totalizeis indeed total. - Cslib.LTS.totalize
totalizeconstructs a total LTS from any given LTS by adding a sink state. - Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
- Cslib.LTS.totalize.no_sink_to_nonsinkIn
totalize, there is no finite execution from the sink state to any non-sink state. - 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
- Cslib.Automata.NA.totalize
NA.totalizemakes the original NA total by replacing its LTS withLTS.totalizeand its starting states with their lifted non-sink…
- Cslib.Automata.NA.totalize
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/-- In `totalize`, the multistep transitions between non-sink states correspond exactly to the multistep transitions in the original LTS. -/@[simp]theorem Cslib.LTS.totalize.nonsink_mtr_iff {μs : List Label} {s t : State} : lts.totalize.MTr (some s) μs (some t) ↔ lts.MTr s μs t := by constructor <;> intro h · generalize h_s : (some s : Option State) = s' generalize h_t : (some t : Option State) = t' rw [h_s, h_t] at h induction h generalizing s case refl _ => grind [MTr] case stepL t1' μ t2' μs t3' h_tr h_mtr h_ind => obtain ⟨rfl⟩ := h_s cases t2' case some t2 => grind [MTr, totalize.nonsink_tr_iff.mp h_tr] case none => grind [totalize.no_sink_to_nonsink] · induction h case refl _ => grind [MTr] case stepL t1 μ t2 μs t3 h_tr h_mtr h_ind => grind [MTr, totalize.nonsink_tr_iff.mpr h_tr]