Theorems · Definition · combinatorics
Nat.uniformBell
ℕ → ℕ → ℕ
Number of possibilities of dividing a set with m * n elements into m groups
of n-element subsets.
- Defined in
- Mathlib.Combinatorics.Enumerative.Bell
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 74 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multiset.replicateproof · cited by 88
- Multiset.bellproof · cited by 6
Cited by24
Results whose statement or proof uses this declaration.
- DividedPowers.extproof · cited by 5
- Nat.uniformBell_eqstatement · cited by 5
- DividedPowers.dpow_compstatement · cited by 3
- Nat.uniformBell_mul_eqstatement and proof · cited by 2
- DividedPowers.SubDPIdeal.dpow_mem_span_of_mem_spanproof · cited by 1
- DividedPowers.OfInvertibleFactorial.dpow_comp_of_mul_ltstatement and proof · cited by 1
- DividedPowers.mk.injstatement and proof · cited by 1
- DividedPowers.mk.injEqstatement and proof · cited by 1
- DividedPowers.casesOnstatement and proof · cited by 1
- DividedPowers.mk.noConfusionstatement and proof · cited by 1
- Nat.uniformBell_zero_leftstatement · cited by 1
- DividedPowers.dpEqualizer_is_dp_ideal_leftproof · cited by 0