| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dvexp2 | GIF version | ||
| Description: Derivative of an exponential, possibly zero power. (Contributed by Stefan O'Rear, 13-Nov-2014.) (Revised by Mario Carneiro, 10-Feb-2015.) |
| Ref | Expression |
|---|---|
| dvexp2 | ⊢ (𝑁 ∈ ℕ0 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn0 9382 | . 2 ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℕ ∨ 𝑁 = 0)) | |
| 2 | dvexp 15400 | . . . 4 ⊢ (𝑁 ∈ ℕ → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ (𝑁 · (𝑥↑(𝑁 − 1))))) | |
| 3 | nnne0 9149 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → 𝑁 ≠ 0) | |
| 4 | 3 | neneqd 2421 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → ¬ 𝑁 = 0) |
| 5 | 4 | iffalsed 3612 | . . . . 5 ⊢ (𝑁 ∈ ℕ → if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))) = (𝑁 · (𝑥↑(𝑁 − 1)))) |
| 6 | 5 | mpteq2dv 4175 | . . . 4 ⊢ (𝑁 ∈ ℕ → (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1))))) = (𝑥 ∈ ℂ ↦ (𝑁 · (𝑥↑(𝑁 − 1))))) |
| 7 | 2, 6 | eqtr4d 2265 | . . 3 ⊢ (𝑁 ∈ ℕ → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))))) |
| 8 | oveq2 6015 | . . . . . . . . . 10 ⊢ (𝑁 = 0 → (𝑥↑𝑁) = (𝑥↑0)) | |
| 9 | exp0 10777 | . . . . . . . . . 10 ⊢ (𝑥 ∈ ℂ → (𝑥↑0) = 1) | |
| 10 | 8, 9 | sylan9eq 2282 | . . . . . . . . 9 ⊢ ((𝑁 = 0 ∧ 𝑥 ∈ ℂ) → (𝑥↑𝑁) = 1) |
| 11 | 10 | mpteq2dva 4174 | . . . . . . . 8 ⊢ (𝑁 = 0 → (𝑥 ∈ ℂ ↦ (𝑥↑𝑁)) = (𝑥 ∈ ℂ ↦ 1)) |
| 12 | fconstmpt 4766 | . . . . . . . 8 ⊢ (ℂ × {1}) = (𝑥 ∈ ℂ ↦ 1) | |
| 13 | 11, 12 | eqtr4di 2280 | . . . . . . 7 ⊢ (𝑁 = 0 → (𝑥 ∈ ℂ ↦ (𝑥↑𝑁)) = (ℂ × {1})) |
| 14 | 13 | oveq2d 6023 | . . . . . 6 ⊢ (𝑁 = 0 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (ℂ D (ℂ × {1}))) |
| 15 | ax-1cn 8103 | . . . . . . 7 ⊢ 1 ∈ ℂ | |
| 16 | dvconst 15383 | . . . . . . 7 ⊢ (1 ∈ ℂ → (ℂ D (ℂ × {1})) = (ℂ × {0})) | |
| 17 | 15, 16 | ax-mp 5 | . . . . . 6 ⊢ (ℂ D (ℂ × {1})) = (ℂ × {0}) |
| 18 | 14, 17 | eqtrdi 2278 | . . . . 5 ⊢ (𝑁 = 0 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (ℂ × {0})) |
| 19 | fconstmpt 4766 | . . . . 5 ⊢ (ℂ × {0}) = (𝑥 ∈ ℂ ↦ 0) | |
| 20 | 18, 19 | eqtrdi 2278 | . . . 4 ⊢ (𝑁 = 0 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ 0)) |
| 21 | iftrue 3607 | . . . . 5 ⊢ (𝑁 = 0 → if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))) = 0) | |
| 22 | 21 | mpteq2dv 4175 | . . . 4 ⊢ (𝑁 = 0 → (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1))))) = (𝑥 ∈ ℂ ↦ 0)) |
| 23 | 20, 22 | eqtr4d 2265 | . . 3 ⊢ (𝑁 = 0 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))))) |
| 24 | 7, 23 | jaoi 721 | . 2 ⊢ ((𝑁 ∈ ℕ ∨ 𝑁 = 0) → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))))) |
| 25 | 1, 24 | sylbi 121 | 1 ⊢ (𝑁 ∈ ℕ0 → (ℂ D (𝑥 ∈ ℂ ↦ (𝑥↑𝑁))) = (𝑥 ∈ ℂ ↦ if(𝑁 = 0, 0, (𝑁 · (𝑥↑(𝑁 − 1)))))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ifcif 3602 {csn 3666 ↦ cmpt 4145 × cxp 4717 (class class class)co 6007 ℂcc 8008 0cc0 8010 1c1 8011 · cmul 8015 − cmin 8328 ℕcn 9121 ℕ0cn0 9380 ↑cexp 10772 D cdv 15344 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8101 ax-resscn 8102 ax-1cn 8103 ax-1re 8104 ax-icn 8105 ax-addcl 8106 ax-addrcl 8107 ax-mulcl 8108 ax-mulrcl 8109 ax-addcom 8110 ax-mulcom 8111 ax-addass 8112 ax-mulass 8113 ax-distr 8114 ax-i2m1 8115 ax-0lt1 8116 ax-1rid 8117 ax-0id 8118 ax-rnegex 8119 ax-precex 8120 ax-cnre 8121 ax-pre-ltirr 8122 ax-pre-ltwlin 8123 ax-pre-lttrn 8124 ax-pre-apti 8125 ax-pre-ltadd 8126 ax-pre-mulgt0 8127 ax-pre-mulext 8128 ax-arch 8129 ax-caucvg 8130 ax-addf 8132 ax-mulf 8133 |
| This theorem depends on definitions: df-bi 117 df-stab 836 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-isom 5327 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-of 6224 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-map 6805 df-pm 6806 df-sup 7162 df-inf 7163 df-pnf 8194 df-mnf 8195 df-xr 8196 df-ltxr 8197 df-le 8198 df-sub 8330 df-neg 8331 df-reap 8733 df-ap 8740 df-div 8831 df-inn 9122 df-2 9180 df-3 9181 df-4 9182 df-n0 9381 df-z 9458 df-uz 9734 df-q 9827 df-rp 9862 df-xneg 9980 df-xadd 9981 df-seqfrec 10682 df-exp 10773 df-cj 11368 df-re 11369 df-im 11370 df-rsqrt 11524 df-abs 11525 df-rest 13289 df-topgen 13308 df-psmet 14522 df-xmet 14523 df-met 14524 df-bl 14525 df-mopn 14526 df-top 14687 df-topon 14700 df-bases 14732 df-ntr 14785 df-cn 14877 df-cnp 14878 df-tx 14942 df-cncf 15260 df-limced 15345 df-dvap 15346 |
| This theorem is referenced by: dvply1 15454 |
| Copyright terms: Public domain | W3C validator |