AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.totalize.no_sink_to_nonsink

theoremverifiedformalizationimported Lean

In totalize, there is no finite execution from the sink state to any non-sink state.

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
set_option linter.tacticAnalysis.verifyGrindOnly false in
theorem Cslib.LTS.totalize.no_sink_to_nonsink {μs : List Label} {t : State} :
    ¬ lts.totalize.MTr (none) μs (some t)
Formalizes
CSLib, `Cslib.LTS.totalize.no_sink_to_nonsink`
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
propext
Built on 6
  • 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.instTotalOptionTotalizeThe LTS constructed by totalize is indeed total.
  • Cslib.LTS.totalizetotalize constructs 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.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 invariable {State Label : Type*} {lts : LTS State Label} inset_option linter.tacticAnalysis.verifyGrindOnly false in/-- In `totalize`, there is no finite execution from the sink state to any non-sink state. -/theorem Cslib.LTS.totalize.no_sink_to_nonsink {μs : List Label} {t : State} :    ¬ lts.totalize.MTr (none) μs (some t) := by  intro h  generalize h_s : (none : Option State) = s'  generalize h_t : (some t : Option State) = t'  rw [h_s, h_t] at h  induction h  · grind  · grind only [totalize]
See it in the graphDiscuss this resultChallenge it