AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.NA.addHist

defimported Lean

The construction of adding a history state. Note that start' can depend on the initial value of the original state and tr' can depend on the new value of the original state. So there is no loss of generality in their being functions, rather than relations.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Prod in
variable {Symbol State Hist : Type*} in
@[scoped grind =]
def Cslib.Automata.NA.addHist (na : NA State Symbol) (start' : State → Hist)
    (tr' : State × Hist → Symbol → State → Hist) : NA (State × Hist) Symbol
Defined in
CSLib, `Cslib.Automata.NA.addHist`
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 Prod in
variable {Symbol State Hist : Type*} in
/-- The construction of adding a history state. Note that `start'` can depend on the initial value of the original state and `tr'` can depend on the new value of the original state. So there is no loss of generality in their being functions, rather than relations. -/
@[scoped grind =]
def Cslib.Automata.NA.addHist (na : NA State Symbol) (start' : State → Hist)
    (tr' : State × Hist → Symbol → State → Hist) : NA (State × Hist) Symbol where
  Tr s x t := na.Tr s.fst x t.fst ∧ tr' s x t.fst = t.snd
  start := { s | s.fst ∈ na.start ∧ start' s.fst = s.snd }
See it in the graphDiscuss this resultChallenge it