ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  pythagtriplem16 GIF version

Theorem pythagtriplem16 12262
Description: Lemma for pythagtrip 12266. Show the relationship between 𝑀, 𝑁, and 𝐵. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Hypotheses
Ref Expression
pythagtriplem15.1 𝑀 = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) / 2)
pythagtriplem15.2 𝑁 = (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)
Assertion
Ref Expression
pythagtriplem16 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 = (2 · (𝑀 · 𝑁)))

Proof of Theorem pythagtriplem16
StepHypRef Expression
1 pythagtriplem15.1 . . . . 5 𝑀 = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) / 2)
2 pythagtriplem15.2 . . . . 5 𝑁 = (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)
31, 2oveq12i 5881 . . . 4 (𝑀 · 𝑁) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) / 2) · (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2))
4 simp13 1029 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐶 ∈ ℕ)
5 simp12 1028 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℕ)
64, 5nnaddcld 8956 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℕ)
76nnrpd 9681 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℝ+)
87rpsqrtcld 11151 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 + 𝐵)) ∈ ℝ+)
98rpcnd 9685 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 + 𝐵)) ∈ ℂ)
104nnzd 9363 . . . . . . . . . . . 12 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐶 ∈ ℤ)
115nnzd 9363 . . . . . . . . . . . 12 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℤ)
1210, 11zsubcld 9369 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) ∈ ℤ)
1312zred 9364 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) ∈ ℝ)
14 pythagtriplem10 12252 . . . . . . . . . . 11 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2)) → 0 < (𝐶𝐵))
15143adant3 1017 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < (𝐶𝐵))
1613, 15elrpd 9680 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) ∈ ℝ+)
1716rpsqrtcld 11151 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶𝐵)) ∈ ℝ+)
1817rpcnd 9685 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶𝐵)) ∈ ℂ)
199, 18addcld 7967 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) ∈ ℂ)
20 2cnd 8981 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 2 ∈ ℂ)
219, 18subcld 8258 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) ∈ ℂ)
22 2ap0 9001 . . . . . . 7 2 # 0
2322a1i 9 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 2 # 0)
2419, 20, 21, 20, 23, 23divmuldivapd 8778 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) / 2) · (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) / (2 · 2)))
2519, 21mulcld 7968 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) ∈ ℂ)
2625, 20, 20, 23, 23divdivap1d 8768 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) / 2) / 2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) / (2 · 2)))
27 nnre 8915 . . . . . . . . . . . . 13 (𝐶 ∈ ℕ → 𝐶 ∈ ℝ)
28 nnre 8915 . . . . . . . . . . . . 13 (𝐵 ∈ ℕ → 𝐵 ∈ ℝ)
29 readdcl 7928 . . . . . . . . . . . . 13 ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 + 𝐵) ∈ ℝ)
3027, 28, 29syl2anr 290 . . . . . . . . . . . 12 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℝ)
31303adant1 1015 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℝ)
32313ad2ant1 1018 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℝ)
3327adantl 277 . . . . . . . . . . . . . 14 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐶 ∈ ℝ)
3428adantr 276 . . . . . . . . . . . . . 14 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐵 ∈ ℝ)
35 nngt0 8933 . . . . . . . . . . . . . . 15 (𝐶 ∈ ℕ → 0 < 𝐶)
3635adantl 277 . . . . . . . . . . . . . 14 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < 𝐶)
37 nngt0 8933 . . . . . . . . . . . . . . 15 (𝐵 ∈ ℕ → 0 < 𝐵)
3837adantr 276 . . . . . . . . . . . . . 14 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < 𝐵)
3933, 34, 36, 38addgt0d 8468 . . . . . . . . . . . . 13 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < (𝐶 + 𝐵))
40 0re 7948 . . . . . . . . . . . . . 14 0 ∈ ℝ
41 ltle 8035 . . . . . . . . . . . . . 14 ((0 ∈ ℝ ∧ (𝐶 + 𝐵) ∈ ℝ) → (0 < (𝐶 + 𝐵) → 0 ≤ (𝐶 + 𝐵)))
4240, 41mpan 424 . . . . . . . . . . . . 13 ((𝐶 + 𝐵) ∈ ℝ → (0 < (𝐶 + 𝐵) → 0 ≤ (𝐶 + 𝐵)))
4330, 39, 42sylc 62 . . . . . . . . . . . 12 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 ≤ (𝐶 + 𝐵))
44433adant1 1015 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 ≤ (𝐶 + 𝐵))
45443ad2ant1 1018 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ (𝐶 + 𝐵))
46 resqrtth 11024 . . . . . . . . . 10 (((𝐶 + 𝐵) ∈ ℝ ∧ 0 ≤ (𝐶 + 𝐵)) → ((√‘(𝐶 + 𝐵))↑2) = (𝐶 + 𝐵))
4732, 45, 46syl2anc 411 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵))↑2) = (𝐶 + 𝐵))
48 resubcl 8211 . . . . . . . . . . . . 13 ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶𝐵) ∈ ℝ)
4927, 28, 48syl2anr 290 . . . . . . . . . . . 12 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶𝐵) ∈ ℝ)
50493adant1 1015 . . . . . . . . . . 11 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶𝐵) ∈ ℝ)
51503ad2ant1 1018 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶𝐵) ∈ ℝ)
52 ltle 8035 . . . . . . . . . . . 12 ((0 ∈ ℝ ∧ (𝐶𝐵) ∈ ℝ) → (0 < (𝐶𝐵) → 0 ≤ (𝐶𝐵)))
5340, 52mpan 424 . . . . . . . . . . 11 ((𝐶𝐵) ∈ ℝ → (0 < (𝐶𝐵) → 0 ≤ (𝐶𝐵)))
5451, 15, 53sylc 62 . . . . . . . . . 10 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ (𝐶𝐵))
55 resqrtth 11024 . . . . . . . . . 10 (((𝐶𝐵) ∈ ℝ ∧ 0 ≤ (𝐶𝐵)) → ((√‘(𝐶𝐵))↑2) = (𝐶𝐵))
5651, 54, 55syl2anc 411 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶𝐵))↑2) = (𝐶𝐵))
5747, 56oveq12d 5887 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵))↑2) − ((√‘(𝐶𝐵))↑2)) = ((𝐶 + 𝐵) − (𝐶𝐵)))
5857oveq1d 5884 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵))↑2) − ((√‘(𝐶𝐵))↑2)) / 2) = (((𝐶 + 𝐵) − (𝐶𝐵)) / 2))
59 subsq 10612 . . . . . . . . 9 (((√‘(𝐶 + 𝐵)) ∈ ℂ ∧ (√‘(𝐶𝐵)) ∈ ℂ) → (((√‘(𝐶 + 𝐵))↑2) − ((√‘(𝐶𝐵))↑2)) = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))))
609, 18, 59syl2anc 411 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵))↑2) − ((√‘(𝐶𝐵))↑2)) = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))))
6160oveq1d 5884 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵))↑2) − ((√‘(𝐶𝐵))↑2)) / 2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) / 2))
62 nncn 8916 . . . . . . . . . . . 12 (𝐶 ∈ ℕ → 𝐶 ∈ ℂ)
63 nncn 8916 . . . . . . . . . . . 12 (𝐵 ∈ ℕ → 𝐵 ∈ ℂ)
64 pnncan 8188 . . . . . . . . . . . . . 14 ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐶 + 𝐵) − (𝐶𝐵)) = (𝐵 + 𝐵))
65643anidm23 1297 . . . . . . . . . . . . 13 ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐶 + 𝐵) − (𝐶𝐵)) = (𝐵 + 𝐵))
66 2times 9036 . . . . . . . . . . . . . 14 (𝐵 ∈ ℂ → (2 · 𝐵) = (𝐵 + 𝐵))
6766adantl 277 . . . . . . . . . . . . 13 ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · 𝐵) = (𝐵 + 𝐵))
6865, 67eqtr4d 2213 . . . . . . . . . . . 12 ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐶 + 𝐵) − (𝐶𝐵)) = (2 · 𝐵))
6962, 63, 68syl2anr 290 . . . . . . . . . . 11 ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((𝐶 + 𝐵) − (𝐶𝐵)) = (2 · 𝐵))
70693adant1 1015 . . . . . . . . . 10 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((𝐶 + 𝐵) − (𝐶𝐵)) = (2 · 𝐵))
71703ad2ant1 1018 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶 + 𝐵) − (𝐶𝐵)) = (2 · 𝐵))
7271oveq1d 5884 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐶 + 𝐵) − (𝐶𝐵)) / 2) = ((2 · 𝐵) / 2))
735nncnd 8922 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℂ)
7473, 20, 23divcanap3d 8741 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((2 · 𝐵) / 2) = 𝐵)
7572, 74eqtrd 2210 . . . . . . 7 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐶 + 𝐵) − (𝐶𝐵)) / 2) = 𝐵)
7658, 61, 753eqtr3d 2218 . . . . . 6 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) / 2) = 𝐵)
7776oveq1d 5884 . . . . 5 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) · ((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵)))) / 2) / 2) = (𝐵 / 2))
7824, 26, 773eqtr2d 2216 . . . 4 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶𝐵))) / 2) · (((√‘(𝐶 + 𝐵)) − (√‘(𝐶𝐵))) / 2)) = (𝐵 / 2))
793, 78eqtrid 2222 . . 3 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝑀 · 𝑁) = (𝐵 / 2))
8079oveq2d 5885 . 2 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · (𝑀 · 𝑁)) = (2 · (𝐵 / 2)))
8173, 20, 23divcanap2d 8738 . 2 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · (𝐵 / 2)) = 𝐵)
8280, 81eqtr2d 2211 1 (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 = (2 · (𝑀 · 𝑁)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  w3a 978   = wceq 1353  wcel 2148   class class class wbr 4000  cfv 5212  (class class class)co 5869  cc 7800  cr 7801  0cc0 7802  1c1 7803   + caddc 7805   · cmul 7807   < clt 7982  cle 7983  cmin 8118   # cap 8528   / cdiv 8618  cn 8908  2c2 8959  cexp 10505  csqrt 10989  cdvds 11778   gcd cgcd 11926
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-1re 7896  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-mulrcl 7901  ax-addcom 7902  ax-mulcom 7903  ax-addass 7904  ax-mulass 7905  ax-distr 7906  ax-i2m1 7907  ax-0lt1 7908  ax-1rid 7909  ax-0id 7910  ax-rnegex 7911  ax-precex 7912  ax-cnre 7913  ax-pre-ltirr 7914  ax-pre-ltwlin 7915  ax-pre-lttrn 7916  ax-pre-apti 7917  ax-pre-ltadd 7918  ax-pre-mulgt0 7919  ax-pre-mulext 7920  ax-arch 7921  ax-caucvg 7922
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-po 4293  df-iso 4294  df-iord 4363  df-on 4365  df-ilim 4366  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-riota 5825  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-frec 6386  df-pnf 7984  df-mnf 7985  df-xr 7986  df-ltxr 7987  df-le 7988  df-sub 8120  df-neg 8121  df-reap 8522  df-ap 8529  df-div 8619  df-inn 8909  df-2 8967  df-3 8968  df-4 8969  df-n0 9166  df-z 9243  df-uz 9518  df-rp 9641  df-seqfrec 10432  df-exp 10506  df-rsqrt 10991
This theorem is referenced by:  pythagtriplem18  12264
  Copyright terms: Public domain W3C validator