Cslib.LTS.totalize.nonsink_tr_iff
theoremverifiedformalizationimported Lean
In totalize, the transitions between non-sink states correspond exactly to the 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_tr_iff {μ : Label} {s t : State} : lts.totalize.Tr (some s) μ (some t) ↔ lts.Tr s μ t
- Formalizes
- CSLib, `Cslib.LTS.totalize.nonsink_tr_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_tr_iff← Cslib.LTS.totalize.nonsink_tr_iff (Cslib/Foundations/Semantics/LTS/Total.lean:92): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 3
- 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.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled…
- Cslib.LTS.instTotalOptionTotalizeThe LTS constructed by
- Used by 2
- 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.LTS.totalize.nonsink_mtr_iffIn
totalize, the multistep transitions between non-sink states correspond exactly to the multistep transitions in the original LTS.
- 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 transitions between non-sink states correspond exactly to the transitions in the original LTS. -/@[simp]theorem Cslib.LTS.totalize.nonsink_tr_iff {μ : Label} {s t : State} : lts.totalize.Tr (some s) μ (some t) ↔ lts.Tr s μ t := by simp [totalize]