| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fltoddsum | Structured version Visualization version GIF version | ||
| Description: The solution of the generalized FLT for an odd exponent can be assumed to be a solution of an equation with 3 integer summands. (Contributed by AV, 2-Nov-2026.) |
| Ref | Expression |
|---|---|
| fltoddsum.n | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| fltoddsum.a | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| fltoddsum.b | ⊢ (𝜑 → 𝐵 ∈ ℤ) |
| fltoddsum.c | ⊢ (𝜑 → 𝐶 ∈ ℤ) |
| fltoddsum.e | ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) |
| fltoddsum.o | ⊢ (𝜑 → ¬ 2 ∥ 𝑁) |
| Ref | Expression |
|---|---|
| fltoddsum | ⊢ (𝜑 → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ ∃𝑐 ∈ ℤ (((𝑎↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7457 | . . . . 5 ⊢ (𝑎 = 𝐴 → (𝑎↑𝑁) = (𝐴↑𝑁)) | |
| 2 | 1 | oveq1d 7465 | . . . 4 ⊢ (𝑎 = 𝐴 → ((𝑎↑𝑁) + (𝑏↑𝑁)) = ((𝐴↑𝑁) + (𝑏↑𝑁))) |
| 3 | 2 | oveq1d 7465 | . . 3 ⊢ (𝑎 = 𝐴 → (((𝑎↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = (((𝐴↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁))) |
| 4 | 3 | eqeq1d 2768 | . 2 ⊢ (𝑎 = 𝐴 → ((((𝑎↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = 0 ↔ (((𝐴↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = 0)) |
| 5 | oveq1 7457 | . . . . 5 ⊢ (𝑏 = 𝐵 → (𝑏↑𝑁) = (𝐵↑𝑁)) | |
| 6 | 5 | oveq2d 7466 | . . . 4 ⊢ (𝑏 = 𝐵 → ((𝐴↑𝑁) + (𝑏↑𝑁)) = ((𝐴↑𝑁) + (𝐵↑𝑁))) |
| 7 | 6 | oveq1d 7465 | . . 3 ⊢ (𝑏 = 𝐵 → (((𝐴↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = (((𝐴↑𝑁) + (𝐵↑𝑁)) + (𝑐↑𝑁))) |
| 8 | 7 | eqeq1d 2768 | . 2 ⊢ (𝑏 = 𝐵 → ((((𝐴↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = 0 ↔ (((𝐴↑𝑁) + (𝐵↑𝑁)) + (𝑐↑𝑁)) = 0)) |
| 9 | oveq1 7457 | . . . 4 ⊢ (𝑐 = -𝐶 → (𝑐↑𝑁) = ( -𝐶↑𝑁)) | |
| 10 | 9 | oveq2d 7466 | . . 3 ⊢ (𝑐 = -𝐶 → (((𝐴↑𝑁) + (𝐵↑𝑁)) + (𝑐↑𝑁)) = (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁))) |
| 11 | 10 | eqeq1d 2768 | . 2 ⊢ (𝑐 = -𝐶 → ((((𝐴↑𝑁) + (𝐵↑𝑁)) + (𝑐↑𝑁)) = 0 ↔ (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁)) = 0)) |
| 12 | fltoddsum.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
| 13 | fltoddsum.b | . 2 ⊢ (𝜑 → 𝐵 ∈ ℤ) | |
| 14 | fltoddsum.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℤ) | |
| 15 | 14 | znegcld 12844 | . 2 ⊢ (𝜑 → -𝐶 ∈ ℤ) |
| 16 | fltoddsum.e | . . 3 ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) | |
| 17 | fltoddsum.n | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
| 18 | 17 | nnnn0d 12706 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 19 | 12, 18 | zexpcld 14269 | . . . . . . . . 9 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℤ) |
| 20 | 13, 18 | zexpcld 14269 | . . . . . . . . 9 ⊢ (𝜑 → (𝐵↑𝑁) ∈ ℤ) |
| 21 | 19, 20 | zaddcld 12846 | . . . . . . . 8 ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) ∈ ℤ) |
| 22 | 21 | zcnd 12843 | . . . . . . 7 ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) ∈ ℂ) |
| 23 | 14, 18 | zexpcld 14269 | . . . . . . . 8 ⊢ (𝜑 → (𝐶↑𝑁) ∈ ℤ) |
| 24 | 23 | zcnd 12843 | . . . . . . 7 ⊢ (𝜑 → (𝐶↑𝑁) ∈ ℂ) |
| 25 | 22, 24 | negsubd 11713 | . . . . . 6 ⊢ (𝜑 → (((𝐴↑𝑁) + (𝐵↑𝑁)) + -(𝐶↑𝑁)) = (((𝐴↑𝑁) + (𝐵↑𝑁)) − (𝐶↑𝑁))) |
| 26 | 25 | eqeq1d 2768 | . . . . 5 ⊢ (𝜑 → ((((𝐴↑𝑁) + (𝐵↑𝑁)) + -(𝐶↑𝑁)) = 0 ↔ (((𝐴↑𝑁) + (𝐵↑𝑁)) − (𝐶↑𝑁)) = 0)) |
| 27 | 22, 24 | subeq0ad 11715 | . . . . 5 ⊢ (𝜑 → ((((𝐴↑𝑁) + (𝐵↑𝑁)) − (𝐶↑𝑁)) = 0 ↔ ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁))) |
| 28 | 26, 27 | bitrd 282 | . . . 4 ⊢ (𝜑 → ((((𝐴↑𝑁) + (𝐵↑𝑁)) + -(𝐶↑𝑁)) = 0 ↔ ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁))) |
| 29 | 14 | zcnd 12843 | . . . . . . . . 9 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 30 | fltoddsum.o | . . . . . . . . 9 ⊢ (𝜑 → ¬ 2 ∥ 𝑁) | |
| 31 | oexpneg 16557 | . . . . . . . . 9 ⊢ ((𝐶 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ ¬ 2 ∥ 𝑁) → ( -𝐶↑𝑁) = -(𝐶↑𝑁)) | |
| 32 | 29, 17, 30, 31 | syl3anc 1401 | . . . . . . . 8 ⊢ (𝜑 → ( -𝐶↑𝑁) = -(𝐶↑𝑁)) |
| 33 | 32 | eqcomd 2772 | . . . . . . 7 ⊢ (𝜑 → -(𝐶↑𝑁) = ( -𝐶↑𝑁)) |
| 34 | 33 | oveq2d 7466 | . . . . . 6 ⊢ (𝜑 → (((𝐴↑𝑁) + (𝐵↑𝑁)) + -(𝐶↑𝑁)) = (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁))) |
| 35 | 34 | eqeq1d 2768 | . . . . 5 ⊢ (𝜑 → ((((𝐴↑𝑁) + (𝐵↑𝑁)) + -(𝐶↑𝑁)) = 0 ↔ (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁)) = 0)) |
| 36 | 35 | biimpd 232 | . . . 4 ⊢ (𝜑 → ((((𝐴↑𝑁) + (𝐵↑𝑁)) + -(𝐶↑𝑁)) = 0 → (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁)) = 0)) |
| 37 | 28, 36 | sylbird 263 | . . 3 ⊢ (𝜑 → (((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁) → (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁)) = 0)) |
| 38 | 16, 37 | mpd 16 | . 2 ⊢ (𝜑 → (((𝐴↑𝑁) + (𝐵↑𝑁)) + ( -𝐶↑𝑁)) = 0) |
| 39 | 4, 8, 11, 12, 13, 15, 38 | 3rspcedvdw 3596 | 1 ⊢ (𝜑 → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ ∃𝑐 ∈ ℤ (((𝑎↑𝑁) + (𝑏↑𝑁)) + (𝑐↑𝑁)) = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1572 ∈ wcel 2150 ∃wrex 3093 class class class wbr 5107 (class class class)co 7450 ℂcc 11236 0cc0 11238 + caddc 11241 − cmin 11579 -cneg 11580 ℕcn 12374 2c2 12436 ℤcz 12732 ↑cexp 14243 ∥ cdvds 16464 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-div 12013 df-nn 12375 df-2 12444 df-n0 12646 df-z 12733 df-uz 13005 df-rp 13160 df-seq 14184 df-exp 14244 df-dvds 16465 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |