Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dvnp1 | Structured version Visualization version GIF version |
Description: Successor iterated derivative. (Contributed by Stefan O'Rear, 15-Nov-2014.) (Revised by Mario Carneiro, 11-Feb-2015.) |
Ref | Expression |
---|---|
dvnp1 | ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → ((𝑆 D𝑛 𝐹)‘(𝑁 + 1)) = (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3 1063 | . . . . 5 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0) | |
2 | nn0uz 11722 | . . . . 5 ⊢ ℕ0 = (ℤ≥‘0) | |
3 | 1, 2 | syl6eleq 2711 | . . . 4 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ (ℤ≥‘0)) |
4 | seqp1 12816 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘0) → (seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘(𝑁 + 1)) = ((seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁)((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st )((ℕ0 × {𝐹})‘(𝑁 + 1)))) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → (seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘(𝑁 + 1)) = ((seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁)((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st )((ℕ0 × {𝐹})‘(𝑁 + 1)))) |
6 | fvex 6201 | . . . 4 ⊢ (seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁) ∈ V | |
7 | fvex 6201 | . . . 4 ⊢ ((ℕ0 × {𝐹})‘(𝑁 + 1)) ∈ V | |
8 | 6, 7 | algrflem 7286 | . . 3 ⊢ ((seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁)((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st )((ℕ0 × {𝐹})‘(𝑁 + 1))) = ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘(seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁)) |
9 | 5, 8 | syl6eq 2672 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → (seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘(𝑁 + 1)) = ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘(seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁))) |
10 | eqid 2622 | . . . . 5 ⊢ (𝑥 ∈ V ↦ (𝑆 D 𝑥)) = (𝑥 ∈ V ↦ (𝑆 D 𝑥)) | |
11 | 10 | dvnfval 23685 | . . . 4 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → (𝑆 D𝑛 𝐹) = seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))) |
12 | 11 | 3adant3 1081 | . . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → (𝑆 D𝑛 𝐹) = seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))) |
13 | 12 | fveq1d 6193 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → ((𝑆 D𝑛 𝐹)‘(𝑁 + 1)) = (seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘(𝑁 + 1))) |
14 | fvex 6201 | . . . 4 ⊢ ((𝑆 D𝑛 𝐹)‘𝑁) ∈ V | |
15 | oveq2 6658 | . . . . 5 ⊢ (𝑥 = ((𝑆 D𝑛 𝐹)‘𝑁) → (𝑆 D 𝑥) = (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁))) | |
16 | ovex 6678 | . . . . 5 ⊢ (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁)) ∈ V | |
17 | 15, 10, 16 | fvmpt 6282 | . . . 4 ⊢ (((𝑆 D𝑛 𝐹)‘𝑁) ∈ V → ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘((𝑆 D𝑛 𝐹)‘𝑁)) = (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁))) |
18 | 14, 17 | ax-mp 5 | . . 3 ⊢ ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘((𝑆 D𝑛 𝐹)‘𝑁)) = (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁)) |
19 | 12 | fveq1d 6193 | . . . 4 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → ((𝑆 D𝑛 𝐹)‘𝑁) = (seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁)) |
20 | 19 | fveq2d 6195 | . . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘((𝑆 D𝑛 𝐹)‘𝑁)) = ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘(seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁))) |
21 | 18, 20 | syl5eqr 2670 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁)) = ((𝑥 ∈ V ↦ (𝑆 D 𝑥))‘(seq0(((𝑥 ∈ V ↦ (𝑆 D 𝑥)) ∘ 1st ), (ℕ0 × {𝐹}))‘𝑁))) |
22 | 9, 13, 21 | 3eqtr4d 2666 | 1 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆) ∧ 𝑁 ∈ ℕ0) → ((𝑆 D𝑛 𝐹)‘(𝑁 + 1)) = (𝑆 D ((𝑆 D𝑛 𝐹)‘𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ⊆ wss 3574 {csn 4177 ↦ cmpt 4729 × cxp 5112 ∘ ccom 5118 ‘cfv 5888 (class class class)co 6650 1st c1st 7166 ↑pm cpm 7858 ℂcc 9934 0cc0 9936 1c1 9937 + caddc 9939 ℕ0cn0 11292 ℤ≥cuz 11687 seqcseq 12801 D cdv 23627 D𝑛 cdvn 23628 |
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-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 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-1st 7168 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-dvn 23632 |
This theorem is referenced by: dvn1 23689 dvnadd 23692 dvnres 23694 cpnord 23698 dvnfre 23715 c1lip2 23761 dvnply2 24042 dvntaylp 24125 taylthlem1 24127 taylthlem2 24128 dvnmptdivc 40153 dvnmptconst 40156 dvnxpaek 40157 dvnmul 40158 etransclem2 40453 |
Copyright terms: Public domain | W3C validator |