Cslib.LTS.inl
defimported Lean
Lifting of an LTS State Label to LTS (State ⊕ State') Label.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v in variable {State : Type u} {Label : Type v} in def Cslib.LTS.inl (lts : LTS State Label) : LTS { x : State ⊕ State' // x.isLeft } { _label : Label // True }
- Defined in
- CSLib, `Cslib.LTS.inl`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 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.inl← Cslib.LTS.inl (Cslib/Foundations/Semantics/LTS/Union.lean:46): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled…
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
- Used by 1
- Cslib.LTS.unionSumUnion of two LTSs with the same
Labeltype. The result combines the original respective state typesState1andState2into…
- Cslib.LTS.unionSumUnion of two LTSs with the same
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v in variable {State : Type u} {Label : Type v} in /-- Lifting of an `LTS State Label` to `LTS (State ⊕ State') Label`. -/ def Cslib.LTS.inl (lts : LTS State Label) : LTS { x : State ⊕ State' // x.isLeft } { _label : Label // True } where Tr s μ s' := match s, s' with | ⟨.inl s1, _⟩, ⟨.inl s2, _⟩ => lts.Tr s1 μ s2 | _, _ => False