Theorem absexp 11505

Description: Absolute value of positive integer exponentiation. (Contributed by NM, 5-Jan-2006.)

Assertion

Ref	Expression
absexp	⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁))

Proof of Theorem absexp

Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 5975	. . . . . 6 ⊢ (𝑗 = 0 → (𝐴↑𝑗) = (𝐴↑0))
2	1	fveq2d 5603	. . . . 5 ⊢ (𝑗 = 0 → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑0)))
3		oveq2 5975	. . . . 5 ⊢ (𝑗 = 0 → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑0))
4	2, 3	eqeq12d 2222	. . . 4 ⊢ (𝑗 = 0 → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑0)) = ((abs‘𝐴)↑0)))
5	4	imbi2d 230	. . 3 ⊢ (𝑗 = 0 → ((𝐴 ∈ ℂ → (abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗)) ↔ (𝐴 ∈ ℂ → (abs‘(𝐴↑0)) = ((abs‘𝐴)↑0))))
6		oveq2 5975	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝐴↑𝑗) = (𝐴↑𝑘))
7	6	fveq2d 5603	. . . . 5 ⊢ (𝑗 = 𝑘 → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑𝑘)))
8		oveq2 5975	. . . . 5 ⊢ (𝑗 = 𝑘 → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑𝑘))
9	7, 8	eqeq12d 2222	. . . 4 ⊢ (𝑗 = 𝑘 → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)))
10	9	imbi2d 230	. . 3 ⊢ (𝑗 = 𝑘 → ((𝐴 ∈ ℂ → (abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗)) ↔ (𝐴 ∈ ℂ → (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘))))
11		oveq2 5975	. . . . . 6 ⊢ (𝑗 = (𝑘 + 1) → (𝐴↑𝑗) = (𝐴↑(𝑘 + 1)))
12	11	fveq2d 5603	. . . . 5 ⊢ (𝑗 = (𝑘 + 1) → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑(𝑘 + 1))))
13		oveq2 5975	. . . . 5 ⊢ (𝑗 = (𝑘 + 1) → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑(𝑘 + 1)))
14	12, 13	eqeq12d 2222	. . . 4 ⊢ (𝑗 = (𝑘 + 1) → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1))))
15	14	imbi2d 230	. . 3 ⊢ (𝑗 = (𝑘 + 1) → ((𝐴 ∈ ℂ → (abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗)) ↔ (𝐴 ∈ ℂ → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1)))))
16		oveq2 5975	. . . . . 6 ⊢ (𝑗 = 𝑁 → (𝐴↑𝑗) = (𝐴↑𝑁))
17	16	fveq2d 5603	. . . . 5 ⊢ (𝑗 = 𝑁 → (abs‘(𝐴↑𝑗)) = (abs‘(𝐴↑𝑁)))
18		oveq2 5975	. . . . 5 ⊢ (𝑗 = 𝑁 → ((abs‘𝐴)↑𝑗) = ((abs‘𝐴)↑𝑁))
19	17, 18	eqeq12d 2222	. . . 4 ⊢ (𝑗 = 𝑁 → ((abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗) ↔ (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁)))
20	19	imbi2d 230	. . 3 ⊢ (𝑗 = 𝑁 → ((𝐴 ∈ ℂ → (abs‘(𝐴↑𝑗)) = ((abs‘𝐴)↑𝑗)) ↔ (𝐴 ∈ ℂ → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁))))
21		abs1 11498	. . . 4 ⊢ (abs‘1) = 1
22		exp0 10725	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1)
23	22	fveq2d 5603	. . . 4 ⊢ (𝐴 ∈ ℂ → (abs‘(𝐴↑0)) = (abs‘1))
24		abscl 11477	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (abs‘𝐴) ∈ ℝ)
25	24	recnd 8136	. . . . 5 ⊢ (𝐴 ∈ ℂ → (abs‘𝐴) ∈ ℂ)
26	25	exp0d 10849	. . . 4 ⊢ (𝐴 ∈ ℂ → ((abs‘𝐴)↑0) = 1)
27	21, 23, 26	3eqtr4a 2266	. . 3 ⊢ (𝐴 ∈ ℂ → (abs‘(𝐴↑0)) = ((abs‘𝐴)↑0))
28		oveq1 5974	. . . . . . . 8 ⊢ ((abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘) → ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴)))
29	28	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴)))
30		expp1 10728	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴))
31	30	fveq2d 5603	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (abs‘(𝐴↑(𝑘 + 1))) = (abs‘((𝐴↑𝑘) · 𝐴)))
32		expcl 10739	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (𝐴↑𝑘) ∈ ℂ)
33		simpl 109	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → 𝐴 ∈ ℂ)
34		absmul 11495	. . . . . . . . . 10 ⊢ (((𝐴↑𝑘) ∈ ℂ ∧ 𝐴 ∈ ℂ) → (abs‘((𝐴↑𝑘) · 𝐴)) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)))
35	32, 33, 34	syl2anc 411	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (abs‘((𝐴↑𝑘) · 𝐴)) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)))
36	31, 35	eqtrd 2240	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)))
37	36	adantr 276	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘(𝐴↑𝑘)) · (abs‘𝐴)))
38		expp1 10728	. . . . . . . . 9 ⊢ (((abs‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((abs‘𝐴)↑(𝑘 + 1)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴)))
39	25, 38	sylan 283	. . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) → ((abs‘𝐴)↑(𝑘 + 1)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴)))
40	39	adantr 276	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → ((abs‘𝐴)↑(𝑘 + 1)) = (((abs‘𝐴)↑𝑘) · (abs‘𝐴)))
41	29, 37, 40	3eqtr4d 2250	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ0) ∧ (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1)))
42	41	exp31 364	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝑘 ∈ ℕ0 → ((abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1)))))
43	42	com12 30	. . . 4 ⊢ (𝑘 ∈ ℕ0 → (𝐴 ∈ ℂ → ((abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘) → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1)))))
44	43	a2d 26	. . 3 ⊢ (𝑘 ∈ ℕ0 → ((𝐴 ∈ ℂ → (abs‘(𝐴↑𝑘)) = ((abs‘𝐴)↑𝑘)) → (𝐴 ∈ ℂ → (abs‘(𝐴↑(𝑘 + 1))) = ((abs‘𝐴)↑(𝑘 + 1)))))
45	5, 10, 15, 20, 27, 44	nn0ind 9522	. 2 ⊢ (𝑁 ∈ ℕ0 → (𝐴 ∈ ℂ → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁)))
46	45	impcom 125	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (abs‘(𝐴↑𝑁)) = ((abs‘𝐴)↑𝑁))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1373   ∈ wcel 2178  ‘cfv 5290  (class class class)co 5967  ℂcc 7958  0cc0 7960  1c1 7961   + caddc 7963   · cmul 7965  ℕ₀cn0 9330  ↑cexp 10720  abscabs 11423

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078  ax-arch 8079  ax-caucvg 8080

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-if 3580  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-po 4361  df-iso 4362  df-iord 4431  df-on 4433  df-ilim 4434  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-frec 6500  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-inn 9072  df-2 9130  df-3 9131  df-4 9132  df-n0 9331  df-z 9408  df-uz 9684  df-rp 9811  df-seqfrec 10630  df-exp 10721  df-cj 11268  df-re 11269  df-im 11270  df-rsqrt 11424  df-abs 11425

This theorem is referenced by:  absexpzap  11506  abssq  11507  sqabs  11508  absexpd  11618  expcnvap0  11928  expcnv  11930  eftabs  12082  efaddlem  12100