![]() |
Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > fltmul | Structured version Visualization version GIF version |
Description: A counterexample to FLT stays valid when scaled. The hypotheses are more general than they need to be for convenience. (There does not seem to be a standard term for Fermat or Pythagorean triples extended to any 𝑁 ∈ ℕ0, so the label is more about the context in which this theorem is used). (Contributed by SN, 20-Aug-2024.) |
Ref | Expression |
---|---|
fltmul.s | ⊢ (𝜑 → 𝑆 ∈ ℂ) |
fltmul.a | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
fltmul.b | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
fltmul.c | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
fltmul.n | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
fltmul.1 | ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) |
Ref | Expression |
---|---|
fltmul | ⊢ (𝜑 → (((𝑆 · 𝐴)↑𝑁) + ((𝑆 · 𝐵)↑𝑁)) = ((𝑆 · 𝐶)↑𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fltmul.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ ℂ) | |
2 | fltmul.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
3 | 1, 2 | expcld 14146 | . . . 4 ⊢ (𝜑 → (𝑆↑𝑁) ∈ ℂ) |
4 | fltmul.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
5 | 4, 2 | expcld 14146 | . . . 4 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℂ) |
6 | fltmul.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
7 | 6, 2 | expcld 14146 | . . . 4 ⊢ (𝜑 → (𝐵↑𝑁) ∈ ℂ) |
8 | 3, 5, 7 | adddid 11270 | . . 3 ⊢ (𝜑 → ((𝑆↑𝑁) · ((𝐴↑𝑁) + (𝐵↑𝑁))) = (((𝑆↑𝑁) · (𝐴↑𝑁)) + ((𝑆↑𝑁) · (𝐵↑𝑁)))) |
9 | fltmul.1 | . . . 4 ⊢ (𝜑 → ((𝐴↑𝑁) + (𝐵↑𝑁)) = (𝐶↑𝑁)) | |
10 | 9 | oveq2d 7435 | . . 3 ⊢ (𝜑 → ((𝑆↑𝑁) · ((𝐴↑𝑁) + (𝐵↑𝑁))) = ((𝑆↑𝑁) · (𝐶↑𝑁))) |
11 | 8, 10 | eqtr3d 2767 | . 2 ⊢ (𝜑 → (((𝑆↑𝑁) · (𝐴↑𝑁)) + ((𝑆↑𝑁) · (𝐵↑𝑁))) = ((𝑆↑𝑁) · (𝐶↑𝑁))) |
12 | 1, 4, 2 | mulexpd 14161 | . . 3 ⊢ (𝜑 → ((𝑆 · 𝐴)↑𝑁) = ((𝑆↑𝑁) · (𝐴↑𝑁))) |
13 | 1, 6, 2 | mulexpd 14161 | . . 3 ⊢ (𝜑 → ((𝑆 · 𝐵)↑𝑁) = ((𝑆↑𝑁) · (𝐵↑𝑁))) |
14 | 12, 13 | oveq12d 7437 | . 2 ⊢ (𝜑 → (((𝑆 · 𝐴)↑𝑁) + ((𝑆 · 𝐵)↑𝑁)) = (((𝑆↑𝑁) · (𝐴↑𝑁)) + ((𝑆↑𝑁) · (𝐵↑𝑁)))) |
15 | fltmul.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
16 | 1, 15, 2 | mulexpd 14161 | . 2 ⊢ (𝜑 → ((𝑆 · 𝐶)↑𝑁) = ((𝑆↑𝑁) · (𝐶↑𝑁))) |
17 | 11, 14, 16 | 3eqtr4d 2775 | 1 ⊢ (𝜑 → (((𝑆 · 𝐴)↑𝑁) + ((𝑆 · 𝐵)↑𝑁)) = ((𝑆 · 𝐶)↑𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 (class class class)co 7419 ℂcc 11138 + caddc 11143 · cmul 11145 ℕ0cn0 12505 ↑cexp 14062 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5300 ax-nul 5307 ax-pow 5365 ax-pr 5429 ax-un 7741 ax-cnex 11196 ax-resscn 11197 ax-1cn 11198 ax-icn 11199 ax-addcl 11200 ax-addrcl 11201 ax-mulcl 11202 ax-mulrcl 11203 ax-mulcom 11204 ax-addass 11205 ax-mulass 11206 ax-distr 11207 ax-i2m1 11208 ax-1ne0 11209 ax-1rid 11210 ax-rnegex 11211 ax-rrecex 11212 ax-cnre 11213 ax-pre-lttri 11214 ax-pre-lttrn 11215 ax-pre-ltadd 11216 ax-pre-mulgt0 11217 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3964 df-nul 4323 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6307 df-ord 6374 df-on 6375 df-lim 6376 df-suc 6377 df-iota 6501 df-fun 6551 df-fn 6552 df-f 6553 df-f1 6554 df-fo 6555 df-f1o 6556 df-fv 6557 df-riota 7375 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7872 df-2nd 7995 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11282 df-mnf 11283 df-xr 11284 df-ltxr 11285 df-le 11286 df-sub 11478 df-neg 11479 df-nn 12246 df-n0 12506 df-z 12592 df-uz 12856 df-seq 14003 df-exp 14063 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |