Theorems · Theorem · order theory
Multiset.sup_powerset_len
∀ {α : Type u_2} [inst : DecidableEq α] (x : Multiset α),
((Finset.range (x.card + 1)).sup fun k => Multiset.powersetCard k x) = x.powerset- Cited by
- 0 results in Mathlib
- Foundations
- Depth 66 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Finset.rangestatement and proof · cited by 1,341
- Multiset.mapproof · cited by 876
- Finset.supstatement and proof · cited by 530
- Multiset.sumproof · cited by 388
- Multiset.cardstatement and proof · cited by 375
- Multiset.bindproof · cited by 59
- Multiset.rangeproof · cited by 30
- Multiset.powersetCardstatement and proof · cited by 29
- Multiset.powersetstatement and proof · cited by 27
- Finset.sum_eq_multiset_sumproof · cited by 5
- Finset.range_valproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.