Cslib.LTS.Deterministic.eq_of_tr
theoremverifiedformalizationimported Lean
Cslib.LTS.Deterministic.eq_of_tr
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in universe u v in variable {State : Type u} {Label : Type v} (lts : LTS State Label) in theorem Cslib.LTS.Deterministic.eq_of_tr {lts : LTS State Label} [lts.Deterministic] (htr : lts.Tr s1 μ s2) (htr' : lts.Tr s1 μ s2') : s2 = s2'
- Formalizes
- CSLib, `Cslib.LTS.Deterministic.eq_of_tr`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Fabrizio Montesi. 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.Deterministic.eq_of_tr← Cslib.LTS.Deterministic.eq_of_tr (Cslib/Foundations/Semantics/LTS/Basic.lean:231): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- Cslib.LTS.DeterministicAn lts is deterministic if a state cannot reach different states with the same transition label.
- 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.Deterministic.eq_of_mTrIn a deterministic lts, multistep transitions with a given start state and trace reach a unique end state.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in universe u v in variable {State : Type u} {Label : Type v} (lts : LTS State Label) in theorem Cslib.LTS.Deterministic.eq_of_tr {lts : LTS State Label} [lts.Deterministic] (htr : lts.Tr s1 μ s2) (htr' : lts.Tr s1 μ s2') : s2 = s2' := Deterministic.deterministic s1 μ s2 s2' htr htr'