| 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 14117. (Contributed by Mario Carneiro, 7-Jul-2014.) |
| Ref | Expression |
|---|---|
| iexpcyc | ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 12478 | . . . 4 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 2 | 4re 12215 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 3 | 4pos 12238 | . . . . 5 ⊢ 0 < 4 | |
| 4 | 2, 3 | elrpii 12899 | . . . 4 ⊢ 4 ∈ ℝ+ |
| 5 | modval 13781 | . . . 4 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℝ+) → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) | |
| 6 | 1, 4, 5 | sylancl 586 | . . 3 ⊢ (𝐾 ∈ ℤ → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) |
| 7 | 6 | oveq2d 7368 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4)))))) |
| 8 | 4z 12512 | . . . . 5 ⊢ 4 ∈ ℤ | |
| 9 | 4nn 12214 | . . . . . . 7 ⊢ 4 ∈ ℕ | |
| 10 | nndivre 12172 | . . . . . . 7 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℕ) → (𝐾 / 4) ∈ ℝ) | |
| 11 | 1, 9, 10 | sylancl 586 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 / 4) ∈ ℝ) |
| 12 | 11 | flcld 13708 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (⌊‘(𝐾 / 4)) ∈ ℤ) |
| 13 | zmulcl 12527 | . . . . 5 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) | |
| 14 | 8, 12, 13 | sylancr 587 | . . . 4 ⊢ (𝐾 ∈ ℤ → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) |
| 15 | ax-icn 11071 | . . . . 5 ⊢ i ∈ ℂ | |
| 16 | ine0 11558 | . . . . 5 ⊢ i ≠ 0 | |
| 17 | expsub 14023 | . . . . 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 14021 | . . . . . . . 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 14117 | . . . . . . . 8 ⊢ (i↑4) = 1 | |
| 24 | 23 | oveq1i 7362 | . . . . . . 7 ⊢ ((i↑4)↑(⌊‘(𝐾 / 4))) = (1↑(⌊‘(𝐾 / 4))) |
| 25 | 1exp 14004 | . . . . . . . 8 ⊢ ((⌊‘(𝐾 / 4)) ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) | |
| 26 | 12, 25 | syl 17 | . . . . . . 7 ⊢ (𝐾 ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) |
| 27 | 24, 26 | eqtrid 2778 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → ((i↑4)↑(⌊‘(𝐾 / 4))) = 1) |
| 28 | 22, 27 | eqtrd 2766 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = 1) |
| 29 | 28 | oveq2d 7368 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / 1)) |
| 30 | expclz 13997 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝐾 ∈ ℤ) → (i↑𝐾) ∈ ℂ) | |
| 31 | 15, 16, 30 | mp3an12 1453 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑𝐾) ∈ ℂ) |
| 32 | 31 | div1d 11895 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / 1) = (i↑𝐾)) |
| 33 | 29, 32 | eqtrd 2766 | . . 3 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 34 | 19, 33 | eqtrd 2766 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 35 | 7, 34 | eqtrd 2766 | 1 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ‘cfv 6487 (class class class)co 7352 ℂcc 11010 ℝcr 11011 0cc0 11012 1c1 11013 ici 11014 · cmul 11017 − cmin 11350 / cdiv 11780 ℕcn 12131 4c4 12188 ℤcz 12474 ℝ+crp 12896 ⌊cfl 13700 mod cmo 13779 ↑cexp 13974 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11068 ax-resscn 11069 ax-1cn 11070 ax-icn 11071 ax-addcl 11072 ax-addrcl 11073 ax-mulcl 11074 ax-mulrcl 11075 ax-mulcom 11076 ax-addass 11077 ax-mulass 11078 ax-distr 11079 ax-i2m1 11080 ax-1ne0 11081 ax-1rid 11082 ax-rnegex 11083 ax-rrecex 11084 ax-cnre 11085 ax-pre-lttri 11086 ax-pre-lttrn 11087 ax-pre-ltadd 11088 ax-pre-mulgt0 11089 ax-pre-sup 11090 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-sup 9332 df-inf 9333 df-pnf 11154 df-mnf 11155 df-xr 11156 df-ltxr 11157 df-le 11158 df-sub 11352 df-neg 11353 df-div 11781 df-nn 12132 df-2 12194 df-3 12195 df-4 12196 df-n0 12388 df-z 12475 df-uz 12739 df-rp 12897 df-fl 13702 df-mod 13780 df-seq 13915 df-exp 13975 |
| This theorem is referenced by: iblitg 25702 |
| Copyright terms: Public domain | W3C validator |