Mathlib Map

Theorems · Theorem · order theory

Finset.sup_def

∀ {α : Type u_2} {β : Type u_3} [inst : SemilatticeSup α] [inst_1 : OrderBot α] {s : Finset β} {f : β → α},
  s.sup f = (Multiset.map f s.val).sup
Defined in
Mathlib.Data.Finset.Lattice.Fold
Cited by
1 results in Mathlib
Foundations
Depth 15 from the axioms · uses propext, Quot.sound
Assumes
SemilatticeSupOrderBot
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

List.foldr_sup_eq_sup_toFinset · cited by 1List.foldr_sup_eq_sup_toF…Finset · cited by 13712FinsetOrderBot · cited by 1055OrderBotMultiset.map · cited by 876Multiset.mapSemilatticeSup · cited by 785SemilatticeSupFinset.sup · cited by 530Finset.supFinset.val · cited by 438Finset.valMultiset.sup · cited by 20Multiset.supFinset.sup_defCITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.