Metamath Proof Explorer


Theorem fltoprm

Description: Fermat's last theorem holds for any exponent greater than 2 if it holds for odd prime exponents. (Contributed by AV, 15-Sep-2026)

Ref Expression
Hypotheses fltoprm.a ⊢ φ → A ∈ ℕ
fltoprm.b ⊢ φ → B ∈ ℕ
fltoprm.c ⊢ φ → C ∈ ℕ
fltoprm.n ⊢ φ → N ∈ ℤ ≥ 3
fltoprm.r ⊢ φ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
Assertion fltoprm ⊢ φ → A N + B N ≠ C N

Proof

Step Hyp Ref Expression
1 fltoprm.a ⊢ φ → A ∈ ℕ
2 fltoprm.b ⊢ φ → B ∈ ℕ
3 fltoprm.c ⊢ φ → C ∈ ℕ
4 fltoprm.n ⊢ φ → N ∈ ℤ ≥ 3
5 fltoprm.r ⊢ φ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
6 prmnn ⊢ r ∈ ℙ → r ∈ ℕ
7 3nn ⊢ 3 ∈ ℕ
8 eluznn ⊢ 3 ∈ ℕ ∧ N ∈ ℤ ≥ 3 → N ∈ ℕ
9 7 4 8 sylancr ⊢ φ → N ∈ ℕ
10 nndivides ⊢ r ∈ ℕ ∧ N ∈ ℕ → r ∥ N ↔ ∃ k ∈ ℕ k ⁢ r = N
11 6 9 10 syl2anr ⊢ φ ∧ r ∈ ℙ → r ∥ N ↔ ∃ k ∈ ℕ k ⁢ r = N
12 5 adantr ⊢ φ ∧ r ∈ ℙ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
13 12 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
14 1 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A ∈ ℕ
15 nnnn0 ⊢ k ∈ ℕ → k ∈ ℕ 0
16 15 adantl ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → k ∈ ℕ 0
17 14 16 nnexpcld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A k ∈ ℕ
18 2 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → B ∈ ℕ
19 18 16 nnexpcld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → B k ∈ ℕ
20 3 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → C ∈ ℕ
21 20 16 nnexpcld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → C k ∈ ℕ
22 17 19 21 3jca ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A k ∈ ℕ ∧ B k ∈ ℕ ∧ C k ∈ ℕ
23 22 adantr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → A k ∈ ℕ ∧ B k ∈ ℕ ∧ C k ∈ ℕ
24 oveq1 ⊢ a = A k → a p = A k p
25 24 oveq1d ⊢ a = A k → a p + b p = A k p + b p
26 25 neeq1d ⊢ a = A k → a p + b p ≠ c p ↔ A k p + b p ≠ c p
27 26 imbi2d ⊢ a = A k → 2 < p → a p + b p ≠ c p ↔ 2 < p → A k p + b p ≠ c p
28 27 ralbidv ⊢ a = A k → ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p ↔ ∀ p ∈ ℙ 2 < p → A k p + b p ≠ c p
29 oveq1 ⊢ b = B k → b p = B k p
30 29 oveq2d ⊢ b = B k → A k p + b p = A k p + B k p
31 30 neeq1d ⊢ b = B k → A k p + b p ≠ c p ↔ A k p + B k p ≠ c p
32 31 imbi2d ⊢ b = B k → 2 < p → A k p + b p ≠ c p ↔ 2 < p → A k p + B k p ≠ c p
33 32 ralbidv ⊢ b = B k → ∀ p ∈ ℙ 2 < p → A k p + b p ≠ c p ↔ ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ c p
34 oveq1 ⊢ c = C k → c p = C k p
35 34 neeq2d ⊢ c = C k → A k p + B k p ≠ c p ↔ A k p + B k p ≠ C k p
36 35 imbi2d ⊢ c = C k → 2 < p → A k p + B k p ≠ c p ↔ 2 < p → A k p + B k p ≠ C k p
37 36 ralbidv ⊢ c = C k → ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ c p ↔ ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ C k p
38 28 33 37 rspc3v ⊢ A k ∈ ℕ ∧ B k ∈ ℕ ∧ C k ∈ ℕ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p → ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ C k p
39 23 38 syl ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p → ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ C k p
40 breq2 ⊢ p = r → 2 < p ↔ 2 < r
41 oveq2 ⊢ p = r → A k p = A k r
42 oveq2 ⊢ p = r → B k p = B k r
43 41 42 oveq12d ⊢ p = r → A k p + B k p = A k r + B k r
44 oveq2 ⊢ p = r → C k p = C k r
45 43 44 neeq12d ⊢ p = r → A k p + B k p ≠ C k p ↔ A k r + B k r ≠ C k r
46 40 45 imbi12d ⊢ p = r → 2 < p → A k p + B k p ≠ C k p ↔ 2 < r → A k r + B k r ≠ C k r
47 46 rspcv ⊢ r ∈ ℙ → ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ C k p → 2 < r → A k r + B k r ≠ C k r
48 47 adantl ⊢ φ ∧ r ∈ ℙ → ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ C k p → 2 < r → A k r + B k r ≠ C k r
49 48 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → ∀ p ∈ ℙ 2 < p → A k p + B k p ≠ C k p → 2 < r → A k r + B k r ≠ C k r
50 pm2.27 ⊢ 2 < r → 2 < r → A k r + B k r ≠ C k r → A k r + B k r ≠ C k r
51 50 adantl ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → 2 < r → A k r + B k r ≠ C k r → A k r + B k r ≠ C k r
52 39 49 51 3syld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p → A k r + B k r ≠ C k r
53 13 52 mpd ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → A k r + B k r ≠ C k r
54 1 nncnd ⊢ φ → A ∈ ℂ
55 54 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A ∈ ℂ
56 6 nnnn0d ⊢ r ∈ ℙ → r ∈ ℕ 0
57 56 adantl ⊢ φ ∧ r ∈ ℙ → r ∈ ℕ 0
58 57 adantr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → r ∈ ℕ 0
59 55 58 16 expmuld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A k ⁢ r = A k r
60 2 nncnd ⊢ φ → B ∈ ℂ
61 60 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → B ∈ ℂ
62 61 58 16 expmuld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → B k ⁢ r = B k r
63 59 62 oveq12d ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A k ⁢ r + B k ⁢ r = A k r + B k r
64 3 nncnd ⊢ φ → C ∈ ℂ
65 64 ad2antrr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → C ∈ ℂ
66 65 58 16 expmuld ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → C k ⁢ r = C k r
67 63 66 neeq12d ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → A k ⁢ r + B k ⁢ r ≠ C k ⁢ r ↔ A k r + B k r ≠ C k r
68 67 adantr ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → A k ⁢ r + B k ⁢ r ≠ C k ⁢ r ↔ A k r + B k r ≠ C k r
69 53 68 mpbird ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → A k ⁢ r + B k ⁢ r ≠ C k ⁢ r
70 oveq2 ⊢ k ⁢ r = N → A k ⁢ r = A N
71 oveq2 ⊢ k ⁢ r = N → B k ⁢ r = B N
72 70 71 oveq12d ⊢ k ⁢ r = N → A k ⁢ r + B k ⁢ r = A N + B N
73 oveq2 ⊢ k ⁢ r = N → C k ⁢ r = C N
74 72 73 neeq12d ⊢ k ⁢ r = N → A k ⁢ r + B k ⁢ r ≠ C k ⁢ r ↔ A N + B N ≠ C N
75 69 74 syl5ibcom ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ ∧ 2 < r → k ⁢ r = N → A N + B N ≠ C N
76 75 ex ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → 2 < r → k ⁢ r = N → A N + B N ≠ C N
77 76 com23 ⊢ φ ∧ r ∈ ℙ ∧ k ∈ ℕ → k ⁢ r = N → 2 < r → A N + B N ≠ C N
78 77 rexlimdva ⊢ φ ∧ r ∈ ℙ → ∃ k ∈ ℕ k ⁢ r = N → 2 < r → A N + B N ≠ C N
79 11 78 sylbid ⊢ φ ∧ r ∈ ℙ → r ∥ N → 2 < r → A N + B N ≠ C N
80 79 impcomd ⊢ φ ∧ r ∈ ℙ → 2 < r ∧ r ∥ N → A N + B N ≠ C N
81 80 rexlimdva ⊢ φ → ∃ r ∈ ℙ 2 < r ∧ r ∥ N → A N + B N ≠ C N
82 4 ad2antrr ⊢ φ ∧ n ∈ ℕ 0 ∧ N = 2 n → N ∈ ℤ ≥ 3
83 simplr ⊢ φ ∧ n ∈ ℕ 0 ∧ N = 2 n → n ∈ ℕ 0
84 simpr ⊢ φ ∧ n ∈ ℕ 0 ∧ N = 2 n → N = 2 n
85 fltoprmlem2 ⊢ N ∈ ℤ ≥ 3 ∧ n ∈ ℕ 0 ∧ N = 2 n → 4 ∥ N
86 82 83 84 85 syl3anc ⊢ φ ∧ n ∈ ℕ 0 ∧ N = 2 n → 4 ∥ N
87 86 ex ⊢ φ ∧ n ∈ ℕ 0 → N = 2 n → 4 ∥ N
88 4nn ⊢ 4 ∈ ℕ
89 9 88 jctil ⊢ φ → 4 ∈ ℕ ∧ N ∈ ℕ
90 89 adantr ⊢ φ ∧ n ∈ ℕ 0 → 4 ∈ ℕ ∧ N ∈ ℕ
91 nndivides ⊢ 4 ∈ ℕ ∧ N ∈ ℕ → 4 ∥ N ↔ ∃ k ∈ ℕ k ⋅ 4 = N
92 90 91 syl ⊢ φ ∧ n ∈ ℕ 0 → 4 ∥ N ↔ ∃ k ∈ ℕ k ⋅ 4 = N
93 1 ad2antrr ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A ∈ ℕ
94 15 adantl ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → k ∈ ℕ 0
95 93 94 nnexpcld ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A k ∈ ℕ
96 2 ad2antrr ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → B ∈ ℕ
97 96 94 nnexpcld ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → B k ∈ ℕ
98 3 ad2antrr ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → C ∈ ℕ
99 98 94 nnexpcld ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → C k ∈ ℕ
100 95 97 99 flt4 ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A k 4 + B k 4 ≠ C k 4
101 54 ad2antrr ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A ∈ ℂ
102 4nn0 ⊢ 4 ∈ ℕ 0
103 102 a1i ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → 4 ∈ ℕ 0
104 101 103 94 expmuld ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A k ⋅ 4 = A k 4
105 2 adantr ⊢ φ ∧ n ∈ ℕ 0 → B ∈ ℕ
106 105 nncnd ⊢ φ ∧ n ∈ ℕ 0 → B ∈ ℂ
107 106 adantr ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → B ∈ ℂ
108 107 103 94 expmuld ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → B k ⋅ 4 = B k 4
109 104 108 oveq12d ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A k ⋅ 4 + B k ⋅ 4 = A k 4 + B k 4
110 64 ad2antrr ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → C ∈ ℂ
111 110 103 94 expmuld ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → C k ⋅ 4 = C k 4
112 100 109 111 3netr4d ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → A k ⋅ 4 + B k ⋅ 4 ≠ C k ⋅ 4
113 oveq2 ⊢ k ⋅ 4 = N → A k ⋅ 4 = A N
114 oveq2 ⊢ k ⋅ 4 = N → B k ⋅ 4 = B N
115 113 114 oveq12d ⊢ k ⋅ 4 = N → A k ⋅ 4 + B k ⋅ 4 = A N + B N
116 oveq2 ⊢ k ⋅ 4 = N → C k ⋅ 4 = C N
117 115 116 neeq12d ⊢ k ⋅ 4 = N → A k ⋅ 4 + B k ⋅ 4 ≠ C k ⋅ 4 ↔ A N + B N ≠ C N
118 112 117 syl5ibcom ⊢ φ ∧ n ∈ ℕ 0 ∧ k ∈ ℕ → k ⋅ 4 = N → A N + B N ≠ C N
119 118 rexlimdva ⊢ φ ∧ n ∈ ℕ 0 → ∃ k ∈ ℕ k ⋅ 4 = N → A N + B N ≠ C N
120 92 119 sylbid ⊢ φ ∧ n ∈ ℕ 0 → 4 ∥ N → A N + B N ≠ C N
121 87 120 syld ⊢ φ ∧ n ∈ ℕ 0 → N = 2 n → A N + B N ≠ C N
122 121 rexlimdva ⊢ φ → ∃ n ∈ ℕ 0 N = 2 n → A N + B N ≠ C N
123 fltoprmlem1 ⊢ N ∈ ℕ → ∃ r ∈ ℙ 2 < r ∧ r ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n
124 9 123 syl ⊢ φ → ∃ r ∈ ℙ 2 < r ∧ r ∥ N ∨ ∃ n ∈ ℕ 0 N = 2 n
125 81 122 124 mpjaod ⊢ φ → A N + B N ≠ C N