Theorems · Theorem · number theory
IsPrimePow.exists_ordCompl_eq_one
∀ {n : ℕ}, IsPrimePow n → ∃ p, Nat.Prime p ∧ n / p ^ n.factorization p = 1- Defined in
- Mathlib.Data.Nat.Factorization.PrimePow
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
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 and proof · cited by 5,255
- Nat.Primestatement and proof · cited by 2,059
- LT.lt.ne'proof · cited by 1,417
- eq_or_neproof · cited by 1,117
- Finsupp.singleproof · cited by 943
- Nat.factorizationstatement and proof · cited by 215
- Finsupp.single_eq_sameproof · cited by 171
- IsPrimePowstatement and proof · cited by 77
- Finsupp.eraseproof · cited by 46
- Nat.factorization_eq_zero_of_not_primeproof · cited by 22
- em'proof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- exists_ordCompl_eq_one_iff_isPrimePowproof · cited by 0