Mathlib Map

Theorems · Definition · order theory

Finset.sup

{α : Type u_2} → {β : Type u_3} → [inst : SemilatticeSup α] → [OrderBot α] → Finset β → (β → α) → α

Supremum of a finite set: sup {a, b, c} f = f a ⊔ f b ⊔ f c

Defined in
Mathlib.Data.Finset.Lattice.Fold
Cited by
530 results in Mathlib
Foundations
Depth 14 from the axioms, rests on 78 definitions · uses propext, Quot.sound
Assumes
SemilatticeSupOrderBot

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.

Cited by575

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 575.