Theorems · Theorem · commutative algebra
UniqueFactorizationMonoid.prime_pow_coprime_prod_of_coprime_insert
∀ {α : Type u_1} [inst : CommMonoidWithZero α] [UniqueFactorizationMonoid α] [inst_2 : DecidableEq α] {s : Finset α}
(i : α → ℕ),
∀ p ∉ s,
(∀ q ∈ insert p s, Prime q) →
(∀ q ∈ insert p s, ∀ q' ∈ insert p s, q ∣ q' → q = q') → IsRelPrime (p ^ i p) (∏ p' ∈ s, p' ^ i p')- Cited by
- 2 results in Mathlib
- Foundations
- Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites20
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Finset.prodstatement and proof · cited by 2,356
- CommMonoidWithZerostatement and proof · cited by 913
- Multiset.mapproof · cited by 876
- Finset.valproof · cited by 438
- UniqueFactorizationMonoidstatement and proof · cited by 279
- Primestatement and proof · cited by 277
- pow_ne_zeroproof · cited by 208
- IsRelPrimestatement · cited by 136
- Finset.mem_insert_selfproof · cited by 128
- Finset.mem_insert_of_memproof · cited by 109
- Multiset.mem_mapproof · cited by 72
Cited by2
Results whose statement or proof uses this declaration.
- UniqueFactorizationMonoid.multiplicative_prime_powerproof · cited by 1
- UniqueFactorizationMonoid.induction_on_prime_powerproof · cited by 1