AFTD Auto-Formalizing Theoretical Domains

Language.mem_biSup

theoremverifiedformalizationimported Lean

A grind regression found moving to nightly-2026-03-31 (changes from lean#13166)

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]
theorem Language.mem_biSup {I : Type*} (s : Set I) (l : I → Language α) (x : List α) :
    (x ∈ ⨆ i ∈ s, l i) ↔ ∃ i ∈ s, x ∈ l i
Formalizes
CSLib, `Language.mem_biSup`
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

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
/-- A grind regression found moving to nightly-2026-03-31 (changes from lean#13166) -/
@[simp]
theorem Language.mem_biSup {I : Type*} (s : Set I) (l : I → Language α) (x : List α) :
    (x ∈ ⨆ i ∈ s, l i) ↔ ∃ i ∈ s, x ∈ l i where
  mp h := bex_def.mp (mem_iUnion₂.mp h)
  mpr h :=  mem_iUnion₂.mpr (bex_def.mpr h)
See it in the graphDiscuss this resultChallenge it