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 12867

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 11294	. 2 ⊢ (𝑁 ∈ ℕ₀ ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2		seqp1 12816	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
3		nnuz 11723	. . . . . . 7 ⊢ ℕ = (ℤ_≥‘1)
4	2, 3	eleq2s 2719	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
5	4	adantl 482	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
6		peano2nn 11032	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ)
7		fvconst2g 6467	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
8	6, 7	sylan2 491	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
9	8	oveq2d 6666	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
10	5, 9	eqtrd 2656	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
11		expnnval 12863	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
12	6, 11	sylan2 491	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
13		expnnval 12863	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁))
14	13	oveq1d 6665	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
15	10, 12, 14	3eqtr4d 2666	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
16		exp1 12866	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴)
17		mulid2 10038	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴)
18	16, 17	eqtr4d 2659	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴))
19	18	adantr 481	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴))
20		simpr 477	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0)
21	20	oveq1d 6665	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1))
22		0p1e1 11132	. . . . . 6 ⊢ (0 + 1) = 1
23	21, 22	syl6eq 2672	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1)
24	23	oveq2d 6666	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1))
25		oveq2 6658	. . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0))
26		exp0 12864	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1)
27	25, 26	sylan9eqr 2678	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1)
28	27	oveq1d 6665	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴))
29	19, 24, 28	3eqtr4d 2666	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
30	15, 29	jaodan 826	. 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
31	1, 30	sylan2b 492	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∨ wo 383 ∧ wa 384 = wceq 1483 ∈ wcel 1990 {csn 4177 × cxp 5112 ‘cfv 5888 (class class class)co 6650 ℂcc 9934 0cc0 9936 1c1 9937 + caddc 9939 · cmul 9941 ℕcn 11020 ℕ₀cn0 11292 ℤ_≥cuz 11687 seqcseq 12801 ↑cexp 12860

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-seq 12802 df-exp 12861

This theorem is referenced by: expcllem 12871 expm1t 12888 expeq0 12890 mulexp 12899 expadd 12902 expmul 12905 leexp2r 12918 leexp1a 12919 sqval 12922 cu2 12963 i3 12966 binom3 12985 bernneq 12990 modexp 12999 expp1d 13009 faclbnd 13077 faclbnd2 13078 faclbnd4lem1 13080 faclbnd6 13086 cjexp 13890 absexp 14044 binomlem 14561 climcndslem1 14581 climcndslem2 14582 geolim 14601 geo2sum 14604 efexp 14831 demoivreALT 14931 rpnnen2lem11 14953 pwp1fsum 15114 prmdvdsexp 15427 pcexp 15564 prmreclem6 15625 decexp2 15779 numexpp1 15782 cnfldexp 19779 expcn 22675 mbfi1fseqlem5 23486 dvexp 23716 aaliou3lem2 24098 tangtx 24257 cxpmul2 24435 mcubic 24574 cubic2 24575 binom4 24577 dquartlem2 24579 quart1lem 24582 quart1 24583 quartlem1 24584 log2cnv 24671 log2ublem2 24674 log2ub 24676 basellem3 24809 chtublem 24936 perfectlem1 24954 perfectlem2 24955 bclbnd 25005 bposlem8 25016 dchrisum0flblem1 25197 pntlemo 25296 qabvexp 25315 psgnfzto1st 29855 oddpwdc 30416 hgt750lem 30729 subfacval2 31169 sinccvglem 31566 heiborlem6 33615 bfplem1 33621 pwdif 41501 2exp7 41514 perfectALTVlem1 41630 perfectALTVlem2 41631 altgsumbcALT 42131

W3C validator