Theorems · Theorem · number theory
Nat.bitIndices_sorted
∀ {n : ℕ}, n.bitIndices.SortedLT- Defined in
- Mathlib.Data.Nat.BitIndices
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- List.SortedLTstatement and proof · cited by 66
- Nat.binaryRecproof · cited by 24
- Nat.bitIndicesstatement and proof · cited by 22
- List.SortedLT.pairwiseproof · cited by 9
- Nat.bitIndices_two_mulproof · cited by 4
- Nat.bitIndices_zeroproof · cited by 3
- Nat.bitIndices_two_mul_add_oneproof · cited by 3
Cited by3
Results whose statement or proof uses this declaration.
- Finset.toFinset_bitIndices_sum_two_powproof · cited by 1
- Finset.sum_toFinset_bitIndices_two_powproof · cited by 1
- Nat.bitIndices_nodupproof · cited by 0