AFTD Auto-Formalizing Theoretical Domains

Set.saturates_eq_biUnion

theoremverifiedformalizationimported Lean

If f is a cover and saturates s, then s is the union of all f i that intersects s.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {ι α : Type*} in
variable {f : ι → Set α} {s : Set α} in
theorem Set.saturates_eq_biUnion (hs : Saturates f s) (hc : ⋃ i, f i = univ) :
    s = ⋃ i ∈ {i | (f i ∩ s).Nonempty}, f i
Formalizes
CSLib, `Set.saturates_eq_biUnion`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 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 2
  • Set.saturates_complIf f saturates s, then f saturates its complement sᶜ as well.
  • Set.Saturatesf : ι → Set α saturates s : Set α iff f i is a subset of s whenever f i and s has any intersection at all.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {ι α : Type*} invariable {f : ι → Set α} {s : Set α} in/-- If `f` is a cover and saturates `s`, then `s` is the union of all `f i` that intersects `s`. -/theorem Set.saturates_eq_biUnion (hs : Saturates f s) (hc : ⋃ i, f i = univ) :    s = ⋃ i ∈ {i | (f i ∩ s).Nonempty}, f i := by  ext x  simp only [mem_iUnion]  constructor  · intro h_x    obtain ⟨i, _⟩ := mem_iUnion.mp <| univ_subset_iff.mpr hc <| mem_univ x    use i, ⟨x, by grind⟩, by grind  · rintro ⟨i, h_i, _⟩    grind [hs i h_i]
See it in the graphDiscuss this resultChallenge it