MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pythagtriplem13 Structured version   Visualization version   GIF version

Theorem pythagtriplem13 16163
Description: Lemma for pythagtrip 16170. Show that 𝑁 (which will eventually be closely related to the 𝑛 in the final statement) is a natural. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Hypothesis
Ref Expression
pythagtriplem13.1 𝑁 = (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)
Assertion
Ref Expression
pythagtriplem13 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝑁 ∈ ℕ)

Proof of Theorem pythagtriplem13
StepHypRef Expression
1 pythagtriplem13.1 . 2 𝑁 = (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)
2 pythagtriplem9 16160 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 + 𝐵)) ∈ ℕ)
32nnzd 12085 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 + 𝐵)) ∈ ℤ)
4 simp3r 1198 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ¬ 2 ∥ 𝐴)
5 2z 12013 . . . . . . . . . 10 2 ∈ ℤ
6 simp3 1134 . . . . . . . . . . . . 13 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐶 ∈ ℕ)
7 simp2 1133 . . . . . . . . . . . . 13 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐵 ∈ ℕ)
86, 7nnaddcld 11688 . . . . . . . . . . . 12 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℕ)
98nnzd 12085 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℤ)
1093ad2ant1 1129 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℤ)
11 nnz 12003 . . . . . . . . . . . 12 (𝐴 ∈ ℕ → 𝐴 ∈ ℤ)
12113ad2ant1 1129 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℤ)
13123ad2ant1 1129 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐴 ∈ ℤ)
14 dvdsgcdb 15892 . . . . . . . . . 10 ((2 ∈ ℤ ∧ (𝐶 + 𝐵) ∈ ℤ ∧ 𝐴 ∈ ℤ) → ((2 ∥ (𝐶 + 𝐵) ∧ 2 ∥ 𝐴) ↔ 2 ∥ ((𝐶 + 𝐵) gcd 𝐴)))
155, 10, 13, 14mp3an2i 1462 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((2 ∥ (𝐶 + 𝐵) ∧ 2 ∥ 𝐴) ↔ 2 ∥ ((𝐶 + 𝐵) gcd 𝐴)))
1615biimpar 480 . . . . . . . 8 ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 2 ∥ ((𝐶 + 𝐵) gcd 𝐴)) → (2 ∥ (𝐶 + 𝐵) ∧ 2 ∥ 𝐴))
1716simprd 498 . . . . . . 7 ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 2 ∥ ((𝐶 + 𝐵) gcd 𝐴)) → 2 ∥ 𝐴)
184, 17mtand 814 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ¬ 2 ∥ ((𝐶 + 𝐵) gcd 𝐴))
19 pythagtriplem7 16158 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 + 𝐵)) = ((𝐶 + 𝐵) gcd 𝐴))
2019breq2d 5077 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 ∥ (√‘(𝐶 + 𝐵)) ↔ 2 ∥ ((𝐶 + 𝐵) gcd 𝐴)))
2118, 20mtbird 327 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ¬ 2 ∥ (√‘(𝐶 + 𝐵)))
22 pythagtriplem8 16159 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶𝐵)) ∈ ℕ)
2322nnzd 12085 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶𝐵)) ∈ ℤ)
24 nnz 12003 . . . . . . . . . . . . 13 (𝐶 ∈ ℕ → 𝐶 ∈ ℤ)
25243ad2ant3 1131 . . . . . . . . . . . 12 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐶 ∈ ℤ)
26 nnz 12003 . . . . . . . . . . . . 13 (𝐵 ∈ ℕ → 𝐵 ∈ ℤ)
27263ad2ant2 1130 . . . . . . . . . . . 12 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐵 ∈ ℤ)
2825, 27zsubcld 12091 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶𝐵) ∈ ℤ)
29283ad2ant1 1129 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) ∈ ℤ)
30 dvdsgcdb 15892 . . . . . . . . . 10 ((2 ∈ ℤ ∧ (𝐶𝐵) ∈ ℤ ∧ 𝐴 ∈ ℤ) → ((2 ∥ (𝐶𝐵) ∧ 2 ∥ 𝐴) ↔ 2 ∥ ((𝐶𝐵) gcd 𝐴)))
315, 29, 13, 30mp3an2i 1462 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((2 ∥ (𝐶𝐵) ∧ 2 ∥ 𝐴) ↔ 2 ∥ ((𝐶𝐵) gcd 𝐴)))
3231biimpar 480 . . . . . . . 8 ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 2 ∥ ((𝐶𝐵) gcd 𝐴)) → (2 ∥ (𝐶𝐵) ∧ 2 ∥ 𝐴))
3332simprd 498 . . . . . . 7 ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 2 ∥ ((𝐶𝐵) gcd 𝐴)) → 2 ∥ 𝐴)
344, 33mtand 814 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ¬ 2 ∥ ((𝐶𝐵) gcd 𝐴))
35 pythagtriplem6 16157 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶𝐵)) = ((𝐶𝐵) gcd 𝐴))
3635breq2d 5077 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 ∥ (√‘(𝐶𝐵)) ↔ 2 ∥ ((𝐶𝐵) gcd 𝐴)))
3734, 36mtbird 327 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ¬ 2 ∥ (√‘(𝐶𝐵)))
38 omoe 15712 . . . . 5 ((((√‘(𝐶 + 𝐵)) ∈ ℤ ∧ ¬ 2 ∥ (√‘(𝐶 + 𝐵))) ∧ ((√‘(𝐶𝐵)) ∈ ℤ ∧ ¬ 2 ∥ (√‘(𝐶𝐵)))) → 2 ∥ ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))))
393, 21, 23, 37, 38syl22anc 836 . . . 4 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 2 ∥ ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))))
4028zred 12086 . . . . . . . . . 10 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶𝐵) ∈ ℝ)
41403ad2ant1 1129 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) ∈ ℝ)
42 simp13 1201 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐶 ∈ ℕ)
4342nnred 11652 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐶 ∈ ℝ)
448nnred 11652 . . . . . . . . . 10 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℝ)
45443ad2ant1 1129 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℝ)
46 nnrp 12399 . . . . . . . . . . . 12 (𝐵 ∈ ℕ → 𝐵 ∈ ℝ+)
47463ad2ant2 1130 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐵 ∈ ℝ+)
48473ad2ant1 1129 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℝ+)
4943, 48ltsubrpd 12462 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) < 𝐶)
50 nngt0 11667 . . . . . . . . . . . 12 (𝐵 ∈ ℕ → 0 < 𝐵)
51503ad2ant2 1130 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < 𝐵)
52513ad2ant1 1129 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < 𝐵)
53 simp12 1200 . . . . . . . . . . . 12 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℕ)
5453nnred 11652 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℝ)
5554, 43ltaddposd 11223 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (0 < 𝐵𝐶 < (𝐶 + 𝐵)))
5652, 55mpbid 234 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐶 < (𝐶 + 𝐵))
5741, 43, 45, 49, 56lttrd 10800 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) < (𝐶 + 𝐵))
58 pythagtriplem10 16156 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2)) → 0 < (𝐶𝐵))
59583adant3 1128 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < (𝐶𝐵))
60 0re 10642 . . . . . . . . . . 11 0 ∈ ℝ
61 ltle 10728 . . . . . . . . . . 11 ((0 ∈ ℝ ∧ (𝐶𝐵) ∈ ℝ) → (0 < (𝐶𝐵) → 0 ≤ (𝐶𝐵)))
6260, 61mpan 688 . . . . . . . . . 10 ((𝐶𝐵) ∈ ℝ → (0 < (𝐶𝐵) → 0 ≤ (𝐶𝐵)))
6341, 59, 62sylc 65 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ (𝐶𝐵))
64 nngt0 11667 . . . . . . . . . . . . 13 (𝐶 ∈ ℕ → 0 < 𝐶)
65643ad2ant3 1131 . . . . . . . . . . . 12 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < 𝐶)
66653ad2ant1 1129 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < 𝐶)
6743, 54, 66, 52addgt0d 11214 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < (𝐶 + 𝐵))
68 ltle 10728 . . . . . . . . . . 11 ((0 ∈ ℝ ∧ (𝐶 + 𝐵) ∈ ℝ) → (0 < (𝐶 + 𝐵) → 0 ≤ (𝐶 + 𝐵)))
6960, 68mpan 688 . . . . . . . . . 10 ((𝐶 + 𝐵) ∈ ℝ → (0 < (𝐶 + 𝐵) → 0 ≤ (𝐶 + 𝐵)))
7045, 67, 69sylc 65 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ (𝐶 + 𝐵))
7141, 63, 45, 70sqrtltd 14786 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶𝐵) < (𝐶 + 𝐵) ↔ (√‘(𝐶𝐵)) < (√‘(𝐶 + 𝐵))))
7257, 71mpbid 234 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶𝐵)) < (√‘(𝐶 + 𝐵)))
73 nnsub 11680 . . . . . . . 8 (((√‘(𝐶𝐵)) ∈ ℕ ∧ (√‘(𝐶 + 𝐵)) ∈ ℕ) → ((√‘(𝐶𝐵)) < (√‘(𝐶 + 𝐵)) ↔ ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℕ))
7422, 2, 73syl2anc 586 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶𝐵)) < (√‘(𝐶 + 𝐵)) ↔ ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℕ))
7572, 74mpbid 234 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℕ)
7675nnzd 12085 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℤ)
77 evend2 15705 . . . . 5 (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℤ → (2 ∥ ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ↔ (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2) ∈ ℤ))
7876, 77syl 17 . . . 4 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 ∥ ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ↔ (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2) ∈ ℤ))
7939, 78mpbid 234 . . 3 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2) ∈ ℤ)
8075nngt0d 11685 . . . 4 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))))
8175nnred 11652 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℝ)
82 halfpos2 11865 . . . . 5 (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℝ → (0 < ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ↔ 0 < (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)))
8381, 82syl 17 . . . 4 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (0 < ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ↔ 0 < (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)))
8480, 83mpbid 234 . . 3 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2))
85 elnnz 11990 . . 3 ((((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2) ∈ ℕ ↔ ((((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2) ∈ ℤ ∧ 0 < (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)))
8679, 84, 85sylanbrc 585 . 2 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2) ∈ ℕ)
871, 86eqeltrid 2917 1 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝑁 ∈ ℕ)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  w3a 1083   = wceq 1533  wcel 2110   class class class wbr 5065  cfv 6354  (class class class)co 7155  cr 10535  0cc0 10536  1c1 10537   + caddc 10539   < clt 10674  cle 10675  cmin 10869   / cdiv 11296  cn 11637  2c2 11691  cz 11980  +crp 12388  cexp 13428  csqrt 14591  cdvds 15606   gcd cgcd 15842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613  ax-pre-sup 10614
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-1st 7688  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-2o 8102  df-er 8288  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-sup 8905  df-inf 8906  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-div 11297  df-nn 11638  df-2 11699  df-3 11700  df-n0 11897  df-z 11981  df-uz 12243  df-rp 12389  df-fz 12892  df-fl 13161  df-mod 13237  df-seq 13369  df-exp 13429  df-cj 14457  df-re 14458  df-im 14459  df-sqrt 14593  df-abs 14594  df-dvds 15607  df-gcd 15843  df-prm 16015
This theorem is referenced by:  pythagtriplem18  16168
  Copyright terms: Public domain W3C validator