Theorems · Theorem · number theory
isPrimePow_iff_factorization_eq_single
∀ {n : ℕ}, IsPrimePow n ↔ ∃ p k, 0 < k ∧ n.factorization = fun₀ | p => k- Defined in
- Mathlib.Data.Nat.Factorization.PrimePow
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 93 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsuppstatement and proof · cited by 5,255
- Nat.Primeproof · cited by 2,059
- LT.lt.ne'proof · cited by 1,417
- Finsupp.singlestatement and proof · cited by 943
- Nat.factorizationstatement and proof · cited by 215
- Finsupp.single_eq_sameproof · cited by 171
- Finsupp.mem_support_iffproof · cited by 89
- IsPrimePowstatement · cited by 77
- Nat.factorization_zeroproof · cited by 32
- Nat.prime_of_mem_primeFactorsproof · cited by 29
- isPrimePow_nat_iffproof · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- IsPrimePow.exists_ordCompl_eq_oneproof · cited by 1