AFTD Auto-Formalizing Theoretical Domains

Cslib.Automata.Acceptor.mem_language

theoremverifiedformalizationimported Lean

A string is in the language of an acceptor iff the acceptor accepts it.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {Symbol : Type v} in
@[simp, scoped grind =]
theorem Cslib.Automata.Acceptor.mem_language [Acceptor A Symbol] (a : A) (xs : List Symbol) :
  xs ∈ language a ↔ Accepts a xs
Formalizes
CSLib, `Cslib.Automata.Acceptor.mem_language`
Lean proof
By 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.
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 2
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {Symbol : Type v} in
/-- A string is in the language of an acceptor iff the acceptor accepts it. -/
@[simp, scoped grind =]
theorem Cslib.Automata.Acceptor.mem_language [Acceptor A Symbol] (a : A) (xs : List Symbol) :
  xs ∈ language a ↔ Accepts a xs := Iff.rfl
See it in the graphDiscuss this resultChallenge it