Cslib.LTS.Example.successorLTS_acyclic
instanceimported Lean
Cslib.LTS.Example.successorLTS_acyclic
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in instance Cslib.LTS.Example.successorLTS_acyclic : successorLTS.Acyclic
- Defined in
- CSLib, `Cslib.LTS.Example.successorLTS_acyclic`
- 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.successorLTS_acyclic← Cslib.LTS.Example.successorLTS_acyclic (Cslib/Foundations/Semantics/LTS/ExampleTermination.lean:61): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.LTS.AcyclicAn LTS is acyclic if its underlying unlabelled transition relation contains no nonempty cycle.
- Cslib.LTS.Example.successorLTSThe successor LTS takes each natural number to its successor.
- Cslib.LTS.UnlabelledTrThe unlabelled transition relation underlying an LTS.
- Cslib.LTS.Example.successorLTS_transGen_ltCslib.LTS.Example.successorLTS_transGen_lt
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in instance Cslib.LTS.Example.successorLTS_acyclic : successorLTS.Acyclic where acyclic := ⟨fun n h => (Nat.lt_irrefl n) (successorLTS_transGen_lt h)⟩