Mathlib Map

Theorems · Theorem · commutative algebra

IsRelPrime.pow_right_iff

∀ {α : Type u_1} [inst : CommMonoid α] [DecompositionMonoid α] {x y : α} {m : ℕ},
  0 < m → (IsRelPrime x (y ^ m) ↔ IsRelPrime x y)
Defined in
Mathlib.RingTheory.Coprime.Lemmas
Cited by
1 results in Mathlib
Foundations
Depth 64 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
CommMonoidDecompositionMonoid
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

IsRelPrime.pow_iff · cited by 0IsRelPrime.pow_iffCommMonoid · cited by 2264CommMonoidIsRelPrime · cited by 136IsRelPrimeDecompositionMonoid · cited by 39DecompositionMonoidisRelPrime_comm · cited by 8isRelPrime_commIsRelPrime.pow_left_iff · cited by 2IsRelPrime.pow_left_iffIsRelPrime.pow_right_iffCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.