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 13437

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 11900	. 2 ⊢ (𝑁 ∈ ℕ₀ ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2		seqp1 13385	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
3		nnuz 12282	. . . . . . 7 ⊢ ℕ = (ℤ_≥‘1)
4	2, 3	eleq2s 2931	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
5	4	adantl 484	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
6		peano2nn 11650	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ)
7		fvconst2g 6964	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
8	6, 7	sylan2 594	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
9	8	oveq2d 7172	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
10	5, 9	eqtrd 2856	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
11		expnnval 13433	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
12	6, 11	sylan2 594	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
13		expnnval 13433	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁))
14	13	oveq1d 7171	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
15	10, 12, 14	3eqtr4d 2866	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
16		exp1 13436	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴)
17		mulid2 10640	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴)
18	16, 17	eqtr4d 2859	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴))
19	18	adantr 483	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴))
20		simpr 487	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0)
21	20	oveq1d 7171	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1))
22		0p1e1 11760	. . . . . 6 ⊢ (0 + 1) = 1
23	21, 22	syl6eq 2872	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1)
24	23	oveq2d 7172	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1))
25		oveq2 7164	. . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0))
26		exp0 13434	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1)
27	25, 26	sylan9eqr 2878	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1)
28	27	oveq1d 7171	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴))
29	19, 24, 28	3eqtr4d 2866	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
30	15, 29	jaodan 954	. 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
31	1, 30	sylan2b 595	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 ∨ wo 843 = wceq 1537 ∈ wcel 2114 {csn 4567 × cxp 5553 ‘cfv 6355 (class class class)co 7156 ℂcc 10535 0cc0 10537 1c1 10538 + caddc 10540 · cmul 10542 ℕcn 11638 ℕ₀cn0 11898 ℤ_≥cuz 12244 seqcseq 13370 ↑cexp 13430

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

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-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-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 df-uz 12245 df-seq 13371 df-exp 13431

This theorem is referenced by: expcllem 13441 expm1t 13458 expeq0 13460 mulexp 13469 expadd 13472 expmul 13475 sqval 13482 expp1d 13512 leexp2r 13539 leexp1a 13540 cu2 13564 i3 13567 binom3 13586 bernneq 13591 modexp 13600 faclbnd 13651 faclbnd2 13652 faclbnd4lem1 13654 faclbnd6 13660 cjexp 14509 absexp 14664 binomlem 15184 climcndslem1 15204 climcndslem2 15205 pwdif 15223 geolim 15226 geo2sum 15229 efexp 15454 demoivreALT 15554 rpnnen2lem11 15577 pwp1fsum 15742 prmdvdsexp 16059 pcexp 16196 prmreclem6 16257 decexp2 16411 numexpp1 16414 cnfldexp 20578 expcn 23480 mbfi1fseqlem5 24320 dvexp 24550 aaliou3lem2 24932 tangtx 25091 cxpmul2 25272 mcubic 25425 cubic2 25426 binom4 25428 dquartlem2 25430 quart1lem 25433 quart1 25434 quartlem1 25435 log2cnv 25522 log2ublem2 25525 log2ub 25527 basellem3 25660 chtublem 25787 perfectlem1 25805 perfectlem2 25806 bclbnd 25856 bposlem8 25867 dchrisum0flblem1 26084 pntlemo 26183 qabvexp 26202 psgnfzto1st 30747 oddpwdc 31612 hgt750lem 31922 subfacval2 32434 sinccvglem 32915 heiborlem6 35109 bfplem1 35115 2exp7 43811 perfectALTVlem1 43935 perfectALTVlem2 43936 altgsumbcALT 44450

W3C validator