Theorems · Theorem · commutative algebra
IsRelPrime.pow_right
∀ {α : Type u_1} [inst : CommMonoid α] [DecompositionMonoid α] {x y : α} {n : ℕ}, IsRelPrime x y → IsRelPrime x (y ^ n)- Defined in
- Mathlib.RingTheory.Coprime.Lemmas
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 63 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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
- Finset.rangeproof · cited by 1,341
- Finset.prod_constproof · cited by 154
- IsRelPrimestatement and proof · cited by 136
- Finset.card_rangeproof · cited by 108
- DecompositionMonoidstatement and proof · cited by 39
- IsRelPrime.prod_rightproof · cited by 4
Cited by1
Results whose statement or proof uses this declaration.
- IsRelPrime.powproof · cited by 0