AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.NA.Buchi.histTrans

defimported Lean

The transition function of the history state.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Prod Filter in
variable {Symbol : Type*} {State : Bool → Type*} in
open scoped Classical in
@[scoped grind =, nolint unusedArguments]
noncomputable def Cslib.Automata.NA.Buchi.histTrans (acc : (i : Bool) → Set (State i))
    (s : (Π i, State i) × Bool) (_ : Symbol) (_ : Π i, State i) : Bool
Defined in
CSLib, `Cslib.Automata.NA.Buchi.histTrans`
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 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set Prod Filter in
variable {Symbol : Type*} {State : Bool → Type*} in
open scoped Classical in
/-- The transition function of the history state. -/
@[scoped grind =, nolint unusedArguments]
noncomputable def Cslib.Automata.NA.Buchi.histTrans (acc : (i : Bool) → Set (State i))
    (s : (Π i, State i) × Bool) (_ : Symbol) (_ : Π i, State i) : Bool :=
  if s ∈ interAcc false acc then true else
  if s ∈ interAcc true acc then false else s.snd
See it in the graphDiscuss this resultChallenge it