AFTD Auto-Formalizing Theoretical Domains

Set.saturates_compl

theoremverifiedformalizationimported Lean

If f saturates s, then f saturates its complement sᶜ as well.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {ι α : Type*} in
variable {f : ι → Set α} {s : Set α} in
@[simp, scoped grind .]
theorem Set.saturates_compl (hs : Saturates f s) : Saturates f sᶜ
Formalizes
CSLib, `Set.saturates_compl`
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 1
  • Set.Saturatesf : ι → Set α saturates s : Set α iff f i is a subset of s whenever f i and s has any intersection at all.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {ι α : Type*} invariable {f : ι → Set α} {s : Set α} in/-- If `f` saturates `s`, then `f` saturates its complement `sᶜ` as well. -/@[simp, scoped grind .]theorem Set.saturates_compl (hs : Saturates f s) : Saturates f sᶜ := by  rintro i ⟨_, _⟩ y _ _  have : (f i ∩ s).Nonempty := ⟨y, by grind⟩  grind [Saturates]
See it in the graphDiscuss this resultChallenge it