Set.Saturates
defimported Lean
f : ι → Set α saturates s : Set α iff f i is a subset of s whenever f i and s has any intersection at all.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {ι α : Type*} in def Set.Saturates (f : ι → Set α) (s : Set α) : Prop
- Defined in
- CSLib, `Set.Saturates`
- 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.Set.Saturates← Set.Saturates (Cslib/Foundations/Data/Set/Saturation.lean:25): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 2
- Set.saturates_eq_biUnionIf
fis a cover and saturatess, thensis the union of allf ithat intersectss. - Set.saturates_complIf
fsaturatess, thenfsaturates its complementsᶜas well.
- Set.saturates_eq_biUnionIf
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {ι α : Type*} in /-- `f : ι → Set α` saturates `s : Set α` iff `f i` is a subset of `s` whenever `f i` and `s` has any intersection at all. -/ def Set.Saturates (f : ι → Set α) (s : Set α) : Prop := ∀ i : ι, (f i ∩ s).Nonempty → f i ⊆ s