| 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 14247. (Contributed by Mario Carneiro, 7-Jul-2014.) |
| Ref | Expression |
|---|---|
| iexpcyc | ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 12601 | . . . 4 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
| 2 | 4re 12331 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 3 | 4pos 12357 | . . . . 5 ⊢ 0 < 4 | |
| 4 | 2, 3 | elrpii 13025 | . . . 4 ⊢ 4 ∈ ℝ+ |
| 5 | modval 13911 | . . . 4 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℝ+) → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) | |
| 6 | 1, 4, 5 | sylancl 597 | . . 3 ⊢ (𝐾 ∈ ℤ → (𝐾 mod 4) = (𝐾 − (4 · (⌊‘(𝐾 / 4))))) |
| 7 | 6 | oveq2d 7428 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4)))))) |
| 8 | 4z 12634 | . . . . 5 ⊢ 4 ∈ ℤ | |
| 9 | 4nn 12330 | . . . . . . 7 ⊢ 4 ∈ ℕ | |
| 10 | nndivre 12283 | . . . . . . 7 ⊢ ((𝐾 ∈ ℝ ∧ 4 ∈ ℕ) → (𝐾 / 4) ∈ ℝ) | |
| 11 | 1, 9, 10 | sylancl 597 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (𝐾 / 4) ∈ ℝ) |
| 12 | 11 | flcld 13838 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (⌊‘(𝐾 / 4)) ∈ ℤ) |
| 13 | zmulcl 12649 | . . . . 5 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) | |
| 14 | 8, 12, 13 | sylancr 598 | . . . 4 ⊢ (𝐾 ∈ ℤ → (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) |
| 15 | ax-icn 11165 | . . . . 5 ⊢ i ∈ ℂ | |
| 16 | ine0 11655 | . . . . 5 ⊢ i ≠ 0 | |
| 17 | expsub 14153 | . . . . 5 ⊢ (((i ∈ ℂ ∧ i ≠ 0) ∧ (𝐾 ∈ ℤ ∧ (4 · (⌊‘(𝐾 / 4))) ∈ ℤ)) → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) | |
| 18 | 15, 16, 17 | mpanl12 714 | . . . 4 ⊢ ((𝐾 ∈ ℤ ∧ (4 · (⌊‘(𝐾 / 4))) ∈ ℤ) → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) |
| 19 | 14, 18 | mpdan 699 | . . 3 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4)))))) |
| 20 | expmulz 14151 | . . . . . . . 8 ⊢ (((i ∈ ℂ ∧ i ≠ 0) ∧ (4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ)) → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) | |
| 21 | 15, 16, 20 | mpanl12 714 | . . . . . . 7 ⊢ ((4 ∈ ℤ ∧ (⌊‘(𝐾 / 4)) ∈ ℤ) → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) |
| 22 | 8, 12, 21 | sylancr 598 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = ((i↑4)↑(⌊‘(𝐾 / 4)))) |
| 23 | i4 14247 | . . . . . . . 8 ⊢ (i↑4) = 1 | |
| 24 | 23 | oveq1i 7422 | . . . . . . 7 ⊢ ((i↑4)↑(⌊‘(𝐾 / 4))) = (1↑(⌊‘(𝐾 / 4))) |
| 25 | 1exp 14134 | . . . . . . . 8 ⊢ ((⌊‘(𝐾 / 4)) ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) | |
| 26 | 12, 25 | syl 18 | . . . . . . 7 ⊢ (𝐾 ∈ ℤ → (1↑(⌊‘(𝐾 / 4))) = 1) |
| 27 | 24, 26 | eqtrid 2809 | . . . . . 6 ⊢ (𝐾 ∈ ℤ → ((i↑4)↑(⌊‘(𝐾 / 4))) = 1) |
| 28 | 22, 27 | eqtrd 2797 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑(4 · (⌊‘(𝐾 / 4)))) = 1) |
| 29 | 28 | oveq2d 7428 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = ((i↑𝐾) / 1)) |
| 30 | expclz 14127 | . . . . . 6 ⊢ ((i ∈ ℂ ∧ i ≠ 0 ∧ 𝐾 ∈ ℤ) → (i↑𝐾) ∈ ℂ) | |
| 31 | 15, 16, 30 | mp3an12 1479 | . . . . 5 ⊢ (𝐾 ∈ ℤ → (i↑𝐾) ∈ ℂ) |
| 32 | 31 | div1d 11989 | . . . 4 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / 1) = (i↑𝐾)) |
| 33 | 29, 32 | eqtrd 2797 | . . 3 ⊢ (𝐾 ∈ ℤ → ((i↑𝐾) / (i↑(4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 34 | 19, 33 | eqtrd 2797 | . 2 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 − (4 · (⌊‘(𝐾 / 4))))) = (i↑𝐾)) |
| 35 | 7, 34 | eqtrd 2797 | 1 ⊢ (𝐾 ∈ ℤ → (i↑(𝐾 mod 4)) = (i↑𝐾)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 ‘cfv 6536 (class class class)co 7412 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 ici 11108 · cmul 11111 − cmin 11447 / cdiv 11877 ℕcn 12239 4c4 12303 ℤcz 12597 ℝ+crp 13022 ⌊cfl 13830 mod cmo 13909 ↑cexp 14104 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9400 df-inf 9401 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-4 12311 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-fl 13832 df-mod 13910 df-seq 14045 df-exp 14105 |
| This theorem is used by: iblitg 25938 |
| Copyright terms: Public domain | W3C validator |