| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvnfval | Structured version Visualization version GIF version | ||
| Description: Value of the iterated derivative. (Contributed by Mario Carneiro, 11-Feb-2015.) |
| Ref | Expression |
|---|---|
| dvnfval.1 | ⊢ 𝐺 = (𝑥 ∈ V ↦ (𝑆 D 𝑥)) |
| Ref | Expression |
|---|---|
| dvnfval | ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → (𝑆 D𝑛 𝐹) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-dvn 25932 | . . 3 ⊢ D𝑛 = (𝑠 ∈ 𝒫 ℂ, 𝑓 ∈ (ℂ ↑pm 𝑠) ↦ seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓}))) | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → D𝑛 = (𝑠 ∈ 𝒫 ℂ, 𝑓 ∈ (ℂ ↑pm 𝑠) ↦ seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓})))) |
| 3 | simprl 780 | . . . . . . . 8 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → 𝑠 = 𝑆) | |
| 4 | 3 | oveq1d 7413 | . . . . . . 7 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → (𝑠 D 𝑥) = (𝑆 D 𝑥)) |
| 5 | 4 | mpteq2dv 5196 | . . . . . 6 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → (𝑥 ∈ V ↦ (𝑠 D 𝑥)) = (𝑥 ∈ V ↦ (𝑆 D 𝑥))) |
| 6 | dvnfval.1 | . . . . . 6 ⊢ 𝐺 = (𝑥 ∈ V ↦ (𝑆 D 𝑥)) | |
| 7 | 5, 6 | eqtr4di 2817 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → (𝑥 ∈ V ↦ (𝑠 D 𝑥)) = 𝐺) |
| 8 | 7 | coeq1d 5835 | . . . 4 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → ((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ) = (𝐺 ∘ 1st )) |
| 9 | 8 | seqeq2d 14023 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓})) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝑓}))) |
| 10 | simprr 782 | . . . . . 6 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → 𝑓 = 𝐹) | |
| 11 | 10 | sneqd 4596 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → {𝑓} = {𝐹}) |
| 12 | 11 | xpeq2d 5679 | . . . 4 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → (ℕ0 × {𝑓}) = (ℕ0 × {𝐹})) |
| 13 | 12 | seqeq3d 14024 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → seq0((𝐺 ∘ 1st ), (ℕ0 × {𝑓})) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹}))) |
| 14 | 9, 13 | eqtrd 2799 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆 ∧ 𝑓 = 𝐹)) → seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓})) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹}))) |
| 15 | simpr 488 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆) | |
| 16 | 15 | oveq2d 7414 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ 𝑠 = 𝑆) → (ℂ ↑pm 𝑠) = (ℂ ↑pm 𝑆)) |
| 17 | cnex 11156 | . . . 4 ⊢ ℂ ∈ V | |
| 18 | 17 | elpw2 5292 | . . 3 ⊢ (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ) |
| 19 | 18 | biranri 509 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → 𝑆 ∈ 𝒫 ℂ) |
| 20 | simpr 488 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → 𝐹 ∈ (ℂ ↑pm 𝑆)) | |
| 21 | seqex 14018 | . . 3 ⊢ seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})) ∈ V | |
| 22 | 21 | a1i 11 | . 2 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})) ∈ V) |
| 23 | 2, 14, 16, 19, 20, 22 | ovmpodx 7549 | 1 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → (𝑆 D𝑛 𝐹) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1562 ∈ wcel 2144 Vcvv 3456 ⊆ wss 3906 𝒫 cpw 4557 {csn 4584 ↦ cmpt 5183 × cxp 5647 ∘ ccom 5653 (class class class)co 7398 ∈ cmpo 7400 1st c1st 7970 ↑pm cpm 8811 ℂcc 11073 0cc0 11075 ℕ0cn0 12483 seqcseq 14016 D cdv 25927 D𝑛 cdvn 25928 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 ax-inf2 9598 ax-cnex 11131 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-seq 14017 df-dvn 25932 |
| This theorem is referenced by: dvnff 25987 dvn0 25988 dvnp1 25989 |
| Copyright terms: Public domain | W3C validator |