Theorem flt4lem5 43504

Description: In the context of the lemmas of pythagtrip 16932, 𝑀 and 𝑁 are coprime. (Contributed by SN, 23-Aug-2024.)

Hypotheses

Ref	Expression
flt4lem5.1	⊢ 𝑀 = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)
flt4lem5.2	⊢ 𝑁 = (((√‘(𝐶 + 𝐵)) − (√‘(𝐶 − 𝐵))) / 2)

Assertion

Ref	Expression
flt4lem5	⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝑀 gcd 𝑁) = 1)

Proof of Theorem flt4lem5

Dummy variable 𝑖 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp3l 1220	. . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝐴 gcd 𝐵) = 1)
2		simp11 1222	. . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐴 ∈ ℕ)
3		simp12 1223	. . . . 5 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 ∈ ℕ)
4		coprmgcdb 16745	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → (∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1) ↔ (𝐴 gcd 𝐵) = 1))
5	2, 3, 4	syl2anc 596	. . . 4 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1) ↔ (𝐴 gcd 𝐵) = 1))
6	1, 5	mpbird 260	. . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1))
7		simplr 781	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∈ ℕ)
8	7	nnzd 12645	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∈ ℤ)
9		flt4lem5.1	. . . . . . . . . . . . 13 ⊢ 𝑀 = (((√‘(𝐶 + 𝐵)) + (√‘(𝐶 − 𝐵))) / 2)
10	9	pythagtriplem11 16923	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝑀 ∈ ℕ)
11	10	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑀 ∈ ℕ)
12	11	nnsqcld 14312	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑀↑2) ∈ ℕ)
13	12	nnzd 12645	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑀↑2) ∈ ℤ)
14		flt4lem5.2	. . . . . . . . . . . . 13 ⊢ 𝑁 = (((√‘(𝐶 + 𝐵)) − (√‘(𝐶 − 𝐵))) / 2)
15	14	pythagtriplem13 16925	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝑁 ∈ ℕ)
16	15	ad2antrr 739	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑁 ∈ ℕ)
17	16	nnsqcld 14312	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑁↑2) ∈ ℕ)
18	17	nnzd 12645	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑁↑2) ∈ ℤ)
19		simprl 783	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ 𝑀)
20	11	nnzd 12645	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑀 ∈ ℤ)
21		2nn 12342	. . . . . . . . . . . 12 ⊢ 2 ∈ ℕ
22	21	a1i 11	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 2 ∈ ℕ)
23		dvdsexp2im 16423	. . . . . . . . . . 11 ⊢ ((𝑖 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ 2 ∈ ℕ) → (𝑖 ∥ 𝑀 → 𝑖 ∥ (𝑀↑2)))
24	8, 20, 22, 23	syl3anc 1398	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑖 ∥ 𝑀 → 𝑖 ∥ (𝑀↑2)))
25	19, 24	mpd 16	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ (𝑀↑2))
26		simprr 785	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ 𝑁)
27	16	nnzd 12645	. . . . . . . . . . 11 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑁 ∈ ℤ)
28		dvdsexp2im 16423	. . . . . . . . . . 11 ⊢ ((𝑖 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 2 ∈ ℕ) → (𝑖 ∥ 𝑁 → 𝑖 ∥ (𝑁↑2)))
29	8, 27, 22, 28	syl3anc 1398	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑖 ∥ 𝑁 → 𝑖 ∥ (𝑁↑2)))
30	26, 29	mpd 16	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ (𝑁↑2))
31	8, 13, 18, 25, 30	dvds2subd 16389	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ ((𝑀↑2) − (𝑁↑2)))
32	9, 14	pythagtriplem15 16927	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐴 = ((𝑀↑2) − (𝑁↑2)))
33	32	ad2antrr 739	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝐴 = ((𝑀↑2) − (𝑁↑2)))
34	31, 33	breqtrrd 5137	. . . . . . 7 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ 𝐴)
35		2z 12654	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
36	35	a1i 11	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 2 ∈ ℤ)
37	11, 16	nnmulcld 12317	. . . . . . . . . 10 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑀 · 𝑁) ∈ ℕ)
38	37	nnzd 12645	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑀 · 𝑁) ∈ ℤ)
39	8, 20, 27, 26	dvdsmultr2d 16395	. . . . . . . . 9 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ (𝑀 · 𝑁))
40	8, 36, 38, 39	dvdsmultr2d 16395	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ (2 · (𝑀 · 𝑁)))
41	9, 14	pythagtriplem16 16928	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → 𝐵 = (2 · (𝑀 · 𝑁)))
42	41	ad2antrr 739	. . . . . . . 8 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝐵 = (2 · (𝑀 · 𝑁)))
43	40, 42	breqtrrd 5137	. . . . . . 7 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → 𝑖 ∥ 𝐵)
44	34, 43	jca 521	. . . . . 6 ⊢ (((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) ∧ (𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁)) → (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵))
45	44	ex 418	. . . . 5 ⊢ ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) → ((𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁) → (𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵)))
46	45	imim1d 83	. . . 4 ⊢ ((((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) ∧ 𝑖 ∈ ℕ) → (((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1) → ((𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁) → 𝑖 = 1)))
47	46	ralimdva 3176	. . 3 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (∀𝑖 ∈ ℕ ((𝑖 ∥ 𝐴 ∧ 𝑖 ∥ 𝐵) → 𝑖 = 1) → ∀𝑖 ∈ ℕ ((𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁) → 𝑖 = 1)))
48	6, 47	mpd 16	. 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → ∀𝑖 ∈ ℕ ((𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁) → 𝑖 = 1))
49		coprmgcdb 16745	. . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ) → (∀𝑖 ∈ ℕ ((𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁) → 𝑖 = 1) ↔ (𝑀 gcd 𝑁) = 1))
50	10, 15, 49	syl2anc 596	. 2 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (∀𝑖 ∈ ℕ ((𝑖 ∥ 𝑀 ∧ 𝑖 ∥ 𝑁) → 𝑖 = 1) ↔ (𝑀 gcd 𝑁) = 1))
51	48, 50	mpbid 235	1 ⊢ (((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ ∧ 𝐶 ∈ ℕ) ∧ ((𝐴↑2) + (𝐵↑2)) = (𝐶↑2) ∧ ((𝐴 gcd 𝐵) = 1 ∧ ¬ 2 ∥ 𝐴)) → (𝑀 gcd 𝑁) = 1)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078   class class class wbr 5107  ‘cfv 6537  (class class class)co 7417  1c1 11129   + caddc 11131   · cmul 11133   − cmin 11469   / cdiv 11899  ℕcn 12261  2c2 12323  ℤcz 12619  ↑cexp 14129  √csqrt 15324   ∥ cdvds 16348   gcd cgcd 16590

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-cnex 11184  ax-resscn 11185  ax-1cn 11186  ax-icn 11187  ax-addcl 11188  ax-addrcl 11189  ax-mulcl 11190  ax-mulrcl 11191  ax-mulcom 11192  ax-addass 11193  ax-mulass 11194  ax-distr 11195  ax-i2m1 11196  ax-1ne0 11197  ax-1rid 11198  ax-rnegex 11199  ax-rrecex 11200  ax-cnre 11201  ax-pre-lttri 11202  ax-pre-lttrn 11203  ax-pre-ltadd 11204  ax-pre-mulgt0 11205  ax-pre-sup 11206

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-er 8700  df-en 8957  df-dom 8958  df-sdom 8959  df-fin 8960  df-sup 9416  df-inf 9417  df-pnf 11273  df-mnf 11274  df-xr 11275  df-ltxr 11276  df-le 11277  df-sub 11471  df-neg 11472  df-div 11900  df-nn 12262  df-2 12331  df-3 12332  df-n0 12533  df-z 12620  df-uz 12892  df-rp 13047  df-fz 13566  df-fl 13857  df-mod 13935  df-seq 14070  df-exp 14130  df-cj 15190  df-re 15191  df-im 15192  df-sqrt 15326  df-abs 15327  df-dvds 16349  df-gcd 16591  df-prm 16768

This theorem is used by:  flt4lem5c  43508  flt4lem5d  43509  flt4lem5e  43510