Cslib.LTS.Example.countdownLTS_not_bounded
theoremverifiedformalizationimported Lean
The countdown LTS is not bounded.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem Cslib.LTS.Example.countdownLTS_not_bounded : ¬ countdownLTS.Bounded
- Formalizes
- CSLib, `Cslib.LTS.Example.countdownLTS_not_bounded`
- Lean proof
- By Samuel Schlesinger, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Samuel Schlesinger. 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.Example.countdownLTS_not_bounded← Cslib.LTS.Example.countdownLTS_not_bounded (Cslib/Foundations/Semantics/LTS/ExampleTermination.lean:45): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 6
- Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
- Cslib.LTS.Example.countdownLTS_mTrCslib.LTS.Example.countdownLTS_mTr
- 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
nif every finite execution has length strictly less thann. - Cslib.LTS.Example.countdownLTSThe countdown LTS takes a natural number to its predecessor.
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 in/-- The countdown LTS is not bounded. -/theorem Cslib.LTS.Example.countdownLTS_not_bounded : ¬ countdownLTS.Bounded := by rintro ⟨bound, hbound⟩ simpa using hbound bound (List.replicate bound ()) 0 (countdownLTS_mTr bound)