| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > flt0 | Structured version Visualization version GIF version | ||
| Description: A counterexample for FLT does not exist for 𝑁 = 0. (Contributed by SN, 20-Aug-2024.) |
| Ref | Expression |
|---|---|
| flt0.a | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| flt0.b | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| flt0.c | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| flt0.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| flt0.1 | ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) |
| Ref | Expression |
|---|---|
| flt0 | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | flt0.n | . 2 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
| 2 | 1p1e2 12292 | . . . . . 6 ⊢ (1 + 1) = 2 | |
| 3 | sn-1ne2 42717 | . . . . . . 7 ⊢ 1 ≠ 2 | |
| 4 | 3 | necomi 2987 | . . . . . 6 ⊢ 2 ≠ 1 |
| 5 | 2, 4 | eqnetri 3003 | . . . . 5 ⊢ (1 + 1) ≠ 1 |
| 6 | 5 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 + 1) ≠ 1) |
| 7 | flt0.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 8 | 7 | exp0d 14093 | . . . . 5 ⊢ (𝜑 → (𝐴↑0) = 1) |
| 9 | flt0.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 10 | 9 | exp0d 14093 | . . . . 5 ⊢ (𝜑 → (𝐵↑0) = 1) |
| 11 | 8, 10 | oveq12d 7378 | . . . 4 ⊢ (𝜑 → ((𝐴↑0) + (𝐵↑0)) = (1 + 1)) |
| 12 | flt0.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 13 | 12 | exp0d 14093 | . . . 4 ⊢ (𝜑 → (𝐶↑0) = 1) |
| 14 | 6, 11, 13 | 3netr4d 3010 | . . 3 ⊢ (𝜑 → ((𝐴↑0) + (𝐵↑0)) ≠ (𝐶↑0)) |
| 15 | flt0.1 | . . . . 5 ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) | |
| 16 | oveq2 7368 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0)) | |
| 17 | oveq2 7368 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝐵↑𝑁) = (𝐵↑0)) | |
| 18 | 16, 17 | oveq12d 7378 | . . . . . 6 ⊢ (𝑁 = 0 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = ((𝐴↑0) + (𝐵↑0))) |
| 19 | oveq2 7368 | . . . . . 6 ⊢ (𝑁 = 0 → (𝐶↑𝑁) = (𝐶↑0)) | |
| 20 | 18, 19 | eqeq12d 2753 | . . . . 5 ⊢ (𝑁 = 0 → (((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁) ↔ ((𝐴↑0) + (𝐵↑0)) = (𝐶↑0))) |
| 21 | 15, 20 | syl5ibcom 245 | . . . 4 ⊢ (𝜑 → (𝑁 = 0 → ((𝐴↑0) + (𝐵↑0)) = (𝐶↑0))) |
| 22 | 21 | imp 406 | . . 3 ⊢ ((𝜑 ∧ 𝑁 = 0) → ((𝐴↑0) + (𝐵↑0)) = (𝐶↑0)) |
| 23 | 14, 22 | mteqand 3024 | . 2 ⊢ (𝜑 → 𝑁 ≠ 0) |
| 24 | elnnne0 12442 | . 2 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0)) | |
| 25 | 1, 23, 24 | sylanbrc 584 | 1 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 (class class class)co 7360 ℂcc 11027 0cc0 11029 1c1 11030 + caddc 11032 ℕcn 12165 2c2 12227 ℕ0cn0 12428 ↑cexp 14014 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-neg 11371 df-nn 12166 df-2 12235 df-n0 12429 df-z 12516 df-seq 13955 df-exp 14015 |
| This theorem is referenced by: fltaccoprm 43087 |
| Copyright terms: Public domain | W3C validator |