AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.NA.iSum

defimported Lean

The sum of an indexed family of nondeterministic automata.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Function in
variable {Symbol I : Type*} {State : I → Type*} in
@[scoped grind =]
def Cslib.Automata.NA.iSum (na : (i : I) → NA (State i) Symbol) : NA (Σ i, State i) Symbol
Defined in
CSLib, `Cslib.Automata.NA.iSum`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Ching-Tsun Chou. 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
none listed
Built on 2
  • Cslib.Automata.NAA nondeterministic automaton extends a LTS with a set of initial states.
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Function in
variable {Symbol I : Type*} {State : I → Type*} in
/-- The sum of an indexed family of nondeterministic automata. -/
@[scoped grind =]
def Cslib.Automata.NA.iSum (na : (i : I) → NA (State i) Symbol) : NA (Σ i, State i) Symbol where
  start := ⋃ i, Sigma.mk i '' (na i).start
  Tr s x t := ∃ i s_i t_i, (na i).Tr s_i x t_i ∧ ⟨i, s_i⟩ = s ∧ ⟨i, t_i⟩ = t
See it in the graphDiscuss this resultChallenge it