AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.Acyclic.toBounded

theoremverifiedformalizationimported Lean

On a finite state space, acyclic LTSs are bounded.

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
theorem Cslib.LTS.Acyclic.toBounded [Finite State] (h : lts.Acyclic) : lts.Bounded
Formalizes
CSLib, `Cslib.LTS.Acyclic.toBounded`
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
Classical.choiceQuot.soundpropext
Built on 7
  • Cslib.LTS.Acyclic.toBoundedUpToOn a finite state space, an acyclic LTS has execution length strictly less than the number of states.
  • Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
  • Cslib.LTS.AcyclicAn LTS is acyclic if its underlying unlabelled transition relation contains no nonempty cycle.
  • Cslib.LTS.BoundedAn LTS is bounded if there is a global bound on the length of all of its finite executions.
  • Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
  • Cslib.LTS.BoundedUpToAn LTS is bounded up to n if every finite execution has length strictly less than n.
  • 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
/-- On a finite state space, acyclic LTSs are bounded. -/
theorem Cslib.LTS.Acyclic.toBounded [Finite State] (h : lts.Acyclic) : lts.Bounded :=
  ⟨Nat.card State, h.toBoundedUpTo⟩
See it in the graphDiscuss this resultChallenge it