pythagtriplem12 - Metamath Proof Explorer

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

Theorem pythagtriplem12 16455

Description: Lemma for pythagtrip 16463. Calculate the square of 𝑀. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

**Hypothesis**
Ref	Expression
pythagtriplem11.1	⊢ 𝑀 = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)

**Assertion**
Ref	Expression
pythagtriplem12	⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝑀↑2) = ((𝐶 + 𝐴) / 2))

**Proof of Theorem pythagtriplem12**
Step	Hyp	Ref	Expression
1		pythagtriplem11.1	. . 3 ⊢ 𝑀 = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)
2	1	oveq1i 7265	. 2 ⊢ (𝑀↑2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)↑2)
3		nncn 11911	. . . . . . . . 9 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℂ)
4		nncn 11911	. . . . . . . . 9 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℂ)
5		addcl 10884	. . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶 + 𝐵) ∈ ℂ)
6	3, 4, 5	syl2anr 596	. . . . . . . 8 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℂ)
7	6	3adant1 1128	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℂ)
8	7	sqrtcld 15077	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (√‘(𝐶 + 𝐵)) ∈ ℂ)
9		subcl 11150	. . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶 − 𝐵) ∈ ℂ)
10	3, 4, 9	syl2anr 596	. . . . . . . 8 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℂ)
11	10	3adant1 1128	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℂ)
12	11	sqrtcld 15077	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (√‘(𝐶 − 𝐵)) ∈ ℂ)
13	8, 12	addcld 10925	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) ∈ ℂ)
14	13	3ad2ant1 1131	. . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) ∈ ℂ)
15		2cn 11978	. . . . . 6 ⊢ 2 ∈ ℂ
16		2ne0 12007	. . . . . 6 ⊢ 2 ≠ 0
17		sqdiv 13769	. . . . . 6 ⊢ ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) ∈ ℂ ∧ 2 ∈ ℂ ∧ 2 ≠ 0) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)↑2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2↑2)))
18	15, 16, 17	mp3an23 1451	. . . . 5 ⊢ (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) ∈ ℂ → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)↑2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2↑2)))
19	15	sqvali 13825	. . . . . 6 ⊢ (2↑2) = (2 · 2)
20	19	oveq2i 7266	. . . . 5 ⊢ ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2↑2)) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2 · 2))
21	18, 20	eqtrdi 2795	. . . 4 ⊢ (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) ∈ ℂ → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)↑2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2 · 2)))
22	14, 21	syl 17	. . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)↑2) = ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2 · 2)))
23	8	3ad2ant1 1131	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 + 𝐵)) ∈ ℂ)
24	12	3ad2ant1 1131	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐶 − 𝐵)) ∈ ℂ)
25		binom2 13861	. . . . . . 7 ⊢ (((√‘(𝐶 + 𝐵)) ∈ ℂ ∧ (√‘(𝐶 − 𝐵)) ∈ ℂ) → (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) = ((((√‘(𝐶 + 𝐵))↑2) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) + ((√‘(𝐶 − 𝐵))↑2)))
26	23, 24, 25	syl2anc 583	. . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) = ((((√‘(𝐶 + 𝐵))↑2) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) + ((√‘(𝐶 − 𝐵))↑2)))
27		nnre 11910	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ℕ → 𝐶 ∈ ℝ)
28		nnre 11910	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℕ → 𝐵 ∈ ℝ)
29		readdcl 10885	. . . . . . . . . . . 12 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 + 𝐵) ∈ ℝ)
30	27, 28, 29	syl2anr 596	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℝ)
31	30	3adant1 1128	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐵) ∈ ℝ)
32	31	3ad2ant1 1131	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℝ)
33	27	3ad2ant3 1133	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐶 ∈ ℝ)
34	28	3ad2ant2 1132	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐵 ∈ ℝ)
35		nngt0 11934	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ ℕ → 0 < 𝐶)
36	35	3ad2ant3 1133	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < 𝐶)
37		nngt0 11934	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ ℕ → 0 < 𝐵)
38	37	3ad2ant2 1132	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < 𝐵)
39	33, 34, 36, 38	addgt0d 11480	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 < (𝐶 + 𝐵))
40	39	3ad2ant1 1131	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < (𝐶 + 𝐵))
41		0re 10908	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
42		ltle 10994	. . . . . . . . . . 11 ⊢ ((0 ∈ ℝ ∧ (𝐶 + 𝐵) ∈ ℝ) → (0 < (𝐶 + 𝐵) → 0 ≤ (𝐶 + 𝐵)))
43	41, 42	mpan 686	. . . . . . . . . 10 ⊢ ((𝐶 + 𝐵) ∈ ℝ → (0 < (𝐶 + 𝐵) → 0 ≤ (𝐶 + 𝐵)))
44	32, 40, 43	sylc 65	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ (𝐶 + 𝐵))
45		resqrtth 14895	. . . . . . . . 9 ⊢ (((𝐶 + 𝐵) ∈ ℝ ∧ 0 ≤ (𝐶 + 𝐵)) → ((√‘(𝐶 + 𝐵))↑2) = (𝐶 + 𝐵))
46	32, 44, 45	syl2anc 583	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵))↑2) = (𝐶 + 𝐵))
47	46	oveq1d 7270	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵))↑2) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) = ((𝐶 + 𝐵) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))))
48		resubcl 11215	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 − 𝐵) ∈ ℝ)
49	27, 28, 48	syl2anr 596	. . . . . . . . . 10 ⊢ ((𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℝ)
50	49	3adant1 1128	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 − 𝐵) ∈ ℝ)
51	50	3ad2ant1 1131	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 − 𝐵) ∈ ℝ)
52		pythagtriplem10 16449	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2)) → 0 < (𝐶 − 𝐵))
53	52	3adant3 1130	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 < (𝐶 − 𝐵))
54		ltle 10994	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ ∧ (𝐶 − 𝐵) ∈ ℝ) → (0 < (𝐶 − 𝐵) → 0 ≤ (𝐶 − 𝐵)))
55	41, 54	mpan 686	. . . . . . . . 9 ⊢ ((𝐶 − 𝐵) ∈ ℝ → (0 < (𝐶 − 𝐵) → 0 ≤ (𝐶 − 𝐵)))
56	51, 53, 55	sylc 65	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ (𝐶 − 𝐵))
57		resqrtth 14895	. . . . . . . 8 ⊢ (((𝐶 − 𝐵) ∈ ℝ ∧ 0 ≤ (𝐶 − 𝐵)) → ((√‘(𝐶 − 𝐵))↑2) = (𝐶 − 𝐵))
58	51, 56, 57	syl2anc 583	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 − 𝐵))↑2) = (𝐶 − 𝐵))
59	47, 58	oveq12d 7273	. . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵))↑2) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) + ((√‘(𝐶 − 𝐵))↑2)) = (((𝐶 + 𝐵) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) + (𝐶 − 𝐵)))
60	7	3ad2ant1 1131	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐵) ∈ ℂ)
61	8, 12	mulcld 10926	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))) ∈ ℂ)
62		mulcl 10886	. . . . . . . . . 10 ⊢ ((2 ∈ ℂ ∧ ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))) ∈ ℂ) → (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵)))) ∈ ℂ)
63	15, 61, 62	sylancr 586	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵)))) ∈ ℂ)
64	63	3ad2ant1 1131	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵)))) ∈ ℂ)
65	11	3ad2ant1 1131	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 − 𝐵) ∈ ℂ)
66	60, 64, 65	add32d 11132	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐶 + 𝐵) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) + (𝐶 − 𝐵)) = (((𝐶 + 𝐵) + (𝐶 − 𝐵)) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))))
67	3	3ad2ant3 1133	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐶 ∈ ℂ)
68	67	3ad2ant1 1131	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐶 ∈ ℂ)
69		nncn 11911	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℂ)
70	69	3ad2ant1 1131	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℂ)
71	70	3ad2ant1 1131	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐴 ∈ ℂ)
72		adddi 10891	. . . . . . . . 9 ⊢ ((2 ∈ ℂ ∧ 𝐶 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (2 · (𝐶 + 𝐴)) = ((2 · 𝐶) + (2 · 𝐴)))
73	15, 68, 71, 72	mp3an2i 1464	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · (𝐶 + 𝐴)) = ((2 · 𝐶) + (2 · 𝐴)))
74	4	3ad2ant2 1132	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐵 ∈ ℂ)
75	74	3ad2ant1 1131	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℂ)
76	68, 75, 68	ppncand 11302	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶 + 𝐵) + (𝐶 − 𝐵)) = (𝐶 + 𝐶))
77	68	2timesd 12146	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · 𝐶) = (𝐶 + 𝐶))
78	76, 77	eqtr4d 2781	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶 + 𝐵) + (𝐶 − 𝐵)) = (2 · 𝐶))
79		oveq1 7262	. . . . . . . . . . . . . 14 ⊢ (((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) → (((𝐴↑2) + (𝐵↑2)) − (𝐵↑2)) = ((𝐶↑2) − (𝐵↑2)))
80	79	3ad2ant2 1132	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐴↑2) + (𝐵↑2)) − (𝐵↑2)) = ((𝐶↑2) − (𝐵↑2)))
81	71	sqcld 13790	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐴↑2) ∈ ℂ)
82	75	sqcld 13790	. . . . . . . . . . . . . 14 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐵↑2) ∈ ℂ)
83	81, 82	pncand 11263	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐴↑2) + (𝐵↑2)) − (𝐵↑2)) = (𝐴↑2))
84		subsq 13854	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐶↑2) − (𝐵↑2)) = ((𝐶 + 𝐵) · (𝐶 − 𝐵)))
85	68, 75, 84	syl2anc 583	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶↑2) − (𝐵↑2)) = ((𝐶 + 𝐵) · (𝐶 − 𝐵)))
86	80, 83, 85	3eqtr3rd 2787	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((𝐶 + 𝐵) · (𝐶 − 𝐵)) = (𝐴↑2))
87	86	fveq2d 6760	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘((𝐶 + 𝐵) · (𝐶 − 𝐵))) = (√‘(𝐴↑2)))
88	32, 44, 51, 56	sqrtmuld 15064	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘((𝐶 + 𝐵) · (𝐶 − 𝐵))) = ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))
89		nnre 11910	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ)
90	89	3ad2ant1 1131	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 𝐴 ∈ ℝ)
91	90	3ad2ant1 1131	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐴 ∈ ℝ)
92		nnnn0 12170	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℕ₀)
93	92	nn0ge0d 12226	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℕ → 0 ≤ 𝐴)
94	93	3ad2ant1 1131	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → 0 ≤ 𝐴)
95	94	3ad2ant1 1131	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 0 ≤ 𝐴)
96	91, 95	sqrtsqd 15059	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (√‘(𝐴↑2)) = 𝐴)
97	87, 88, 96	3eqtr3d 2786	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))) = 𝐴)
98	97	oveq2d 7271	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵)))) = (2 · 𝐴))
99	78, 98	oveq12d 7273	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐶 + 𝐵) + (𝐶 − 𝐵)) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) = ((2 · 𝐶) + (2 · 𝐴)))
100	73, 99	eqtr4d 2781	. . . . . . 7 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · (𝐶 + 𝐴)) = (((𝐶 + 𝐵) + (𝐶 − 𝐵)) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))))
101	66, 100	eqtr4d 2781	. . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((𝐶 + 𝐵) + (2 · ((√‘(𝐶 + 𝐵)) · (√‘(𝐶 − 𝐵))))) + (𝐶 − 𝐵)) = (2 · (𝐶 + 𝐴)))
102	26, 59, 101	3eqtrd 2782	. . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) = (2 · (𝐶 + 𝐴)))
103	102	oveq1d 7270	. . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2 · 2)) = ((2 · (𝐶 + 𝐴)) / (2 · 2)))
104		addcl 10884	. . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ 𝐴 ∈ ℂ) → (𝐶 + 𝐴) ∈ ℂ)
105	3, 69, 104	syl2anr 596	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐴) ∈ ℂ)
106	105	3adant2 1129	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) → (𝐶 + 𝐴) ∈ ℂ)
107	106	3ad2ant1 1131	. . . . . 6 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐶 + 𝐴) ∈ ℂ)
108		mulcl 10886	. . . . . 6 ⊢ ((2 ∈ ℂ ∧ (𝐶 + 𝐴) ∈ ℂ) → (2 · (𝐶 + 𝐴)) ∈ ℂ)
109	15, 107, 108	sylancr 586	. . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (2 · (𝐶 + 𝐴)) ∈ ℂ)
110		2cnne0 12113	. . . . . 6 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0)
111		divdiv1 11616	. . . . . 6 ⊢ (((2 · (𝐶 + 𝐴)) ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ (2 ∈ ℂ ∧ 2 ≠ 0)) → (((2 · (𝐶 + 𝐴)) / 2) / 2) = ((2 · (𝐶 + 𝐴)) / (2 · 2)))
112	110, 110, 111	mp3an23 1451	. . . . 5 ⊢ ((2 · (𝐶 + 𝐴)) ∈ ℂ → (((2 · (𝐶 + 𝐴)) / 2) / 2) = ((2 · (𝐶 + 𝐴)) / (2 · 2)))
113	109, 112	syl 17	. . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((2 · (𝐶 + 𝐴)) / 2) / 2) = ((2 · (𝐶 + 𝐴)) / (2 · 2)))
114	103, 113	eqtr4d 2781	. . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵)))↑2) / (2 · 2)) = (((2 · (𝐶 + 𝐴)) / 2) / 2))
115		divcan3 11589	. . . . . 6 ⊢ (((𝐶 + 𝐴) ∈ ℂ ∧ 2 ∈ ℂ ∧ 2 ≠ 0) → ((2 · (𝐶 + 𝐴)) / 2) = (𝐶 + 𝐴))
116	15, 16, 115	mp3an23 1451	. . . . 5 ⊢ ((𝐶 + 𝐴) ∈ ℂ → ((2 · (𝐶 + 𝐴)) / 2) = (𝐶 + 𝐴))
117	107, 116	syl 17	. . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((2 · (𝐶 + 𝐴)) / 2) = (𝐶 + 𝐴))
118	117	oveq1d 7270	. . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (((2 · (𝐶 + 𝐴)) / 2) / 2) = ((𝐶 + 𝐴) / 2))
119	22, 114, 118	3eqtrd 2782	. 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ((((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)↑2) = ((𝐶 + 𝐴) / 2))
120	2, 119	eqtrid 2790	1 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝑀↑2) = ((𝐶 + 𝐴) / 2))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 0cc0 10802 1c1 10803 + caddc 10805 · cmul 10807 < clt 10940 ≤ cle 10941 − cmin 11135 / cdiv 11562 ℕcn 11903 2c2 11958 ↑cexp 13710 √csqrt 14872 ∥ cdvds 15891 gcd cgcd 16129

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875

This theorem is referenced by: pythagtriplem15 16458 pythagtriplem17 16460

W3C validator