Metamath Proof Explorer


Theorem pythagtriplem3

Description: Lemma for pythagtrip . Show that C and B are relatively prime under some conditions. (Contributed by Scott Fenton, 8-Apr-2014) (Revised by Mario Carneiro, 19-Apr-2014)

Ref Expression
Assertion pythagtriplem3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → B gcd C = 1

Proof

Step Hyp Ref Expression
1 oveq2 ⊢ A 2 + B 2 = C 2 → B 2 gcd A 2 + B 2 = B 2 gcd C 2
2 1 adantl ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → B 2 gcd A 2 + B 2 = B 2 gcd C 2
3 nnz ⊢ B ∈ ℕ → B ∈ ℤ
4 zsqcl ⊢ B ∈ ℤ → B 2 ∈ ℤ
5 3 4 syl ⊢ B ∈ ℕ → B 2 ∈ ℤ
6 5 3ad2ant2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B 2 ∈ ℤ
7 nnz ⊢ A ∈ ℕ → A ∈ ℤ
8 zsqcl ⊢ A ∈ ℤ → A 2 ∈ ℤ
9 7 8 syl ⊢ A ∈ ℕ → A 2 ∈ ℤ
10 9 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → A 2 ∈ ℤ
11 gcdadd ⊢ B 2 ∈ ℤ ∧ A 2 ∈ ℤ → B 2 gcd A 2 = B 2 gcd A 2 + B 2
12 6 10 11 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B 2 gcd A 2 = B 2 gcd A 2 + B 2
13 6 10 gcdcomd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B 2 gcd A 2 = A 2 gcd B 2
14 12 13 eqtr3d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B 2 gcd A 2 + B 2 = A 2 gcd B 2
15 14 adantr ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → B 2 gcd A 2 + B 2 = A 2 gcd B 2
16 2 15 eqtr3d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → B 2 gcd C 2 = A 2 gcd B 2
17 simpl2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → B ∈ ℕ
18 simpl3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → C ∈ ℕ
19 sqgcd ⊢ B ∈ ℕ ∧ C ∈ ℕ → B gcd C 2 = B 2 gcd C 2
20 17 18 19 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → B gcd C 2 = B 2 gcd C 2
21 simpl1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → A ∈ ℕ
22 sqgcd ⊢ A ∈ ℕ ∧ B ∈ ℕ → A gcd B 2 = A 2 gcd B 2
23 21 17 22 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → A gcd B 2 = A 2 gcd B 2
24 16 20 23 3eqtr4d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 → B gcd C 2 = A gcd B 2
25 24 3adant3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → B gcd C 2 = A gcd B 2
26 simp3l ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → A gcd B = 1
27 26 oveq1d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → A gcd B 2 = 1 2
28 25 27 eqtrd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → B gcd C 2 = 1 2
29 3 3ad2ant2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B ∈ ℤ
30 nnz ⊢ C ∈ ℕ → C ∈ ℤ
31 30 3ad2ant3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → C ∈ ℤ
32 29 31 gcdcld ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B gcd C ∈ ℕ 0
33 32 nn0red ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B gcd C ∈ ℝ
34 33 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → B gcd C ∈ ℝ
35 32 nn0ge0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → 0 ≤ B gcd C
36 35 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 0 ≤ B gcd C
37 1re ⊢ 1 ∈ ℝ
38 0le1 ⊢ 0 ≤ 1
39 sq11 ⊢ B gcd C ∈ ℝ ∧ 0 ≤ B gcd C ∧ 1 ∈ ℝ ∧ 0 ≤ 1 → B gcd C 2 = 1 2 ↔ B gcd C = 1
40 37 38 39 mpanr12 ⊢ B gcd C ∈ ℝ ∧ 0 ≤ B gcd C → B gcd C 2 = 1 2 ↔ B gcd C = 1
41 34 36 40 syl2anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → B gcd C 2 = 1 2 ↔ B gcd C = 1
42 28 41 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → B gcd C = 1