Theorems · Theorem · commutative algebra
IsCoprime.pow
∀ {R : Type u} [inst : CommSemiring R] {x y : R} {m n : ℕ}, IsCoprime x y → IsCoprime (x ^ m) (y ^ n)- Defined in
- Mathlib.RingTheory.Coprime.Lemmas
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommSemiring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CommSemiringstatement and proof · cited by 10,911
- IsCoprimestatement and proof · cited by 321
- IsCoprime.pow_leftproof · cited by 5
- IsCoprime.pow_rightproof · cited by 2
Cited by7
Results whose statement or proof uses this declaration.
- Polynomial.prod_multiset_X_sub_C_dvdproof · cited by 5
- IsArtinianRing.nilradical_pow_eq_iInfproof · cited by 3
- Rat.AbsoluteValue.eq_one_of_not_dvdproof · cited by 1
- Polynomial.quo_mul_prod_pow_add_sum_rem_mul_prod_pow_uniqueproof · cited by 1
- ZMod.isSquare_neg_one_of_eq_sq_add_sq_of_isCoprimeproof · cited by 1
- Fermat42.not_minimalproof · cited by 1
- Polynomial.eq_quo_mul_prod_pow_add_sum_rem_mul_prod_powproof · cited by 1