Theorems · Theorem · number theory

Nat.count_iff_forall

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

Defined in

Mathlib.Data.Nat.Count

Cited by

1 results in Mathlib

Foundations

Depth 59 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

DecidablePred