expp1 - Metamath Proof Explorer

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

Theorem expp1 13432

Description: Value of a complex number raised to a nonnegative integer power plus one. Part of Definition 10-4.1 of [Gleason] p. 134. (Contributed by NM, 20-May-2005.) (Revised by Mario Carneiro, 2-Jul-2013.)

**Assertion**
Ref	Expression
expp1	⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))

**Proof of Theorem expp1**
Step	Hyp	Ref	Expression
1		elnn0 11887	. 2 ⊢ (𝑁 ∈ ℕ₀ ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2		seqp1 13379	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
3		nnuz 12269	. . . . . . 7 ⊢ ℕ = (ℤ_≥‘1)
4	2, 3	eleq2s 2908	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
5	4	adantl 485	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
6		peano2nn 11637	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ)
7		fvconst2g 6941	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
8	6, 7	sylan2 595	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
9	8	oveq2d 7151	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
10	5, 9	eqtrd 2833	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
11		expnnval 13428	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
12	6, 11	sylan2 595	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
13		expnnval 13428	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁))
14	13	oveq1d 7150	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
15	10, 12, 14	3eqtr4d 2843	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
16		exp1 13431	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴)
17		mulid2 10629	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴)
18	16, 17	eqtr4d 2836	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴))
19	18	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴))
20		simpr 488	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0)
21	20	oveq1d 7150	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1))
22		0p1e1 11747	. . . . . 6 ⊢ (0 + 1) = 1
23	21, 22	eqtrdi 2849	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1)
24	23	oveq2d 7151	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1))
25		oveq2 7143	. . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0))
26		exp0 13429	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1)
27	25, 26	sylan9eqr 2855	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1)
28	27	oveq1d 7150	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴))
29	19, 24, 28	3eqtr4d 2843	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
30	15, 29	jaodan 955	. 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
31	1, 30	sylan2b 596	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 {csn 4525 × cxp 5517 ‘cfv 6324 (class class class)co 7135 ℂcc 10524 0cc0 10526 1c1 10527 + caddc 10529 · cmul 10531 ℕcn 11625 ℕ₀cn0 11885 ℤ_≥cuz 12231 seqcseq 13364 ↑cexp 13425

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-seq 13365 df-exp 13426

This theorem is referenced by: expcllem 13436 expm1t 13453 expeq0 13455 mulexp 13464 expadd 13467 expmul 13470 sqval 13477 expp1d 13507 leexp2r 13534 leexp1a 13535 cu2 13559 i3 13562 binom3 13581 bernneq 13586 modexp 13595 faclbnd 13646 faclbnd2 13647 faclbnd4lem1 13649 faclbnd6 13655 cjexp 14501 absexp 14656 binomlem 15176 climcndslem1 15196 climcndslem2 15197 pwdif 15215 geolim 15218 geo2sum 15221 efexp 15446 demoivreALT 15546 rpnnen2lem11 15569 pwp1fsum 15732 prmdvdsexp 16049 pcexp 16186 prmreclem6 16247 decexp2 16401 numexpp1 16404 2exp7 16414 cnfldexp 20124 expcn 23477 mbfi1fseqlem5 24323 dvexp 24556 aaliou3lem2 24939 tangtx 25098 cxpmul2 25280 mcubic 25433 cubic2 25434 binom4 25436 dquartlem2 25438 quart1lem 25441 quart1 25442 quartlem1 25443 log2cnv 25530 log2ublem2 25533 log2ub 25535 basellem3 25668 chtublem 25795 perfectlem1 25813 perfectlem2 25814 bclbnd 25864 bposlem8 25875 dchrisum0flblem1 26092 pntlemo 26191 qabvexp 26210 psgnfzto1st 30797 oddpwdc 31722 hgt750lem 32032 subfacval2 32547 sinccvglem 33028 heiborlem6 35254 bfplem1 35260 perfectALTVlem1 44239 perfectALTVlem2 44240 altgsumbcALT 44755

W3C validator