Theorems · Definition · order theory
Set.dissipate
{α : Type u_1} → {β : Type u_2} → [LE α] → (α → Set β) → α → Set βdissipate s is the intersection of s y for y ≤ x.
- Defined in
- Mathlib.Order.SetDissipate
- Cited by
- 24 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.iInterproof · cited by 1,084
Cited by25
Results whose statement or proof uses this declaration.
- IsCompactSystemproof · cited by 15
- Set.antitone_dissipatestatement · cited by 4
- IsCompactSystem.insert_univproof · cited by 2
- IsCompactSystem.of_nonempty_iInterstatement and proof · cited by 2
- isCompactSystem_isCompact_isClosedproof · cited by 2
- Set.dissipate_subsetstatement · cited by 2
- Set.dissipate_succstatement · cited by 2
- Set.dissipate_zero_natstatement · cited by 2
- Set.exists_dissipate_eq_empty_iff_of_directedstatement and proof · cited by 1
- Set.iInter_dissipatestatement · cited by 1
- IsCompactSystem.iff_nonempty_iInterstatement · cited by 1
- IsCompactSystem.nonempty_iInterstatement and proof · cited by 1