Theorems · Theorem · number theory
Squarefree.natFactorization_le_one
∀ {n : ℕ} (p : ℕ), Squarefree n → n.factorization p ≤ 1- Defined in
- Mathlib.Data.Nat.Squarefree
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 90 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Finsuppstatement · cited by 5,255
- Nat.Primeproof · cited by 2,059
- IsUnitproof · cited by 1,602
- eq_or_neproof · cited by 1,117
- zero_le_oneproof · cited by 316
- Nat.factorizationstatement · cited by 215
- emultiplicityproof · cited by 156
- Squarefreestatement and proof · cited by 112
- Nat.Prime.ne_oneproof · cited by 61
- Nat.factorization_zeroproof · cited by 32
- Nat.factorization_eq_zero_of_not_primeproof · cited by 22
Cited by3
Results whose statement or proof uses this declaration.
- Nat.factorization_eq_one_of_squarefreeproof · cited by 0
- Nat.Squarefree.ext_iffproof · cited by 0
- Nat.squarefree_iff_factorization_le_oneproof · cited by 0