Cslib.LTS.unionSubtype
defimported Lean
The union of two LTSs that have common supertypes for states and labels.
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.unionSubtype {S1 : State → Prop} {L1 : Label → Prop} {S2 : State → Prop} {L2 : Label → Prop} [DecidablePred S1] [DecidablePred L1] [DecidablePred S2] [DecidablePred L2] (lts1 : LTS (@Subtype State S1) (@Subtype Label L1)) (lts2 : LTS (@Subtype State S2) (@Subtype Label L2)) : LTS State Label
- Defined in
- CSLib, `Cslib.LTS.unionSubtype`
- 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.unionSubtype← Cslib.LTS.unionSubtype (Cslib/Foundations/Semantics/LTS/Union.lean:31): 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 /-- The union of two LTSs that have common supertypes for states and labels. -/ def Cslib.LTS.unionSubtype {S1 : State → Prop} {L1 : Label → Prop} {S2 : State → Prop} {L2 : Label → Prop} [DecidablePred S1] [DecidablePred L1] [DecidablePred S2] [DecidablePred L2] (lts1 : LTS (@Subtype State S1) (@Subtype Label L1)) (lts2 : LTS (@Subtype State S2) (@Subtype Label L2)) : LTS State Label where Tr := fun s μ s' => if h : S1 s ∧ L1 μ ∧ S1 s' then lts1.Tr ⟨s, h.1⟩ ⟨μ, h.2.1⟩ ⟨s', h.2.2⟩ else if h : S2 s ∧ L2 μ ∧ S2 s' then lts2.Tr ⟨s, h.1⟩ ⟨μ, h.2.1⟩ ⟨s', h.2.2⟩ else False