Theorems · Theorem · order theory
Finset.sup_univ_eq_ciSup
∀ {ι : Type u_1} {α : Type u_2} [inst : ConditionallyCompleteLinearOrderBot α] [inst_1 : Fintype ι] (f : ι → α),
Finset.univ.sup f = ⨆ i, f i- Cited by
- 1 results in Mathlib
- Foundations
- Depth 80 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Finset.univstatement and proof · cited by 3,473
- iSupstatement · cited by 2,415
- le_antisymmproof · cited by 2,068
- Finset.supstatement · cited by 530
- Finset.mem_univproof · cited by 361
- Finset.le_supproof · cited by 112
- ConditionallyCompleteLinearOrderBotstatement and proof · cited by 84
- Set.finite_rangeproof · cited by 58
- le_ciSupproof · cited by 57
- Finset.sup_leproof · cited by 44
- ciSup_le'proof · cited by 39
Cited by1
Results whose statement or proof uses this declaration.
- PiLp.nnnorm_ofLpproof · cited by 2