Theorems · Theorem · order theory
Finset.iSup_coe
∀ {α : Type u_2} {β : Type u_3} [inst : SupSet β] (f : α → β) (s : Finset α), ⨆ x ∈ ↑s, f x = ⨆ x ∈ s, f x- Defined in
- Mathlib.Order.CompleteLattice.Finset
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 54 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SupSet
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- SetLike.coestatement · cited by 8,199
- iSupstatement · cited by 2,415
- SupSetstatement and proof · cited by 154
Cited by1
Results whose statement or proof uses this declaration.
- ExpGrowth.expGrowthSup_sumproof · cited by 0