| 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 14203. (Contributed by Mario Carneiro, 7-Jul-2014.) |
| Ref | Expression |
|---|---|
| iexpcyc | ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 12558 | . . . 4 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 2 | 4re 12288 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 3 | 4pos 12314 | . . . . 5 ⊢ 0 < 4 | |
| 4 | 2, 3 | elrpii 12982 | . . . 4 ⊢ 4 ∈ ℝ+ |
| 5 | modval 13867 | . . . 4 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℝ+) → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) | |
| 6 | 1, 4, 5 | sylancl 594 | . . 3 ⊢ (𝐾 ∈ ℤ → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) |
| 7 | 6 | oveq2d 7397 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4)))))) |
| 8 | 4z 12591 | . . . . 5 ⊢ 4 ∈ ℤ | |
| 9 | 4nn 12287 | . . . . . . 7 ⊢ 4 ∈ ℕ | |
| 10 | nndivre 12240 | . . . . . . 7 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℕ) → (𝐾 / 4) ∈ ℝ) | |
| 11 | 1, 9, 10 | sylancl 594 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 / 4) ∈ ℝ) |
| 12 | 11 | flcld 13794 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (⌊‘(𝐾 / 4)) ∈ ℤ) |
| 13 | zmulcl 12606 | . . . . 5 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) | |
| 14 | 8, 12, 13 | sylancr 595 | . . . 4 ⊢ (𝐾 ∈ ℤ → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) |
| 15 | ax-icn 11118 | . . . . 5 ⊢ i ∈ ℂ | |
| 16 | ine0 11608 | . . . . 5 ⊢ i ≠ 0 | |
| 17 | expsub 14109 | . . . . 5 ⊢ (((i ∈ ℂ ∧ i ≠ 0) ∧ (𝐾 ∈ ℤ ∧ (4 · (⌊‘(𝐾 / 4))) ∈ ℤ)) → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) | |
| 18 | 15, 16, 17 | mpanl12 710 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) |
| 19 | 14, 18 | mpdan 695 | . . 3 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) |
| 20 | expmulz 14107 | . . . . . . . 8 ⊢ (((i ∈ ℂ ∧ i ≠ 0) ∧ (4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ)) → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) | |
| 21 | 15, 16, 20 | mpanl12 710 | . . . . . . 7 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) |
| 22 | 8, 12, 21 | sylancr 595 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) |
| 23 | i4 14203 | . . . . . . . 8 ⊢ (i↑4) = 1 | |
| 24 | 23 | oveq1i 7391 | . . . . . . 7 ⊢ ((i↑4)↑(⌊‘(𝐾 / 4))) = (1↑(⌊‘(𝐾 / 4))) |
| 25 | 1exp 14090 | . . . . . . . 8 ⊢ ((⌊‘(𝐾 / 4)) ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) | |
| 26 | 12, 25 | syl 17 | . . . . . . 7 ⊢ (𝐾 ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) |
| 27 | 24, 26 | eqtrid 2799 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → ((i↑4)↑(⌊‘(𝐾 / 4))) = 1) |
| 28 | 22, 27 | eqtrd 2787 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = 1) |
| 29 | 28 | oveq2d 7397 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / 1)) |
| 30 | expclz 14083 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝐾 ∈ ℤ) → (i↑𝐾) ∈ ℂ) | |
| 31 | 15, 16, 30 | mp3an12 1462 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑𝐾) ∈ ℂ) |
| 32 | 31 | div1d 11945 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / 1) = (i↑𝐾)) |
| 33 | 29, 32 | eqtrd 2787 | . . 3 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 34 | 19, 33 | eqtrd 2787 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 35 | 7, 34 | eqtrd 2787 | 1 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ‘cfv 6506 (class class class)co 7381 ℂcc 11057 ℝcr 11058 0cc0 11059 1c1 11060 ici 11061 · cmul 11064 − cmin 11400 / cdiv 11830 ℕcn 12196 4c4 12260 ℤcz 12554 ℝ+crp 12979 ⌊cfl 13786 mod cmo 13865 ↑cexp 14060 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-sup 9374 df-inf 9375 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-div 11831 df-nn 12197 df-2 12266 df-3 12267 df-4 12268 df-n0 12468 df-z 12555 df-uz 12826 df-rp 12980 df-fl 13788 df-mod 13866 df-seq 14001 df-exp 14061 |
| This theorem is referenced by: iblitg 25799 |
| Copyright terms: Public domain | W3C validator |