Theorems · Theorem · order theory
Nat.card_Icc
∀ (a b : ℕ), (Finset.Icc a b).card = b + 1 - a
- Defined in
- Mathlib.Order.Interval.Finset.Nat
- Cited by
- 14 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finset.cardstatement · cited by 2,327
- Finset.Iccstatement · cited by 348
Cited by14
Results whose statement or proof uses this declaration.
- Nat.card_uIccproof · cited by 4
- Multiset.card_Iccproof · cited by 4
- schnirelmannDensity_setOfPred_mod_eq_oneproof · cited by 3
- Subgroup.exists_pow_mem_of_index_ne_zeroproof · cited by 2
- Nat.card_Iicproof · cited by 2
- Chebyshev.abs_psi_sub_theta_le_sqrt_mul_logproof · cited by 2
- AddSubgroup.exists_nsmul_mem_of_index_ne_zeroproof · cited by 2
- Chebyshev.psi_eq_sum_mul_log_primeproof · cited by 2
- centralBinom_le_of_no_bertrand_primeproof · cited by 1
- NormedAddCommGroup.exists_norm_nsmul_leproof · cited by 1
- PNat.card_Iccproof · cited by 1
- Nat.factorization_eq_card_pow_dvdproof · cited by 1