AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 8
Used by 1
  • Cslib.Automata.NA.totalizeNA.totalize makes the original NA total by replacing its LTS with LTS.totalize and its starting states with their lifted non-sink…

Lean source view module on GitHub

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]
See it in the graphDiscuss this resultChallenge it