Theorems · Definition · order theory
Multiset.inf
{α : Type u_1} → [inst : SemilatticeInf α] → [OrderTop α] → Multiset α → αInfimum of a multiset: inf {a, b, c} = a ⊓ b ⊓ c
- Defined in
- Mathlib.Data.Multiset.Lattice
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses propext
- Assumes
- SemilatticeInfOrderTop
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.
- Top.topproof · cited by 9,680
- Multisetstatement and proof · cited by 2,627
- SemilatticeInfstatement and proof · cited by 634
- OrderTopstatement and proof · cited by 493
- Multiset.foldproof · cited by 38
Cited by19
Results whose statement or proof uses this declaration.
- Multiset.inf_consstatement · cited by 5
- Multiset.inf_zerostatement · cited by 4
- Multiset.le_infstatement and proof · cited by 3
- Multiset.inf_dedupstatement · cited by 3
- Multiset.inf_addstatement · cited by 2
- Ideal.multiset_prod_le_infstatement and proof · cited by 1
- Finset.inf_defstatement · cited by 1
- Finset.trop_infproof · cited by 1
- Multiset.inf_lestatement · cited by 1
- Multiset.inf_singletonstatement · cited by 1
- Multiset.trop_infstatement and proof · cited by 1
- Multiset.untrop_sumstatement and proof · cited by 1