| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iexpcyc | Structured version Visualization version GIF version | ||
| Description: Taking i to the 𝐾-th power is the same as using the 𝐾 mod 4 -th power instead, by i4 14127. (Contributed by Mario Carneiro, 7-Jul-2014.) |
| Ref | Expression |
|---|---|
| iexpcyc | ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 12492 | . . . 4 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 2 | 4re 12229 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 3 | 4pos 12252 | . . . . 5 ⊢ 0 < 4 | |
| 4 | 2, 3 | elrpii 12908 | . . . 4 ⊢ 4 ∈ ℝ+ |
| 5 | modval 13791 | . . . 4 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℝ+) → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) | |
| 6 | 1, 4, 5 | sylancl 586 | . . 3 ⊢ (𝐾 ∈ ℤ → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) |
| 7 | 6 | oveq2d 7374 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4)))))) |
| 8 | 4z 12525 | . . . . 5 ⊢ 4 ∈ ℤ | |
| 9 | 4nn 12228 | . . . . . . 7 ⊢ 4 ∈ ℕ | |
| 10 | nndivre 12186 | . . . . . . 7 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℕ) → (𝐾 / 4) ∈ ℝ) | |
| 11 | 1, 9, 10 | sylancl 586 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 / 4) ∈ ℝ) |
| 12 | 11 | flcld 13718 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (⌊‘(𝐾 / 4)) ∈ ℤ) |
| 13 | zmulcl 12540 | . . . . 5 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) | |
| 14 | 8, 12, 13 | sylancr 587 | . . . 4 ⊢ (𝐾 ∈ ℤ → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) |
| 15 | ax-icn 11085 | . . . . 5 ⊢ i ∈ ℂ | |
| 16 | ine0 11572 | . . . . 5 ⊢ i ≠ 0 | |
| 17 | expsub 14033 | . . . . 5 ⊢ (((i ∈ ℂ ∧ i ≠ 0) ∧ (𝐾 ∈ ℤ ∧ (4 · (⌊‘(𝐾 / 4))) ∈ ℤ)) → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) | |
| 18 | 15, 16, 17 | mpanl12 702 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) |
| 19 | 14, 18 | mpdan 687 | . . 3 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) |
| 20 | expmulz 14031 | . . . . . . . 8 ⊢ (((i ∈ ℂ ∧ i ≠ 0) ∧ (4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ)) → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) | |
| 21 | 15, 16, 20 | mpanl12 702 | . . . . . . 7 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) |
| 22 | 8, 12, 21 | sylancr 587 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) |
| 23 | i4 14127 | . . . . . . . 8 ⊢ (i↑4) = 1 | |
| 24 | 23 | oveq1i 7368 | . . . . . . 7 ⊢ ((i↑4)↑(⌊‘(𝐾 / 4))) = (1↑(⌊‘(𝐾 / 4))) |
| 25 | 1exp 14014 | . . . . . . . 8 ⊢ ((⌊‘(𝐾 / 4)) ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) | |
| 26 | 12, 25 | syl 17 | . . . . . . 7 ⊢ (𝐾 ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) |
| 27 | 24, 26 | eqtrid 2783 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → ((i↑4)↑(⌊‘(𝐾 / 4))) = 1) |
| 28 | 22, 27 | eqtrd 2771 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = 1) |
| 29 | 28 | oveq2d 7374 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / 1)) |
| 30 | expclz 14007 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝐾 ∈ ℤ) → (i↑𝐾) ∈ ℂ) | |
| 31 | 15, 16, 30 | mp3an12 1453 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑𝐾) ∈ ℂ) |
| 32 | 31 | div1d 11909 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / 1) = (i↑𝐾)) |
| 33 | 29, 32 | eqtrd 2771 | . . 3 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 34 | 19, 33 | eqtrd 2771 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 35 | 7, 34 | eqtrd 2771 | 1 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ‘cfv 6492 (class class class)co 7358 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 ici 11028 · cmul 11031 − cmin 11364 / cdiv 11794 ℕcn 12145 4c4 12202 ℤcz 12488 ℝ+crp 12905 ⌊cfl 13710 mod cmo 13789 ↑cexp 13984 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 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-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-inf 9346 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-n0 12402 df-z 12489 df-uz 12752 df-rp 12906 df-fl 13712 df-mod 13790 df-seq 13925 df-exp 13985 |
| This theorem is referenced by: iblitg 25725 |
| Copyright terms: Public domain | W3C validator |