Theorems · Theorem · combinatorics
Finset.range_add_one
∀ {n : ℕ}, Finset.range (n + 1) = insert n (Finset.range n)- Defined in
- Mathlib.Data.Finset.Range
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 66 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.
- Finsetstatement · cited by 13,712
- Finset.rangestatement · cited by 1,341
Cited by23
Results whose statement or proof uses this declaration.
- Finset.sum_range_succ_commproof · cited by 12
- Polynomial.Chebyshev.iterate_derivative_U_eval_oneproof · cited by 3
- Finset.prod_range_succ_commproof · cited by 3
- Real.BohrMollerup.f_add_nat_eqproof · cited by 2
- Polynomial.IsWeaklyEisensteinAt.pow_natDegree_le_of_root_of_monic_memproof · cited by 2
- DividedPowers.isSubDPIdeal_inf_iffproof · cited by 2
- Polynomial.Chebyshev.iterate_derivative_T_eval_oneproof · cited by 2
- Polynomial.IsWeaklyEisensteinAt.exists_mem_adjoin_mul_eq_pow_natDegreeproof · cited by 1
- Polynomial.derivative_bernoulli_add_oneproof · cited by 1
- Nat.smoothNumbers_succproof · cited by 1
- Ioc_subset_biUnion_Iocproof · cited by 1
- Nat.primesBelow_succproof · cited by 1