AFTD Auto-Formalizing Theoretical Domains

Language.eq_zero_or_one_ofIsEmpty

theoremverifiedformalizationimported Lean

0 and 1 are the only possible languages over an empty type.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set List in
open scoped Computability in
variable {α : Type*} {l m : Language α} in
theorem Language.eq_zero_or_one_ofIsEmpty [IsEmpty α] (l : Language α) : l = 0 ∨ l = 1
Formalizes
CSLib, `Language.eq_zero_or_one_ofIsEmpty`
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
Classical.choiceQuot.soundpropext
Built on 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Set List inopen scoped Computability invariable {α : Type*} {l m : Language α} in/-- `0` and `1` are the only possible languages over an empty type. -/theorem Language.eq_zero_or_one_ofIsEmpty [IsEmpty α] (l : Language α) : l = 0 ∨ l = 1 := by  by_cases h : l = 0  · simp [h]  · right    ext xl    obtain ⟨yl, _⟩ := nonempty_iff_ne_empty.mpr h    obtain ⟨rfl⟩ := eq_nil_ofIsEmpty xl    obtain ⟨rfl⟩ := eq_nil_ofIsEmpty yl    simpa
See it in the graphDiscuss this resultChallenge it