Metamath Proof Explorer


Theorem fltoprmgt3

Description: Fermat's last theorem holds for any exponent greater than 2 if it holds for all odd prime exponents greater than 3. (TODO-AV: after a proof is available for N = 3 , see flt3, the hypothesis fltoprmgt3.3 can be removed.) (Contributed by AV, 15-Sep-2026)

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

Proof

Step Hyp Ref Expression
1 fltoprmgt3.a ⊢ φ → A ∈ ℕ
2 fltoprmgt3.b ⊢ φ → B ∈ ℕ
3 fltoprmgt3.c ⊢ φ → C ∈ ℕ
4 fltoprmgt3.n ⊢ φ → N ∈ ℤ ≥ 3
5 fltoprmgt3.r ⊢ φ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 3 < p → a p + b p ≠ c p
6 fltoprmgt3.3 ⊢ φ → a 3 + b 3 ≠ c 3
7 prmz ⊢ p ∈ ℙ → p ∈ ℤ
8 2z ⊢ 2 ∈ ℤ
9 8 a1i ⊢ p ∈ ℤ → 2 ∈ ℤ
10 id ⊢ p ∈ ℤ → p ∈ ℤ
11 9 10 zltp1led ⊢ p ∈ ℤ → 2 < p ↔ 2 + 1 ≤ p
12 2p1e3 ⊢ 2 + 1 = 3
13 12 breq1i ⊢ 2 + 1 ≤ p ↔ 3 ≤ p
14 13 a1i ⊢ p ∈ ℤ → 2 + 1 ≤ p ↔ 3 ≤ p
15 3re ⊢ 3 ∈ ℝ
16 15 a1i ⊢ p ∈ ℤ → 3 ∈ ℝ
17 zre ⊢ p ∈ ℤ → p ∈ ℝ
18 16 17 leloed ⊢ p ∈ ℤ → 3 ≤ p ↔ 3 < p ∨ 3 = p
19 11 14 18 3bitrd ⊢ p ∈ ℤ → 2 < p ↔ 3 < p ∨ 3 = p
20 7 19 syl ⊢ p ∈ ℙ → 2 < p ↔ 3 < p ∨ 3 = p
21 20 adantl ⊢ c ∈ ℕ ∧ p ∈ ℙ → 2 < p ↔ 3 < p ∨ 3 = p
22 21 adantl ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ → 2 < p ↔ 3 < p ∨ 3 = p
23 pm2.27 ⊢ 3 < p → 3 < p → a p + b p ≠ c p → a p + b p ≠ c p
24 23 a1i ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ → 3 < p → 3 < p → a p + b p ≠ c p → a p + b p ≠ c p
25 6 ad3antrrr ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ ∧ 3 = p → a 3 + b 3 ≠ c 3
26 oveq2 ⊢ 3 = p → a 3 = a p
27 oveq2 ⊢ 3 = p → b 3 = b p
28 26 27 oveq12d ⊢ 3 = p → a 3 + b 3 = a p + b p
29 oveq2 ⊢ 3 = p → c 3 = c p
30 28 29 neeq12d ⊢ 3 = p → a 3 + b 3 ≠ c 3 ↔ a p + b p ≠ c p
31 30 adantl ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ ∧ 3 = p → a 3 + b 3 ≠ c 3 ↔ a p + b p ≠ c p
32 25 31 mpbid ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ ∧ 3 = p → a p + b p ≠ c p
33 32 a1d ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ ∧ 3 = p → 3 < p → a p + b p ≠ c p → a p + b p ≠ c p
34 33 ex ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ → 3 = p → 3 < p → a p + b p ≠ c p → a p + b p ≠ c p
35 24 34 jaod ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ → 3 < p ∨ 3 = p → 3 < p → a p + b p ≠ c p → a p + b p ≠ c p
36 22 35 sylbid ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ → 2 < p → 3 < p → a p + b p ≠ c p → a p + b p ≠ c p
37 36 com23 ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ ∧ c ∈ ℕ ∧ p ∈ ℙ → 3 < p → a p + b p ≠ c p → 2 < p → a p + b p ≠ c p
38 37 ralimdvva ⊢ φ ∧ a ∈ ℕ ∧ b ∈ ℕ → ∀ c ∈ ℕ ∀ p ∈ ℙ 3 < p → a p + b p ≠ c p → ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
39 38 ralimdvva ⊢ φ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 3 < p → a p + b p ≠ c p → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
40 5 39 mpd ⊢ φ → ∀ a ∈ ℕ ∀ b ∈ ℕ ∀ c ∈ ℕ ∀ p ∈ ℙ 2 < p → a p + b p ≠ c p
41 1 2 3 4 40 fltoprm ⊢ φ → A N + B N ≠ C N