AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.DA.prod_mtr_eq

theoremverifiedformalizationimported Lean

A state is reachable by the product automaton iff its components are reachable by the respective automaton components.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open List in
open scoped Cslib.FLTS in
variable {State1 State2 Symbol : Type*} in
@[simp, scoped grind =]
theorem Cslib.Automata.DA.prod_mtr_eq (da1 : DA State1 Symbol) (da2 : DA State2 Symbol)
    (s : State1 × State2) (xs : List Symbol) :
    (da1.prod da2).mtr s xs = (da1.mtr s.fst xs, da2.mtr s.snd xs)
Formalizes
CSLib, `Cslib.Automata.DA.prod_mtr_eq`
Lean proof
By Fabrizio Montesi, Ching-Tsun Chou, 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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • Cslib.FLTS.prod_mtr_eqA state is reachable by the product FLTS iff its components are reachable by the respective FLTS components.
  • Cslib.FLTS.mtrExtended transition function. Implementation note: compared to [Hopcroft2006], the definition consumes the input list of symbols from the…
  • Cslib.Automata.DAA deterministic automaton extends a FLTS with a unique initial state.
  • Cslib.FLTSA Functional Labelled Transition System (FLTS) for a type of states (State) and a type of transition labels (Label) consists of a…
  • 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
open List in
open scoped Cslib.FLTS in
variable {State1 State2 Symbol : Type*} in
/-- A state is reachable by the product automaton iff its components are reachable by the respective automaton components. -/
@[simp, scoped grind =]
theorem Cslib.Automata.DA.prod_mtr_eq (da1 : DA State1 Symbol) (da2 : DA State2 Symbol)
    (s : State1 × State2) (xs : List Symbol) :
    (da1.prod da2).mtr s xs = (da1.mtr s.fst xs, da2.mtr s.snd xs) :=
  FLTS.prod_mtr_eq da1.toFLTS da2.toFLTS s xs
See it in the graphDiscuss this resultChallenge it