Cslib.LTS.MTr.cons_iff
theoremverifiedformalizationimported Lean
A multistep transition along μ :: μs is a transition labelled by μ plus a multistep transition labelled by μs.
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.MTr.cons_iff {lts : LTS State Label} : lts.MTr s1 (μ :: μs) s2 ↔ ∃ s, lts.Tr s1 μ s ∧ lts.MTr s μs s2
- Formalizes
- CSLib, `Cslib.LTS.MTr.cons_iff`
- 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.MTr.cons_iff← Cslib.LTS.MTr.cons_iff (Cslib/Foundations/Semantics/LTS/Basic.lean:117): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 3
- 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.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/-- A multistep transition along `μ :: μs` is a transition labelled by `μ` plus a multistep transition labelled by `μs`. -/theorem Cslib.LTS.MTr.cons_iff {lts : LTS State Label} : lts.MTr s1 (μ :: μs) s2 ↔ ∃ s, lts.Tr s1 μ s ∧ lts.MTr s μs s2 := by constructor · rintro (_ | ⟨htr, hmtr⟩) exact ⟨_, htr, hmtr⟩ · intro ⟨s, htr, hmtr⟩ exact .stepL htr hmtr