AFTD Auto-Formalizing Theoretical Domains

Language.mem_sub_one

theoremverifiedformalizationimported Lean

Language.mem_sub_one

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
@[simp, scoped grind =]
theorem Language.mem_sub_one (x : List α) : x ∈ (l - 1) ↔ x ∈ l ∧ x ≠ []
Formalizes
CSLib, `Language.mem_sub_one`
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
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Set List in
open scoped Computability in
variable {α : Type*} {l m : Language α} in
@[simp, scoped grind =]
theorem Language.mem_sub_one (x : List α) : x ∈ (l - 1) ↔ x ∈ l ∧ x ≠ [] :=
  Iff.rfl
See it in the graphDiscuss this resultChallenge it