Metamath Proof Explorer


Theorem pythagtriplem11

Description: Lemma for pythagtrip . Show that M (which will eventually be closely related to the m in the final statement) is a natural. (Contributed by Scott Fenton, 17-Apr-2014) (Revised by Mario Carneiro, 19-Apr-2014)

Ref Expression
Hypothesis pythagtriplem11.1 ⊢ M = C + B + C − B 2
Assertion pythagtriplem11 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → M ∈ ℕ

Proof

Step Hyp Ref Expression
1 pythagtriplem11.1 ⊢ M = C + B + C − B 2
2 pythagtriplem9 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B ∈ ℕ
3 2 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B ∈ ℤ
4 simp3r ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → ¬ 2 ∥ A
5 2z ⊢ 2 ∈ ℤ
6 nnz ⊢ C ∈ ℕ → C ∈ ℤ
7 6 3ad2ant3 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → C ∈ ℤ
8 nnz ⊢ B ∈ ℕ → B ∈ ℤ
9 8 3ad2ant2 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → B ∈ ℤ
10 7 9 zaddcld ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → C + B ∈ ℤ
11 10 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B ∈ ℤ
12 nnz ⊢ A ∈ ℕ → A ∈ ℤ
13 12 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → A ∈ ℤ
14 13 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → A ∈ ℤ
15 dvdsgcdb ⊢ 2 ∈ ℤ ∧ C + B ∈ ℤ ∧ A ∈ ℤ → 2 ∥ C + B ∧ 2 ∥ A ↔ 2 ∥ C + B gcd A
16 5 11 14 15 mp3an2i ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 2 ∥ C + B ∧ 2 ∥ A ↔ 2 ∥ C + B gcd A
17 16 biimpar ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A ∧ 2 ∥ C + B gcd A → 2 ∥ C + B ∧ 2 ∥ A
18 17 simprd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A ∧ 2 ∥ C + B gcd A → 2 ∥ A
19 4 18 mtand ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → ¬ 2 ∥ C + B gcd A
20 pythagtriplem7 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B = C + B gcd A
21 20 breq2d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 2 ∥ C + B ↔ 2 ∥ C + B gcd A
22 19 21 mtbird ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → ¬ 2 ∥ C + B
23 pythagtriplem8 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C − B ∈ ℕ
24 23 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C − B ∈ ℤ
25 7 9 zsubcld ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ → C − B ∈ ℤ
26 25 3ad2ant1 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C − B ∈ ℤ
27 dvdsgcdb ⊢ 2 ∈ ℤ ∧ C − B ∈ ℤ ∧ A ∈ ℤ → 2 ∥ C − B ∧ 2 ∥ A ↔ 2 ∥ C − B gcd A
28 5 26 14 27 mp3an2i ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 2 ∥ C − B ∧ 2 ∥ A ↔ 2 ∥ C − B gcd A
29 28 biimpar ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A ∧ 2 ∥ C − B gcd A → 2 ∥ C − B ∧ 2 ∥ A
30 29 simprd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A ∧ 2 ∥ C − B gcd A → 2 ∥ A
31 4 30 mtand ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → ¬ 2 ∥ C − B gcd A
32 pythagtriplem6 ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C − B = C − B gcd A
33 32 breq2d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 2 ∥ C − B ↔ 2 ∥ C − B gcd A
34 31 33 mtbird ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → ¬ 2 ∥ C − B
35 opoe ⊢ C + B ∈ ℤ ∧ ¬ 2 ∥ C + B ∧ C − B ∈ ℤ ∧ ¬ 2 ∥ C − B → 2 ∥ C + B + C − B
36 3 22 24 34 35 syl22anc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 2 ∥ C + B + C − B
37 2 23 nnaddcld ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B + C − B ∈ ℕ
38 37 nnzd ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B + C − B ∈ ℤ
39 evend2 ⊢ C + B + C − B ∈ ℤ → 2 ∥ C + B + C − B ↔ C + B + C − B 2 ∈ ℤ
40 38 39 syl ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 2 ∥ C + B + C − B ↔ C + B + C − B 2 ∈ ℤ
41 36 40 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B + C − B 2 ∈ ℤ
42 2 nnred ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B ∈ ℝ
43 23 nnred ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C − B ∈ ℝ
44 2 nngt0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 0 < C + B
45 23 nngt0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 0 < C − B
46 42 43 44 45 addgt0d ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 0 < C + B + C − B
47 37 nnred ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B + C − B ∈ ℝ
48 halfpos2 ⊢ C + B + C − B ∈ ℝ → 0 < C + B + C − B ↔ 0 < C + B + C − B 2
49 47 48 syl ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 0 < C + B + C − B ↔ 0 < C + B + C − B 2
50 46 49 mpbid ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → 0 < C + B + C − B 2
51 elnnz ⊢ C + B + C − B 2 ∈ ℕ ↔ C + B + C − B 2 ∈ ℤ ∧ 0 < C + B + C − B 2
52 41 50 51 sylanbrc ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → C + B + C − B 2 ∈ ℕ
53 1 52 eqeltrid ⊢ A ∈ ℕ ∧ B ∈ ℕ ∧ C ∈ ℕ ∧ A 2 + B 2 = C 2 ∧ A gcd B = 1 ∧ ¬ 2 ∥ A → M ∈ ℕ