Mathlib Map

Theorems · Theorem · combinatorics

Nat.uniformBell_zero_left

∀ (n : ℕ), Nat.uniformBell 0 n = 1
Defined in
Mathlib.Combinatorics.Enumerative.Bell
Cited by
1 results in Mathlib
Foundations
Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

DividedPowers.OfInvertibleFactorial.dpow_comp_of_mul_lt · cited by 1OfInvertibleFactorial.dpo…Nat.uniformBell · cited by 19Nat.uniformBellNat.uniformBell_eq · cited by 5Nat.uniformBell_eqNat.uniformBell_zero_leftCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.