| 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 12306 | . . . . . 6 ⊢ (1 + 1) = 2 | |
| 3 | sn-1ne2 42253 | . . . . . . 7 ⊢ 1 ≠ 2 | |
| 4 | 3 | necomi 2979 | . . . . . 6 ⊢ 2 ≠ 1 |
| 5 | 2, 4 | eqnetri 2995 | . . . . 5 ⊢ (1 + 1) ≠ 1 |
| 6 | 5 | a1i 11 | . . . 4 ⊢ (𝜑 → (1 + 1) ≠ 1) |
| 7 | flt0.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 8 | 7 | exp0d 14105 | . . . . 5 ⊢ (𝜑 → (𝐴↑0) = 1) |
| 9 | flt0.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 10 | 9 | exp0d 14105 | . . . . 5 ⊢ (𝜑 → (𝐵↑0) = 1) |
| 11 | 8, 10 | oveq12d 7405 | . . . 4 ⊢ (𝜑 → ((𝐴↑0) + (𝐵↑0)) = (1 + 1)) |
| 12 | flt0.c | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 13 | 12 | exp0d 14105 | . . . 4 ⊢ (𝜑 → (𝐶↑0) = 1) |
| 14 | 6, 11, 13 | 3netr4d 3002 | . . 3 ⊢ (𝜑 → ((𝐴↑0) + (𝐵↑0)) ≠ (𝐶↑0)) |
| 15 | flt0.1 | . . . . 5 ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) | |
| 16 | oveq2 7395 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0)) | |
| 17 | oveq2 7395 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝐵↑𝑁) = (𝐵↑0)) | |
| 18 | 16, 17 | oveq12d 7405 | . . . . . 6 ⊢ (𝑁 = 0 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = ((𝐴↑0) + (𝐵↑0))) |
| 19 | oveq2 7395 | . . . . . 6 ⊢ (𝑁 = 0 → (𝐶↑𝑁) = (𝐶↑0)) | |
| 20 | 18, 19 | eqeq12d 2745 | . . . . 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 3016 | . 2 ⊢ (𝜑 → 𝑁 ≠ 0) |
| 24 | elnnne0 12456 | . 2 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0)) | |
| 25 | 1, 23, 24 | sylanbrc 583 | 1 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 (class class class)co 7387 ℂcc 11066 0cc0 11068 1c1 11069 + caddc 11071 ℕcn 12186 2c2 12241 ℕ0cn0 12442 ↑cexp 14026 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-neg 11408 df-nn 12187 df-2 12249 df-n0 12443 df-z 12530 df-seq 13967 df-exp 14027 |
| This theorem is referenced by: fltaccoprm 42628 |
| Copyright terms: Public domain | W3C validator |