AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.MayTerminate

defimported Lean

A state 'may terminate' if it can reach a terminated state. The definition of Terminated is a parameter.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) (Terminated : State → Prop) in
def Cslib.LTS.MayTerminate (s : State) : Prop
Defined in
CSLib, `Cslib.LTS.MayTerminate`
Lean proof
By Fabrizio Montesi, 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.
Verified
08 Oct 2026
Axioms
none listed
Built on 4
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • Cslib.LTS.CanReachA state s1 can reach a state s2 if there exists a multistep transition from s1 to s2.
  • 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…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.LTS in
universe u v in
variable {State : Type u} {Label : Type v} (lts : LTS State Label) (Terminated : State → Prop) in
/-- A state 'may terminate' if it can reach a terminated state. The definition of `Terminated` is a parameter. -/
def Cslib.LTS.MayTerminate (s : State) : Prop := ∃ s', Terminated s' ∧ lts.CanReach s s'
See it in the graphDiscuss this resultChallenge it