Theorems · Theorem · order theory
Set.partialSups_eq_accumulate
∀ {α : Type u_1} (f : ℕ → Set α), ⇑(partialSups f) = Set.accumulate f- Defined in
- Mathlib.Order.SetAccumulate
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Setstatement and proof · cited by 53,352
- Set.iUnionproof · cited by 2,483
- Set.extproof · cited by 2,266
- Finset.rangeproof · cited by 1,341
- OrderHomstatement · cited by 934
- Set.iUnion_congr_Propproof · cited by 374
- partialSupsstatement · cited by 67
- Set.accumulatestatement · cited by 32
- Finset.sup_set_eq_biUnionproof · cited by 15
- partialSups_eq_sup_rangeproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- isCompact_setOfPred_finiteMeasure_mass_le_compl_isCompact_leproof · cited by 2