Cslib.LTS.Example.selfLoopLTS_not_acyclic
theoremverifiedformalizationimported Lean
The self-loop LTS is not acyclic.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem Cslib.LTS.Example.selfLoopLTS_not_acyclic : ¬ selfLoopLTS.Acyclic
- Formalizes
- CSLib, `Cslib.LTS.Example.selfLoopLTS_not_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.selfLoopLTS_not_acyclic← Cslib.LTS.Example.selfLoopLTS_not_acyclic (Cslib/Foundations/Semantics/LTS/ExampleTermination.lean:75): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 4
- Cslib.LTS.AcyclicAn LTS is acyclic if its underlying unlabelled transition relation contains no nonempty cycle.
- Cslib.LTS.Example.selfLoopLTSThe self-loop LTS has a transition from its unique state to itself.
- Cslib.LTS.UnlabelledTrThe unlabelled transition relation underlying an LTS.
- 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 /-- The self-loop LTS is not acyclic. -/ theorem Cslib.LTS.Example.selfLoopLTS_not_acyclic : ¬ selfLoopLTS.Acyclic := fun h => h.acyclic.irrefl () (.single ⟨(), trivial⟩)