Theorems · Theorem · commutative algebra
IsRelPrime.pow_iff
∀ {α : Type u_1} [inst : CommMonoid α] [DecompositionMonoid α] {x y : α} {m n : ℕ},
0 < m → 0 < n → (IsRelPrime (x ^ m) (y ^ n) ↔ IsRelPrime x y)- Defined in
- Mathlib.RingTheory.Coprime.Lemmas
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CommMonoidstatement and proof · cited by 2,264
- IsRelPrimestatement · cited by 136
- DecompositionMonoidstatement and proof · cited by 39
- IsRelPrime.pow_left_iffproof · cited by 2
- IsRelPrime.pow_right_iffproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.