Cslib.LTS.Example.countdownLTS_mTr
theoremverifiedformalizationimported Lean
Cslib.LTS.Example.countdownLTS_mTr
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem Cslib.LTS.Example.countdownLTS_mTr (n : ℕ) : countdownLTS.MTr n (List.replicate n ()) 0
- Formalizes
- CSLib, `Cslib.LTS.Example.countdownLTS_mTr`
- 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_mTr← Cslib.LTS.Example.countdownLTS_mTr (Cslib/Foundations/Semantics/LTS/ExampleTermination.lean:37): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 5
- 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.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
- Cslib.LTS.Example.countdownLTSThe countdown LTS takes a natural number to its predecessor.
- 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
- Cslib.LTS.Example.countdownLTS_not_boundedThe countdown LTS is not bounded.
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 intheorem Cslib.LTS.Example.countdownLTS_mTr (n : ℕ) : countdownLTS.MTr n (List.replicate n ()) 0 := by induction n with | zero => exact .refl | succ n ih => simpa [List.replicate_succ] using MTr.stepL (by simp [countdownLTS]) ih