Theorems · Theorem · number theory
IsPrimePow.ne_one
∀ {R : Type u_1} [inst : CommMonoidWithZero R] {n : R}, IsPrimePow n → n ≠ 1- Defined in
- Mathlib.Algebra.IsPrimePow
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext
- Assumes
- CommMonoidWithZero
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CommMonoidWithZerostatement and proof · cited by 913
- IsPrimePowstatement and proof · cited by 77
- not_isPrimePow_oneproof · cited by 2
Cited by7
Results whose statement or proof uses this declaration.
- Choose.minFac_dvd_gcd_choose_of_isPrimePowproof · cited by 2
- IsPrimitiveRoot.sub_one_norm_isPrimePowproof · cited by 2
- Choose.minFac_sq_ndvd_gcd_choose_of_isPrimePowproof · cited by 1
- Choose.primeFactors_gcd_choose_of_isPrimePowproof · cited by 1
- Nat.disjoint_divisors_filter_isPrimePowproof · cited by 1
- Choose.gcd_choose_eq_minFac_of_isPrimePowproof · cited by 0
- Nat.Primes.prodNatEquiv_symm_applystatement · cited by 0