Mathlib Map

Theorems · Theorem · number theory

Nat.count_of_forall

∀ {p : ℕ → Prop} [inst : DecidablePred p] {n : ℕ}, (∀ n' < n, p n') → Nat.count p n = n

Alias of the reverse direction of Nat.count_iff_forall.

Defined in
Mathlib.Data.Nat.Count
Cited by
2 results in Mathlib
Foundations
Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DecidablePred
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Nat.nth_of_forall · cited by 1Nat.nth_of_forallNat.count_true · cited by 0Nat.count_trueNat.count · cited by 55Nat.countNat.count_iff_forall · cited by 1Nat.count_iff_forallNat.count_of_forallCITED BYCITES

Cites2

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

Cited by2

Results whose statement or proof uses this declaration.