Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > expp1 | GIF version |
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.) |
Ref | Expression |
---|---|
expp1 | ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0 9116 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
2 | simpr 109 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
3 | elnnuz 9502 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ≥‘1)) | |
4 | 2, 3 | sylib 121 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ (ℤ≥‘1)) |
5 | simpll 519 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (ℤ≥‘1)) → 𝐴 ∈ ℂ) | |
6 | elnnuz 9502 | . . . . . . . . 9 ⊢ (𝑥 ∈ ℕ ↔ 𝑥 ∈ (ℤ≥‘1)) | |
7 | fvconst2g 5699 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℕ) → ((ℕ × {𝐴})‘𝑥) = 𝐴) | |
8 | 7 | eleq1d 2235 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ ℕ) → (((ℕ × {𝐴})‘𝑥) ∈ ℂ ↔ 𝐴 ∈ ℂ)) |
9 | 6, 8 | sylan2br 286 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℂ ∧ 𝑥 ∈ (ℤ≥‘1)) → (((ℕ × {𝐴})‘𝑥) ∈ ℂ ↔ 𝐴 ∈ ℂ)) |
10 | 9 | adantlr 469 | . . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (ℤ≥‘1)) → (((ℕ × {𝐴})‘𝑥) ∈ ℂ ↔ 𝐴 ∈ ℂ)) |
11 | 5, 10 | mpbird 166 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ 𝑥 ∈ (ℤ≥‘1)) → ((ℕ × {𝐴})‘𝑥) ∈ ℂ) |
12 | mulcl 7880 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) ∈ ℂ) | |
13 | 12 | adantl 275 | . . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) ∈ ℂ) |
14 | 4, 11, 13 | seq3p1 10397 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1)))) |
15 | peano2nn 8869 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → (𝑁 + 1) ∈ ℕ) | |
16 | fvconst2g 5699 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴) | |
17 | 15, 16 | sylan2 284 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((ℕ × {𝐴})‘(𝑁 + 1)) = 𝐴) |
18 | 17 | oveq2d 5858 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((seq1( · , (ℕ × {𝐴}))‘𝑁) · ((ℕ × {𝐴})‘(𝑁 + 1))) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
19 | 14, 18 | eqtrd 2198 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1)) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
20 | expnnval 10458 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1))) | |
21 | 15, 20 | sylan2 284 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = (seq1( · , (ℕ × {𝐴}))‘(𝑁 + 1))) |
22 | expnnval 10458 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑𝑁) = (seq1( · , (ℕ × {𝐴}))‘𝑁)) | |
23 | 22 | oveq1d 5857 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → ((𝐴↑𝑁) · 𝐴) = ((seq1( · , (ℕ × {𝐴}))‘𝑁) · 𝐴)) |
24 | 19, 21, 23 | 3eqtr4d 2208 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
25 | exp1 10461 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = 𝐴) | |
26 | mulid2 7897 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) | |
27 | 25, 26 | eqtr4d 2201 | . . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑1) = (1 · 𝐴)) |
28 | 27 | adantr 274 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑1) = (1 · 𝐴)) |
29 | simpr 109 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → 𝑁 = 0) | |
30 | 29 | oveq1d 5857 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = (0 + 1)) |
31 | 0p1e1 8971 | . . . . . 6 ⊢ (0 + 1) = 1 | |
32 | 30, 31 | eqtrdi 2215 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝑁 + 1) = 1) |
33 | 32 | oveq2d 5858 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = (𝐴↑1)) |
34 | oveq2 5850 | . . . . . 6 ⊢ (𝑁 = 0 → (𝐴↑𝑁) = (𝐴↑0)) | |
35 | exp0 10459 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑0) = 1) | |
36 | 34, 35 | sylan9eqr 2221 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑𝑁) = 1) |
37 | 36 | oveq1d 5857 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → ((𝐴↑𝑁) · 𝐴) = (1 · 𝐴)) |
38 | 28, 33, 37 | 3eqtr4d 2208 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 = 0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
39 | 24, 38 | jaodan 787 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
40 | 1, 39 | sylan2b 285 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴↑(𝑁 + 1)) = ((𝐴↑𝑁) · 𝐴)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 698 = wceq 1343 ∈ wcel 2136 {csn 3576 × cxp 4602 ‘cfv 5188 (class class class)co 5842 ℂcc 7751 0cc0 7753 1c1 7754 + caddc 7756 · cmul 7758 ℕcn 8857 ℕ0cn0 9114 ℤ≥cuz 9466 seqcseq 10380 ↑cexp 10454 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-coll 4097 ax-sep 4100 ax-nul 4108 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 ax-iinf 4565 ax-cnex 7844 ax-resscn 7845 ax-1cn 7846 ax-1re 7847 ax-icn 7848 ax-addcl 7849 ax-addrcl 7850 ax-mulcl 7851 ax-mulrcl 7852 ax-addcom 7853 ax-mulcom 7854 ax-addass 7855 ax-mulass 7856 ax-distr 7857 ax-i2m1 7858 ax-0lt1 7859 ax-1rid 7860 ax-0id 7861 ax-rnegex 7862 ax-precex 7863 ax-cnre 7864 ax-pre-ltirr 7865 ax-pre-ltwlin 7866 ax-pre-lttrn 7867 ax-pre-apti 7868 ax-pre-ltadd 7869 ax-pre-mulgt0 7870 ax-pre-mulext 7871 |
This theorem depends on definitions: df-bi 116 df-dc 825 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-nel 2432 df-ral 2449 df-rex 2450 df-reu 2451 df-rmo 2452 df-rab 2453 df-v 2728 df-sbc 2952 df-csb 3046 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-nul 3410 df-if 3521 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-int 3825 df-iun 3868 df-br 3983 df-opab 4044 df-mpt 4045 df-tr 4081 df-id 4271 df-po 4274 df-iso 4275 df-iord 4344 df-on 4346 df-ilim 4347 df-suc 4349 df-iom 4568 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-f1 5193 df-fo 5194 df-f1o 5195 df-fv 5196 df-riota 5798 df-ov 5845 df-oprab 5846 df-mpo 5847 df-1st 6108 df-2nd 6109 df-recs 6273 df-frec 6359 df-pnf 7935 df-mnf 7936 df-xr 7937 df-ltxr 7938 df-le 7939 df-sub 8071 df-neg 8072 df-reap 8473 df-ap 8480 df-div 8569 df-inn 8858 df-n0 9115 df-z 9192 df-uz 9467 df-seqfrec 10381 df-exp 10455 |
This theorem is referenced by: expcllem 10466 expm1t 10483 expap0 10485 mulexp 10494 expadd 10497 expmul 10500 leexp2r 10509 leexp1a 10510 sqval 10513 cu2 10553 i3 10556 binom3 10572 bernneq 10575 modqexp 10581 expp1d 10589 faclbnd 10654 faclbnd2 10655 faclbnd6 10657 cjexp 10835 absexp 11021 binomlem 11424 geolim 11452 geo2sum 11455 efexp 11623 demoivreALT 11714 prmdvdsexp 12080 oddpwdclemodd 12104 pcexp 12241 expcncf 13242 dvexp 13325 tangtx 13409 binom4 13547 |
Copyright terms: Public domain | W3C validator |