Theorems · Theorem · combinatorics
Nat.uniformBell_eq
∀ (m n : ℕ), m.uniformBell n = ∏ p ∈ Finset.range m, (p * n + n - 1).choose (n - 1)
- Defined in
- Mathlib.Combinatorics.Enumerative.Bell
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 76 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites27
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetproof · cited by 13,712
- mul_oneproof · cited by 3,885
- one_mulproof · cited by 2,841
- add_zeroproof · cited by 2,707
- Finset.prodstatement and proof · cited by 2,356
- MulZeroClass.mul_zeroproof · cited by 2,091
- Finset.rangestatement and proof · cited by 1,341
- Finset.prod_congrproof · cited by 646
- Nat.choosestatement and proof · cited by 494
- Finset.eraseproof · cited by 455
- Multiset.countproof · cited by 302
- mul_iteproof · cited by 159
Cited by5
Results whose statement or proof uses this declaration.
- Nat.uniformBell_zero_leftproof · cited by 1
- Nat.uniformBell_one_leftproof · cited by 0
- Nat.uniformBell_one_rightproof · cited by 0
- Nat.uniformBell_succ_leftproof · cited by 0
- Nat.uniformBell_zero_rightproof · cited by 0