Cslib.LTS.Example.successorLTS_transGen_lt
theoremverifiedformalizationimported Lean
Cslib.LTS.Example.successorLTS_transGen_lt
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in theorem Cslib.LTS.Example.successorLTS_transGen_lt {n m : ℕ} (h : Relation.TransGen successorLTS.UnlabelledTr n m) : n < m
- Formalizes
- CSLib, `Cslib.LTS.Example.successorLTS_transGen_lt`
- 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_transGen_lt← Cslib.LTS.Example.successorLTS_transGen_lt (Cslib/Foundations/Semantics/LTS/ExampleTermination.lean:53): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 3
- Cslib.LTS.Example.successorLTSThe successor LTS takes each natural number to its successor.
- 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…
- Used by 1
- Cslib.LTS.Example.successorLTS_acyclicCslib.LTS.Example.successorLTS_acyclic
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.successorLTS_transGen_lt {n m : ℕ} (h : Relation.TransGen successorLTS.UnlabelledTr n m) : n < m := by apply Relation.transGen_minimal (r' := (· < ·)) at h · exact h · rintro n m ⟨μ, htr⟩ simp only [successorLTS] at htr omega