Metamath Proof Explorer


Theorem rpmul

Description: If K is relatively prime to M and to N , it is also relatively prime to their product. (Contributed by Mario Carneiro, 24-Feb-2014) (Proof shortened by Mario Carneiro, 2-Jul-2015)

Ref Expression
Assertion rpmul ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K gcd M = 1 ∧ K gcd N = 1 → K gcd M ⋅ N = 1

Proof

Step Hyp Ref Expression
1 mulgcddvds ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K gcd M ⋅ N ∥ K gcd M ⁢ K gcd N
2 oveq12 ⊢ K gcd M = 1 ∧ K gcd N = 1 → K gcd M ⁢ K gcd N = 1 ⋅ 1
3 1t1e1 ⊢ 1 ⋅ 1 = 1
4 2 3 eqtrdi ⊢ K gcd M = 1 ∧ K gcd N = 1 → K gcd M ⁢ K gcd N = 1
5 4 breq2d ⊢ K gcd M = 1 ∧ K gcd N = 1 → K gcd M ⋅ N ∥ K gcd M ⁢ K gcd N ↔ K gcd M ⋅ N ∥ 1
6 1 5 syl5ibcom ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K gcd M = 1 ∧ K gcd N = 1 → K gcd M ⋅ N ∥ 1
7 simp1 ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K ∈ ℤ
8 zmulcl ⊢ M ∈ ℤ ∧ N ∈ ℤ → M ⋅ N ∈ ℤ
9 8 3adant1 ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → M ⋅ N ∈ ℤ
10 7 9 gcdcld ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K gcd M ⋅ N ∈ ℕ 0
11 dvds1 ⊢ K gcd M ⋅ N ∈ ℕ 0 → K gcd M ⋅ N ∥ 1 ↔ K gcd M ⋅ N = 1
12 10 11 syl ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K gcd M ⋅ N ∥ 1 ↔ K gcd M ⋅ N = 1
13 6 12 sylibd ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K gcd M = 1 ∧ K gcd N = 1 → K gcd M ⋅ N = 1