Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > absexp | Structured version Visualization version GIF version |
Description: Absolute value of positive integer exponentiation. (Contributed by NM, 5-Jan-2006.) |
Ref | Expression |
---|---|
absexp | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 7164 | . . . 4 ⊢ (𝑗 = 0 → (𝐴↑𝑗) = (𝐴↑0)) | |
2 | 1 | fveq2d 6674 | . . 3 ⊢ (𝑗 = 0 → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑0))) |
3 | oveq2 7164 | . . 3 ⊢ (𝑗 = 0 → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑0)) | |
4 | 2, 3 | eqeq12d 2837 | . 2 ⊢ (𝑗 = 0 → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑0)) = ((abs‘𝐴)↑0))) |
5 | oveq2 7164 | . . . 4 ⊢ (𝑗 = 𝑘 → (𝐴↑𝑗) = (𝐴↑𝑘)) | |
6 | 5 | fveq2d 6674 | . . 3 ⊢ (𝑗 = 𝑘 → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑𝑘))) |
7 | oveq2 7164 | . . 3 ⊢ (𝑗 = 𝑘 → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑𝑘)) | |
8 | 6, 7 | eqeq12d 2837 | . 2 ⊢ (𝑗 = 𝑘 → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘))) |
9 | oveq2 7164 | . . . 4 ⊢ (𝑗 = (𝑘 + 1) → (𝐴↑𝑗) = (𝐴↑(𝑘 + 1))) | |
10 | 9 | fveq2d 6674 | . . 3 ⊢ (𝑗 = (𝑘 + 1) → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑(𝑘 + 1)))) |
11 | oveq2 7164 | . . 3 ⊢ (𝑗 = (𝑘 + 1) → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑(𝑘 + 1))) | |
12 | 10, 11 | eqeq12d 2837 | . 2 ⊢ (𝑗 = (𝑘 + 1) → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1)))) |
13 | oveq2 7164 | . . . 4 ⊢ (𝑗 = 𝑁 → (𝐴↑𝑗) = (𝐴↑𝑁)) | |
14 | 13 | fveq2d 6674 | . . 3 ⊢ (𝑗 = 𝑁 → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑𝑁))) |
15 | oveq2 7164 | . . 3 ⊢ (𝑗 = 𝑁 → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑𝑁)) | |
16 | 14, 15 | eqeq12d 2837 | . 2 ⊢ (𝑗 = 𝑁 → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁))) |
17 | abs1 14657 | . . 3 ⊢ (abs‘1) = 1 | |
18 | exp0 13434 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) | |
19 | 18 | fveq2d 6674 | . . 3 ⊢ (𝐴 ∈ ℂ → (abs‘(𝐴↑0)) = (abs‘1)) |
20 | abscl 14638 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (abs‘𝐴) ∈ ℝ) | |
21 | 20 | recnd 10669 | . . . 4 ⊢ (𝐴 ∈ ℂ → (abs‘𝐴) ∈ ℂ) |
22 | 21 | exp0d 13505 | . . 3 ⊢ (𝐴 ∈ ℂ → ((abs‘𝐴)↑0) = 1) |
23 | 17, 19, 22 | 3eqtr4a 2882 | . 2 ⊢ (𝐴 ∈ ℂ → (abs‘(𝐴↑0)) = ((abs‘𝐴)↑0)) |
24 | oveq1 7163 | . . . 4 ⊢ ((abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘) → ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴))) | |
25 | 24 | adantl 484 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴))) |
26 | expp1 13437 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴)) | |
27 | 26 | fveq2d 6674 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (abs‘(𝐴↑(𝑘 + 1))) = (abs‘((𝐴↑𝑘) · 𝐴))) |
28 | expcl 13448 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℂ) | |
29 | simpl 485 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → 𝐴 ∈ ℂ) | |
30 | absmul 14654 | . . . . . 6 ⊢ (((𝐴↑𝑘) ∈ ℂ ∧ 𝐴 ∈ ℂ) → (abs‘((𝐴↑𝑘) · 𝐴)) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴))) | |
31 | 28, 29, 30 | syl2anc 586 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (abs‘((𝐴↑𝑘) · 𝐴)) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴))) |
32 | 27, 31 | eqtrd 2856 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴))) |
33 | 32 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴))) |
34 | expp1 13437 | . . . . 5 ⊢ (((abs‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((abs‘𝐴)↑(𝑘 + 1)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴))) | |
35 | 21, 34 | sylan 582 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((abs‘𝐴)↑(𝑘 + 1)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴))) |
36 | 35 | adantr 483 | . . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → ((abs‘𝐴)↑(𝑘 + 1)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴))) |
37 | 25, 33, 36 | 3eqtr4d 2866 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1))) |
38 | 4, 8, 12, 16, 23, 37 | nn0indd 12080 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ‘cfv 6355 (class class class)co 7156 ℂcc 10535 0cc0 10537 1c1 10538 + caddc 10540 · cmul 10542 ℕ0cn0 11898 ↑cexp 13430 abscabs 14593 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-seq 13371 df-exp 13431 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 |
This theorem is referenced by: absexpz 14665 abssq 14666 sqabs 14667 absexpd 14812 expcnv 15219 eftabs 15429 efcllem 15431 efaddlem 15446 iblabsr 24430 iblmulc2 24431 abelthlem7 25026 efif1olem3 25128 efif1olem4 25129 logtayllem 25242 bndatandm 25507 ftalem1 25650 mule1 25725 iblmulc2nc 34972 |
Copyright terms: Public domain | W3C validator |