Theorems · Definition · combinatorics
Nat.multichoose
ℕ → ℕ → ℕ
multichoose n k is the number of multisets of cardinality k from a type of cardinality n.
- Defined in
- Mathlib.Data.Nat.Choose.Basic
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 48 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by14
Results whose statement or proof uses this declaration.
- Nat.multichoose_zero_rightstatement · cited by 5
- Nat.multichoose_zero_succstatement · cited by 4
- Sym.card_sym_eq_multichoosestatement · cited by 3
- Nat.multichoose_eqstatement · cited by 2
- Nat.multichoose_succ_succstatement and proof · cited by 2
- Sym.card_sym_fin_eq_multichoosestatement · cited by 1
- Nat.multichoose_onestatement and proof · cited by 1
- Sym.natCard_sym_eq_multichoosestatement and proof · cited by 1
- Nat.multichoose_one_rightstatement and proof · cited by 0
- Nat.multichoose_twostatement and proof · cited by 0
- Nat.sum_range_multichoosestatement and proof · cited by 0
- Nat.multichoose.eq_defstatement · cited by 0