Theorems · Theorem · number theory
Nat.nth_count
∀ {p : ℕ → Prop} [inst : DecidablePred p] {n : ℕ}, p n → Nat.nth p (Nat.count p n) = n- Defined in
- Mathlib.Data.Nat.Nth
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 94 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidablePred
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.ofPredproof · cited by 6,101
- Finset.cardproof · cited by 2,327
- Set.Finiteproof · cited by 1,814
- Set.Finite.toFinsetproof · cited by 351
- Nat.nthstatement · cited by 84
- Nat.countstatement and proof · cited by 55
- Nat.nth_memproof · cited by 9
- Nat.count_nthproof · cited by 5
- Nat.count_injectiveproof · cited by 1
- Nat.count_lt_cardproof · cited by 1
Cited by7
Results whose statement or proof uses this declaration.
- Nat.nth_prime_zero_eq_twoproof · cited by 2
- Nat.nth_count_eq_sInfproof · cited by 1
- Nat.nth_of_forallproof · cited by 1
- Nat.nth_prime_two_eq_fiveproof · cited by 0
- Nat.nth_prime_four_eq_elevenproof · cited by 0
- Nat.nth_prime_one_eq_threeproof · cited by 0
- Nat.nth_prime_three_eq_sevenproof · cited by 0