Theorems · Theorem · commutative algebra
IsRelPrime.pow_left
∀ {α : Type u_1} [inst : CommMonoid α] [DecompositionMonoid α] {x y : α} {m : ℕ}, IsRelPrime x y → IsRelPrime (x ^ m) y- Defined in
- Mathlib.RingTheory.Coprime.Lemmas
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 62 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_leftproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- IsRelPrime.pow_left_iffproof · cited by 2
- IsRelPrime.powproof · cited by 0