Metamath Proof Explorer


Theorem fltcoprm

Description: The integers of a solution of the generalized FLT can be assumed to be coprime. (Contributed by AV, 3-Nov-2026)

Ref Expression
Hypotheses fltcoprm.n ⊢ φ → N ∈ ℕ
fltcoprm.z ⊢ Z = ℤ ∖ 0
fltcoprm.a ⊢ φ → A ∈ Z
fltcoprm.b ⊢ φ → B ∈ Z
fltcoprm.c ⊢ φ → C ∈ Z
fltcoprm.e ⊢ φ → A N + B N = C N
Assertion fltcoprm ⊢ φ → ∃ a ∈ Z ∃ b ∈ Z ∃ c ∈ Z a N + b N = c N ∧ a gcd b = 1 ∧ a gcd c = 1 ∧ b gcd c = 1

Proof

Step Hyp Ref Expression
1 fltcoprm.n ⊢ φ → N ∈ ℕ
2 fltcoprm.z ⊢ Z = ℤ ∖ 0
3 fltcoprm.a ⊢ φ → A ∈ Z
4 fltcoprm.b ⊢ φ → B ∈ Z
5 fltcoprm.c ⊢ φ → C ∈ Z
6 fltcoprm.e ⊢ φ → A N + B N = C N
7 oveq1 ⊢ a = A A gcd B → a N = A A gcd B N
8 7 oveq1d ⊢ a = A A gcd B → a N + b N = A A gcd B N + b N
9 8 eqeq1d ⊢ a = A A gcd B → a N + b N = c N ↔ A A gcd B N + b N = c N
10 oveq1 ⊢ a = A A gcd B → a gcd b = A A gcd B gcd b
11 10 eqeq1d ⊢ a = A A gcd B → a gcd b = 1 ↔ A A gcd B gcd b = 1
12 oveq1 ⊢ a = A A gcd B → a gcd c = A A gcd B gcd c
13 12 eqeq1d ⊢ a = A A gcd B → a gcd c = 1 ↔ A A gcd B gcd c = 1
14 11 13 3anbi12d ⊢ a = A A gcd B → a gcd b = 1 ∧ a gcd c = 1 ∧ b gcd c = 1 ↔ A A gcd B gcd b = 1 ∧ A A gcd B gcd c = 1 ∧ b gcd c = 1
15 9 14 anbi12d ⊢ a = A A gcd B → a N + b N = c N ∧ a gcd b = 1 ∧ a gcd c = 1 ∧ b gcd c = 1 ↔ A A gcd B N + b N = c N ∧ A A gcd B gcd b = 1 ∧ A A gcd B gcd c = 1 ∧ b gcd c = 1
16 oveq1 ⊢ b = B A gcd B → b N = B A gcd B N
17 16 oveq2d ⊢ b = B A gcd B → A A gcd B N + b N = A A gcd B N + B A gcd B N
18 17 eqeq1d ⊢ b = B A gcd B → A A gcd B N + b N = c N ↔ A A gcd B N + B A gcd B N = c N
19 oveq2 ⊢ b = B A gcd B → A A gcd B gcd b = A A gcd B gcd B A gcd B
20 19 eqeq1d ⊢ b = B A gcd B → A A gcd B gcd b = 1 ↔ A A gcd B gcd B A gcd B = 1
21 oveq1 ⊢ b = B A gcd B → b gcd c = B A gcd B gcd c
22 21 eqeq1d ⊢ b = B A gcd B → b gcd c = 1 ↔ B A gcd B gcd c = 1
23 20 22 3anbi13d ⊢ b = B A gcd B → A A gcd B gcd b = 1 ∧ A A gcd B gcd c = 1 ∧ b gcd c = 1 ↔ A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd c = 1 ∧ B A gcd B gcd c = 1
24 18 23 anbi12d ⊢ b = B A gcd B → A A gcd B N + b N = c N ∧ A A gcd B gcd b = 1 ∧ A A gcd B gcd c = 1 ∧ b gcd c = 1 ↔ A A gcd B N + B A gcd B N = c N ∧ A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd c = 1 ∧ B A gcd B gcd c = 1
25 oveq1 ⊢ c = C A gcd B → c N = C A gcd B N
26 25 eqeq2d ⊢ c = C A gcd B → A A gcd B N + B A gcd B N = c N ↔ A A gcd B N + B A gcd B N = C A gcd B N
27 oveq2 ⊢ c = C A gcd B → A A gcd B gcd c = A A gcd B gcd C A gcd B
28 27 eqeq1d ⊢ c = C A gcd B → A A gcd B gcd c = 1 ↔ A A gcd B gcd C A gcd B = 1
29 oveq2 ⊢ c = C A gcd B → B A gcd B gcd c = B A gcd B gcd C A gcd B
30 29 eqeq1d ⊢ c = C A gcd B → B A gcd B gcd c = 1 ↔ B A gcd B gcd C A gcd B = 1
31 28 30 3anbi23d ⊢ c = C A gcd B → A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd c = 1 ∧ B A gcd B gcd c = 1 ↔ A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd C A gcd B = 1 ∧ B A gcd B gcd C A gcd B = 1
32 26 31 anbi12d ⊢ c = C A gcd B → A A gcd B N + B A gcd B N = c N ∧ A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd c = 1 ∧ B A gcd B gcd c = 1 ↔ A A gcd B N + B A gcd B N = C A gcd B N ∧ A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd C A gcd B = 1 ∧ B A gcd B gcd C A gcd B = 1
33 2 eleq2i ⊢ A ∈ Z ↔ A ∈ ℤ ∖ 0
34 eldifsn ⊢ A ∈ ℤ ∖ 0 ↔ A ∈ ℤ ∧ A ≠ 0
35 33 34 bitri ⊢ A ∈ Z ↔ A ∈ ℤ ∧ A ≠ 0
36 35 simplbi ⊢ A ∈ Z → A ∈ ℤ
37 3 36 syl ⊢ φ → A ∈ ℤ
38 2 eleq2i ⊢ B ∈ Z ↔ B ∈ ℤ ∖ 0
39 eldifsn ⊢ B ∈ ℤ ∖ 0 ↔ B ∈ ℤ ∧ B ≠ 0
40 38 39 bitri ⊢ B ∈ Z ↔ B ∈ ℤ ∧ B ≠ 0
41 40 simplbi ⊢ B ∈ Z → B ∈ ℤ
42 4 41 syl ⊢ φ → B ∈ ℤ
43 40 simprbi ⊢ B ∈ Z → B ≠ 0
44 4 43 syl ⊢ φ → B ≠ 0
45 divgcdz ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ B ≠ 0 → A A gcd B ∈ ℤ
46 37 42 44 45 syl3anc ⊢ φ → A A gcd B ∈ ℤ
47 37 zcnd ⊢ φ → A ∈ ℂ
48 37 42 jca ⊢ φ → A ∈ ℤ ∧ B ∈ ℤ
49 44 neneqd ⊢ φ → ¬ B = 0
50 49 intnand ⊢ φ → ¬ A = 0 ∧ B = 0
51 48 50 jca ⊢ φ → A ∈ ℤ ∧ B ∈ ℤ ∧ ¬ A = 0 ∧ B = 0
52 gcdn0cl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ ¬ A = 0 ∧ B = 0 → A gcd B ∈ ℕ
53 51 52 syl ⊢ φ → A gcd B ∈ ℕ
54 53 nncnd ⊢ φ → A gcd B ∈ ℂ
55 35 simprbi ⊢ A ∈ Z → A ≠ 0
56 3 55 syl ⊢ φ → A ≠ 0
57 49 olcd ⊢ φ → ¬ A = 0 ∨ ¬ B = 0
58 gcdeq0 ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B = 0 ↔ A = 0 ∧ B = 0
59 48 58 syl ⊢ φ → A gcd B = 0 ↔ A = 0 ∧ B = 0
60 59 notbid ⊢ φ → ¬ A gcd B = 0 ↔ ¬ A = 0 ∧ B = 0
61 ianor ⊢ ¬ A = 0 ∧ B = 0 ↔ ¬ A = 0 ∨ ¬ B = 0
62 60 61 bitrdi ⊢ φ → ¬ A gcd B = 0 ↔ ¬ A = 0 ∨ ¬ B = 0
63 57 62 mpbird ⊢ φ → ¬ A gcd B = 0
64 63 neqned ⊢ φ → A gcd B ≠ 0
65 47 54 56 64 divne0d ⊢ φ → A A gcd B ≠ 0
66 2 eleq2i ⊢ A A gcd B ∈ Z ↔ A A gcd B ∈ ℤ ∖ 0
67 eldifsn ⊢ A A gcd B ∈ ℤ ∖ 0 ↔ A A gcd B ∈ ℤ ∧ A A gcd B ≠ 0
68 66 67 bitri ⊢ A A gcd B ∈ Z ↔ A A gcd B ∈ ℤ ∧ A A gcd B ≠ 0
69 46 65 68 sylanbrc ⊢ φ → A A gcd B ∈ Z
70 37 42 gcdcomd ⊢ φ → A gcd B = B gcd A
71 70 oveq2d ⊢ φ → B A gcd B = B B gcd A
72 divgcdz ⊢ B ∈ ℤ ∧ A ∈ ℤ ∧ A ≠ 0 → B B gcd A ∈ ℤ
73 42 37 56 72 syl3anc ⊢ φ → B B gcd A ∈ ℤ
74 71 73 eqeltrd ⊢ φ → B A gcd B ∈ ℤ
75 42 zcnd ⊢ φ → B ∈ ℂ
76 75 54 44 64 divne0d ⊢ φ → B A gcd B ≠ 0
77 2 eleq2i ⊢ B A gcd B ∈ Z ↔ B A gcd B ∈ ℤ ∖ 0
78 eldifsn ⊢ B A gcd B ∈ ℤ ∖ 0 ↔ B A gcd B ∈ ℤ ∧ B A gcd B ≠ 0
79 77 78 bitri ⊢ B A gcd B ∈ Z ↔ B A gcd B ∈ ℤ ∧ B A gcd B ≠ 0
80 74 76 79 sylanbrc ⊢ φ → B A gcd B ∈ Z
81 1 2 3 4 5 6 fltgcdagcdc ⊢ φ → A gcd B = A gcd C
82 2 eleq2i ⊢ C ∈ Z ↔ C ∈ ℤ ∖ 0
83 eldifsn ⊢ C ∈ ℤ ∖ 0 ↔ C ∈ ℤ ∧ C ≠ 0
84 82 83 bitri ⊢ C ∈ Z ↔ C ∈ ℤ ∧ C ≠ 0
85 84 simplbi ⊢ C ∈ Z → C ∈ ℤ
86 5 85 syl ⊢ φ → C ∈ ℤ
87 37 86 gcdcomd ⊢ φ → A gcd C = C gcd A
88 81 87 eqtrd ⊢ φ → A gcd B = C gcd A
89 88 oveq2d ⊢ φ → C A gcd B = C C gcd A
90 divgcdz ⊢ C ∈ ℤ ∧ A ∈ ℤ ∧ A ≠ 0 → C C gcd A ∈ ℤ
91 86 37 56 90 syl3anc ⊢ φ → C C gcd A ∈ ℤ
92 89 91 eqeltrd ⊢ φ → C A gcd B ∈ ℤ
93 86 zcnd ⊢ φ → C ∈ ℂ
94 84 simprbi ⊢ C ∈ Z → C ≠ 0
95 5 94 syl ⊢ φ → C ≠ 0
96 93 54 95 64 divne0d ⊢ φ → C A gcd B ≠ 0
97 2 eleq2i ⊢ C A gcd B ∈ Z ↔ C A gcd B ∈ ℤ ∖ 0
98 eldifsn ⊢ C A gcd B ∈ ℤ ∖ 0 ↔ C A gcd B ∈ ℤ ∧ C A gcd B ≠ 0
99 97 98 bitri ⊢ C A gcd B ∈ Z ↔ C A gcd B ∈ ℤ ∧ C A gcd B ≠ 0
100 92 96 99 sylanbrc ⊢ φ → C A gcd B ∈ Z
101 1 nnnn0d ⊢ φ → N ∈ ℕ 0
102 54 64 47 75 93 101 6 fltdiv ⊢ φ → A A gcd B N + B A gcd B N = C A gcd B N
103 divgcdcoprm0 ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ B ≠ 0 → A A gcd B gcd B A gcd B = 1
104 37 42 44 103 syl3anc ⊢ φ → A A gcd B gcd B A gcd B = 1
105 81 oveq2d ⊢ φ → A A gcd B = A A gcd C
106 81 oveq2d ⊢ φ → C A gcd B = C A gcd C
107 105 106 oveq12d ⊢ φ → A A gcd B gcd C A gcd B = A A gcd C gcd C A gcd C
108 divgcdcoprm0 ⊢ A ∈ ℤ ∧ C ∈ ℤ ∧ C ≠ 0 → A A gcd C gcd C A gcd C = 1
109 37 86 95 108 syl3anc ⊢ φ → A A gcd C gcd C A gcd C = 1
110 107 109 eqtrd ⊢ φ → A A gcd B gcd C A gcd B = 1
111 1 2 3 4 5 6 fltgcdbgcdc ⊢ φ → A gcd B = B gcd C
112 111 oveq2d ⊢ φ → B A gcd B = B B gcd C
113 111 oveq2d ⊢ φ → C A gcd B = C B gcd C
114 112 113 oveq12d ⊢ φ → B A gcd B gcd C A gcd B = B B gcd C gcd C B gcd C
115 divgcdcoprm0 ⊢ B ∈ ℤ ∧ C ∈ ℤ ∧ C ≠ 0 → B B gcd C gcd C B gcd C = 1
116 42 86 95 115 syl3anc ⊢ φ → B B gcd C gcd C B gcd C = 1
117 114 116 eqtrd ⊢ φ → B A gcd B gcd C A gcd B = 1
118 104 110 117 3jca ⊢ φ → A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd C A gcd B = 1 ∧ B A gcd B gcd C A gcd B = 1
119 102 118 jca ⊢ φ → A A gcd B N + B A gcd B N = C A gcd B N ∧ A A gcd B gcd B A gcd B = 1 ∧ A A gcd B gcd C A gcd B = 1 ∧ B A gcd B gcd C A gcd B = 1
120 15 24 32 69 80 100 119 3rspcedvdw ⊢ φ → ∃ a ∈ Z ∃ b ∈ Z ∃ c ∈ Z a N + b N = c N ∧ a gcd b = 1 ∧ a gcd c = 1 ∧ b gcd c = 1