Theorems · Theorem · order theory
Multiset.sup_cons
∀ {α : Type u_1} [inst : SemilatticeSup α] [inst_1 : OrderBot α] (a : α) (s : Multiset α), (a ::ₘ s).sup = a ⊔ s.sup- Defined in
- Mathlib.Data.Multiset.Lattice
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext, Quot.sound
- Assumes
- SemilatticeSupOrderBot
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.consstatement · cited by 313
- Multiset.supstatement · cited by 20
- Multiset.fold_cons_leftproof · cited by 14
Cited by3
Results whose statement or proof uses this declaration.
- Multiset.sup_leproof · cited by 3
- Multiset.nodup_sup_iffproof · cited by 0
- Multiset.sup_ndinsertproof · cited by 0