Theorems · Theorem · order theory
partialSups_eq_sup_range
∀ {α : Type u_1} [inst : SemilatticeSup α] [inst_1 : OrderBot α] (f : ℕ → α) (n : ℕ),
(partialSups f) n = (Finset.range (n + 1)).sup f- Defined in
- Mathlib.Order.PartialSups
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemilatticeSupOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finset.rangestatement · cited by 1,341
- OrderBotstatement and proof · cited by 1,055
- OrderHomstatement · cited by 934
- SemilatticeSupstatement and proof · cited by 785
- Finset.supstatement · cited by 530
- eq_of_forall_ge_iffproof · cited by 96
- partialSupsstatement · cited by 67
Cited by1
Results whose statement or proof uses this declaration.
- Set.partialSups_eq_accumulateproof · cited by 1