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 13439

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 11902	. 2 ⊢ (𝑁 ∈ ℕ₀ ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0))
2		seqp1 13387	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
3		nnuz 12284	. . . . . . 7 ⊢ ℕ = (ℤ_≥‘1)
4	2, 3	eleq2s 2934	. . . . . 6 ⊢ (𝑁 ∈ ℕ → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
5	4	adantl 484	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))))
6		peano2nn 11653	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ)
7		fvconst2g 6967	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
8	6, 7	sylan2 594	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴)
9	8	oveq2d 7175	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
10	5, 9	eqtrd 2859	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
11		expnnval 13435	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
12	6, 11	sylan2 594	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)))
13		expnnval 13435	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁))
14	13	oveq1d 7174	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴))
15	10, 12, 14	3eqtr4d 2869	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴))
16		exp1 13438	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴)
17		mulid2 10643	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴)
18	16, 17	eqtr4d 2862	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴))
19	18	adantr 483	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴))
20		simpr 487	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0)
21	20	oveq1d 7174	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1))
22		0p1e1 11762	. . . . . 6 ⊢ (0 + 1) = 1
23	21, 22	syl6eq 2875	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1)
24	23	oveq2d 7175	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1))
25		oveq2 7167	. . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0))
26		exp0 13436	. . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1)
27	25, 26	sylan9eqr 2881	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1)
28	27	oveq1d 7174	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴))
29	19, 24, 28	3eqtr4d 2869	. . 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 1536 ∈ wcel 2113 {csn 4570 × cxp 5556 ‘cfv 6358 (class class class)co 7159 ℂcc 10538 0cc0 10540 1c1 10541 + caddc 10543 · cmul 10545 ℕcn 11641 ℕ₀cn0 11900 ℤ_≥cuz 12246 seqcseq 13372 ↑cexp 13432

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-n0 11901 df-z 11985 df-uz 12247 df-seq 13373 df-exp 13433

This theorem is referenced by: expcllem 13443 expm1t 13460 expeq0 13462 mulexp 13471 expadd 13474 expmul 13477 sqval 13484 expp1d 13514 leexp2r 13541 leexp1a 13542 cu2 13566 i3 13569 binom3 13588 bernneq 13593 modexp 13602 faclbnd 13653 faclbnd2 13654 faclbnd4lem1 13656 faclbnd6 13662 cjexp 14512 absexp 14667 binomlem 15187 climcndslem1 15207 climcndslem2 15208 pwdif 15226 geolim 15229 geo2sum 15232 efexp 15457 demoivreALT 15557 rpnnen2lem11 15580 pwp1fsum 15745 prmdvdsexp 16062 pcexp 16199 prmreclem6 16260 decexp2 16414 numexpp1 16417 cnfldexp 20581 expcn 23483 mbfi1fseqlem5 24323 dvexp 24553 aaliou3lem2 24935 tangtx 25094 cxpmul2 25275 mcubic 25428 cubic2 25429 binom4 25431 dquartlem2 25433 quart1lem 25436 quart1 25437 quartlem1 25438 log2cnv 25525 log2ublem2 25528 log2ub 25530 basellem3 25663 chtublem 25790 perfectlem1 25808 perfectlem2 25809 bclbnd 25859 bposlem8 25870 dchrisum0flblem1 26087 pntlemo 26186 qabvexp 26205 psgnfzto1st 30751 oddpwdc 31616 hgt750lem 31926 subfacval2 32438 sinccvglem 32919 heiborlem6 35098 bfplem1 35104 2exp7 43769 perfectALTVlem1 43893 perfectALTVlem2 43894 altgsumbcALT 44408

W3C validator