Cslib.LTS.unionSum
defimported Lean
Union of two LTSs with the same Label type. The result combines the original respective state types State1 and State2 into (State1 ⊕ State2).
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.unionSum (lts1 : LTS State1 Label) (lts2 : LTS State2 Label) : LTS (State1 ⊕ State2) Label
- Defined in
- CSLib, `Cslib.LTS.unionSum`
- 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.unionSum← Cslib.LTS.unionSum (Cslib/Foundations/Semantics/LTS/Union.lean:63): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.LTS.unionSubtypeThe union of two LTSs that have common supertypes for states and labels.
- Cslib.LTS.inrLifting of an
LTS State LabeltoLTS (State' ⊕ State) Label. - Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled… - Cslib.LTS.inlLifting of an
LTS State LabeltoLTS (State ⊕ State') Label.
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 /-- Union of two LTSs with the same `Label` type. The result combines the original respective state types `State1` and `State2` into `(State1 ⊕ State2)`. -/ def Cslib.LTS.unionSum (lts1 : LTS State1 Label) (lts2 : LTS State2 Label) : LTS (State1 ⊕ State2) Label := unionSubtype lts1.inl lts2.inr