Cslib.LTS.Deterministic.eq_of_mTr
theoremverifiedformalizationimported Lean
In a deterministic lts, multistep transitions with a given start state and trace reach a unique end state.
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_mTr {lts : LTS State Label} [lts.Deterministic] (hmtr : lts.MTr s1 μs s2) (hmtr' : lts.MTr s1 μs s2') : s2 = s2'
- Formalizes
- CSLib, `Cslib.LTS.Deterministic.eq_of_mTr`
- 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_mTr← Cslib.LTS.Deterministic.eq_of_mTr (Cslib/Foundations/Semantics/LTS/Basic.lean:237): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- 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.DeterministicAn lts is deterministic if a state cannot reach different states with the same transition label.
- Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
- Cslib.LTS.Deterministic.eq_of_trCslib.LTS.Deterministic.eq_of_tr
- 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
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 inopen Cslib Cslib.LTS inuniverse u v invariable {State : Type u} {Label : Type v} (lts : LTS State Label) in/-- In a deterministic lts, multistep transitions with a given start state and trace reach a unique end state. -/theorem Cslib.LTS.Deterministic.eq_of_mTr {lts : LTS State Label} [lts.Deterministic] (hmtr : lts.MTr s1 μs s2) (hmtr' : lts.MTr s1 μs s2') : s2 = s2' := by induction μs generalizing s1 s2 s2' with | nil => grind | cons μ μs ih => rcases hmtr with (_ | ⟨htr, hmtr⟩); rcases hmtr' with (_ | ⟨htr', hmtr'⟩) rw [eq_of_tr htr htr'] at hmtr exact ih hmtr hmtr'