Cslib.FLTS.prod
defimported Lean
The product of two FLTS with the same label type.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in @[scoped grind =] def Cslib.FLTS.prod (flts1 : FLTS State1 Label) (flts2 : FLTS State2 Label) : FLTS (State1 × State2) Label
- Defined in
- CSLib, `Cslib.FLTS.prod`
- Lean proof
- By Ching-Tsun Chou, 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.FLTS.prod← Cslib.FLTS.prod (Cslib/Foundations/Semantics/FLTS/Prod.lean:21): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- Cslib.FLTSA Functional Labelled Transition System (
FLTS) for a type of states (State) and a type of transition labels (Label) consists of a…
- Cslib.FLTSA Functional Labelled Transition System (
- Used by 2
- Cslib.FLTS.prod_mtr_eqA state is reachable by the product FLTS iff its components are reachable by the respective FLTS components.
- Cslib.Automata.DA.prodThe product of two deterministic automata.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in /-- The product of two FLTS with the same label type. -/ @[scoped grind =] def Cslib.FLTS.prod (flts1 : FLTS State1 Label) (flts2 : FLTS State2 Label) : FLTS (State1 × State2) Label where tr := fun (s1, s2) μ ↦ (flts1.tr s1 μ, flts2.tr s2 μ)