Theorems · Theorem · order theory
Multiset.sup_add
∀ {α : Type u_1} [inst : SemilatticeSup α] [inst_1 : OrderBot α] (s₁ s₂ : Multiset α), (s₁ + s₂).sup = s₁.sup ⊔ s₂.sup- Defined in
- Mathlib.Data.Multiset.Lattice
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
- Assumes
- SemilatticeSupOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- sup_of_le_leftproof · cited by 218
- Multiset.foldproof · cited by 38
- Multiset.supstatement · cited by 20
- Multiset.fold_addproof · cited by 9
- Multiset.fold.congr_simpproof · cited by 9
Cited by2
Results whose statement or proof uses this declaration.
- Multiset.sup_ndunionproof · cited by 0
- Multiset.sup_unionproof · cited by 0