Theorems · Definition · order theory
Multiset.sup
{α : Type u_1} → [inst : SemilatticeSup α] → [OrderBot α] → Multiset α → αSupremum of a multiset: sup {a, b, c} = a ⊔ b ⊔ c
- Defined in
- Mathlib.Data.Multiset.Lattice
- Cited by
- 20 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext
- 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.
- Bot.botproof · cited by 4,720
- Multisetstatement and proof · cited by 2,627
- OrderBotstatement and proof · cited by 1,055
- SemilatticeSupstatement and proof · cited by 785
- Multiset.foldproof · cited by 38
Cited by20
Results whose statement or proof uses this declaration.
- Multiset.sup_consstatement · cited by 3
- Multiset.sup_dedupstatement · cited by 3
- Multiset.sup_lestatement and proof · cited by 3
- Multiset.sup_addstatement · cited by 2
- Multiset.sup_zerostatement · cited by 2
- Multiset.mem_sup_map_support_iffstatement · cited by 1
- Multiset.sup_singletonstatement · cited by 1
- Multiset.support_sum_eqstatement and proof · cited by 1
- Multiset.support_sum_subsetstatement · cited by 1
- Multiset.le_supstatement · cited by 1
- Finset.sup_defstatement · cited by 1
- List.foldr_sup_eq_sup_toFinsetproof · cited by 1