cjexp - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > cjexp		Structured version Visualization version GIF version

Theorem cjexp 15150

Description: Complex conjugate of positive integer exponentiation. (Contributed by NM, 7-Jun-2006.)

**Assertion**
Ref	Expression
cjexp	⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (∗‘(𝐴↑𝑁)) = ((∗‘𝐴)↑𝑁))

Proof of Theorem cjexp Dummy variables 𝑗 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq2 7431	. . . 4 ⊢ (𝑗 = 0 → (𝐴↑𝑗) = (𝐴↑0))
2	1	fveq2d 6904	. . 3 ⊢ (𝑗 = 0 → (∗‘(𝐴↑𝑗)) = (∗‘(𝐴↑0)))
3		oveq2 7431	. . 3 ⊢ (𝑗 = 0 → ((∗‘𝐴)↑𝑗) = ((∗‘𝐴)↑0))
4	2, 3	eqeq12d 2741	. 2 ⊢ (𝑗 = 0 → ((∗‘(𝐴↑𝑗)) = ((∗‘𝐴)↑𝑗) ↔ (∗‘(𝐴↑0)) = ((∗‘𝐴)↑0)))
5		oveq2 7431	. . . 4 ⊢ (𝑗 = 𝑘 → (𝐴↑𝑗) = (𝐴↑𝑘))
6	5	fveq2d 6904	. . 3 ⊢ (𝑗 = 𝑘 → (∗‘(𝐴↑𝑗)) = (∗‘(𝐴↑𝑘)))
7		oveq2 7431	. . 3 ⊢ (𝑗 = 𝑘 → ((∗‘𝐴)↑𝑗) = ((∗‘𝐴)↑𝑘))
8	6, 7	eqeq12d 2741	. 2 ⊢ (𝑗 = 𝑘 → ((∗‘(𝐴↑𝑗)) = ((∗‘𝐴)↑𝑗) ↔ (∗‘(𝐴↑𝑘)) = ((∗‘𝐴)↑𝑘)))
9		oveq2 7431	. . . 4 ⊢ (𝑗 = (𝑘 + 1) → (𝐴↑𝑗) = (𝐴↑(𝑘 + 1)))
10	9	fveq2d 6904	. . 3 ⊢ (𝑗 = (𝑘 + 1) → (∗‘(𝐴↑𝑗)) = (∗‘(𝐴↑(𝑘 + 1))))
11		oveq2 7431	. . 3 ⊢ (𝑗 = (𝑘 + 1) → ((∗‘𝐴)↑𝑗) = ((∗‘𝐴)↑(𝑘 + 1)))
12	10, 11	eqeq12d 2741	. 2 ⊢ (𝑗 = (𝑘 + 1) → ((∗‘(𝐴↑𝑗)) = ((∗‘𝐴)↑𝑗) ↔ (∗‘(𝐴↑(𝑘 + 1))) = ((∗‘𝐴)↑(𝑘 + 1))))
13		oveq2 7431	. . . 4 ⊢ (𝑗 = 𝑁 → (𝐴↑𝑗) = (𝐴↑𝑁))
14	13	fveq2d 6904	. . 3 ⊢ (𝑗 = 𝑁 → (∗‘(𝐴↑𝑗)) = (∗‘(𝐴↑𝑁)))
15		oveq2 7431	. . 3 ⊢ (𝑗 = 𝑁 → ((∗‘𝐴)↑𝑗) = ((∗‘𝐴)↑𝑁))
16	14, 15	eqeq12d 2741	. 2 ⊢ (𝑗 = 𝑁 → ((∗‘(𝐴↑𝑗)) = ((∗‘𝐴)↑𝑗) ↔ (∗‘(𝐴↑𝑁)) = ((∗‘𝐴)↑𝑁)))
17		exp0 14080	. . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1)
18	17	fveq2d 6904	. . 3 ⊢ (𝐴 ∈ ℂ → (∗‘(𝐴↑0)) = (∗‘1))
19		cjcl 15105	. . . 4 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) ∈ ℂ)
20		exp0 14080	. . . . 5 ⊢ ((∗‘𝐴) ∈ ℂ → ((∗‘𝐴)↑0) = 1)
21		1re 11260	. . . . . 6 ⊢ 1 ∈ ℝ
22		cjre 15139	. . . . . 6 ⊢ (1 ∈ ℝ → (∗‘1) = 1)
23	21, 22	ax-mp 5	. . . . 5 ⊢ (∗‘1) = 1
24	20, 23	eqtr4di 2783	. . . 4 ⊢ ((∗‘𝐴) ∈ ℂ → ((∗‘𝐴)↑0) = (∗‘1))
25	19, 24	syl 17	. . 3 ⊢ (𝐴 ∈ ℂ → ((∗‘𝐴)↑0) = (∗‘1))
26	18, 25	eqtr4d 2768	. 2 ⊢ (𝐴 ∈ ℂ → (∗‘(𝐴↑0)) = ((∗‘𝐴)↑0))
27		expp1 14083	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴↑(𝑘 + 1)) = ((𝐴↑𝑘) · 𝐴))
28	27	fveq2d 6904	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (∗‘(𝐴↑(𝑘 + 1))) = (∗‘((𝐴↑𝑘) · 𝐴)))
29		expcl 14094	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴↑𝑘) ∈ ℂ)
30		simpl 481	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → 𝐴 ∈ ℂ)
31		cjmul 15142	. . . . . 6 ⊢ (((𝐴↑𝑘) ∈ ℂ ∧ 𝐴 ∈ ℂ) → (∗‘((𝐴↑𝑘) · 𝐴)) = ((∗‘(𝐴↑𝑘)) · (∗‘𝐴)))
32	29, 30, 31	syl2anc 582	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (∗‘((𝐴↑𝑘) · 𝐴)) = ((∗‘(𝐴↑𝑘)) · (∗‘𝐴)))
33	28, 32	eqtrd 2765	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (∗‘(𝐴↑(𝑘 + 1))) = ((∗‘(𝐴↑𝑘)) · (∗‘𝐴)))
34	33	adantr 479	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) ∧ (∗‘(𝐴↑𝑘)) = ((∗‘𝐴)↑𝑘)) → (∗‘(𝐴↑(𝑘 + 1))) = ((∗‘(𝐴↑𝑘)) · (∗‘𝐴)))
35		oveq1 7430	. . . 4 ⊢ ((∗‘(𝐴↑𝑘)) = ((∗‘𝐴)↑𝑘) → ((∗‘(𝐴↑𝑘)) · (∗‘𝐴)) = (((∗‘𝐴)↑𝑘) · (∗‘𝐴)))
36		expp1 14083	. . . . . 6 ⊢ (((∗‘𝐴) ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → ((∗‘𝐴)↑(𝑘 + 1)) = (((∗‘𝐴)↑𝑘) · (∗‘𝐴)))
37	19, 36	sylan 578	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → ((∗‘𝐴)↑(𝑘 + 1)) = (((∗‘𝐴)↑𝑘) · (∗‘𝐴)))
38	37	eqcomd 2731	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (((∗‘𝐴)↑𝑘) · (∗‘𝐴)) = ((∗‘𝐴)↑(𝑘 + 1)))
39	35, 38	sylan9eqr 2787	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) ∧ (∗‘(𝐴↑𝑘)) = ((∗‘𝐴)↑𝑘)) → ((∗‘(𝐴↑𝑘)) · (∗‘𝐴)) = ((∗‘𝐴)↑(𝑘 + 1)))
40	34, 39	eqtrd 2765	. 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) ∧ (∗‘(𝐴↑𝑘)) = ((∗‘𝐴)↑𝑘)) → (∗‘(𝐴↑(𝑘 + 1))) = ((∗‘𝐴)↑(𝑘 + 1)))
41	4, 8, 12, 16, 26, 40	nn0indd 12706	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (∗‘(𝐴↑𝑁)) = ((∗‘𝐴)↑𝑁))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ‘cfv 6553 (class class class)co 7423 ℂcc 11152 ℝcr 11153 0cc0 11154 1c1 11155 + caddc 11157 · cmul 11159 ℕ₀cn0 12519 ↑cexp 14076 ∗ccj 15096

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5303 ax-nul 5310 ax-pow 5368 ax-pr 5432 ax-un 7745 ax-cnex 11210 ax-resscn 11211 ax-1cn 11212 ax-icn 11213 ax-addcl 11214 ax-addrcl 11215 ax-mulcl 11216 ax-mulrcl 11217 ax-mulcom 11218 ax-addass 11219 ax-mulass 11220 ax-distr 11221 ax-i2m1 11222 ax-1ne0 11223 ax-1rid 11224 ax-rnegex 11225 ax-rrecex 11226 ax-cnre 11227 ax-pre-lttri 11228 ax-pre-lttrn 11229 ax-pre-ltadd 11230 ax-pre-mulgt0 11231

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3363 df-reu 3364 df-rab 3419 df-v 3463 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-pss 3966 df-nul 4325 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5579 df-eprel 5585 df-po 5593 df-so 5594 df-fr 5636 df-we 5638 df-xp 5687 df-rel 5688 df-cnv 5689 df-co 5690 df-dm 5691 df-rn 5692 df-res 5693 df-ima 5694 df-pred 6311 df-ord 6378 df-on 6379 df-lim 6380 df-suc 6381 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7379 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7876 df-2nd 8003 df-frecs 8295 df-wrecs 8326 df-recs 8400 df-rdg 8439 df-er 8733 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11296 df-mnf 11297 df-xr 11298 df-ltxr 11299 df-le 11300 df-sub 11492 df-neg 11493 df-div 11918 df-nn 12260 df-2 12322 df-n0 12520 df-z 12606 df-uz 12870 df-seq 14017 df-exp 14077 df-cj 15099 df-re 15100 df-im 15101

This theorem is referenced by: cjexpd 15213 efcj 16089 plycjlem 26296 plyrecj 26299 atandmcj 26929

W3C validator

	
		OSZAR »