AFTD Auto-Formalizing Theoretical Domains

is_regular_zero

theoremverifiedformalization

The empty language is regular.

Statement

theorem is_regular_zero {α : Type*} : (0 : Language α).IsRegular
Formalizes
standard textbook result (automata theory: the empty language is regular)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext

Lean source view module on GitHub

/-- The empty language is regular. -/theorem is_regular_zero {α : Type*} : (0 : Language α).IsRegular := ⟨Unit, inferInstance, ⟨fun _ _ => (), (), ∅⟩, by  ext x  simp [DFA.mem_accepts]⟩
See it in the graphDiscuss this resultChallenge it