MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dvnfval Structured version   Visualization version   GIF version

Theorem dvnfval 25911
Description: Value of the iterated derivative. (Contributed by Mario Carneiro, 11-Feb-2015.)
Hypothesis
Ref Expression
dvnfval.1 𝐺 = (𝑥 ∈ V ↦ (𝑆 D 𝑥))
Assertion
Ref Expression
dvnfval ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → (𝑆 D𝑛 𝐹) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})))
Distinct variable groups:   𝑥,𝐹   𝑥,𝑆
Allowed substitution hint:   𝐺(𝑥)

Proof of Theorem dvnfval
Dummy variables 𝑓 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-dvn 25857 . . 3 D𝑛 = (𝑠 ∈ 𝒫 ℂ, 𝑓 ∈ (ℂ ↑pm 𝑠) ↦ seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓})))
21a1i 11 . 2 ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → D𝑛 = (𝑠 ∈ 𝒫 ℂ, 𝑓 ∈ (ℂ ↑pm 𝑠) ↦ seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓}))))
3 simprl 777 . . . . . . . 8 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → 𝑠 = 𝑆)
43oveq1d 7375 . . . . . . 7 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → (𝑠 D 𝑥) = (𝑆 D 𝑥))
54mpteq2dv 5169 . . . . . 6 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → (𝑥 ∈ V ↦ (𝑠 D 𝑥)) = (𝑥 ∈ V ↦ (𝑆 D 𝑥)))
6 dvnfval.1 . . . . . 6 𝐺 = (𝑥 ∈ V ↦ (𝑆 D 𝑥))
75, 6eqtr4di 2794 . . . . 5 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → (𝑥 ∈ V ↦ (𝑠 D 𝑥)) = 𝐺)
87coeq1d 5806 . . . 4 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → ((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ) = (𝐺 ∘ 1st ))
98seqeq2d 13965 . . 3 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓})) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝑓})))
10 simprr 779 . . . . . 6 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → 𝑓 = 𝐹)
1110sneqd 4570 . . . . 5 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → {𝑓} = {𝐹})
1211xpeq2d 5651 . . . 4 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → (ℕ0 × {𝑓}) = (ℕ0 × {𝐹}))
1312seqeq3d 13966 . . 3 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → seq0((𝐺 ∘ 1st ), (ℕ0 × {𝑓})) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})))
149, 13eqtrd 2776 . 2 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ (𝑠 = 𝑆𝑓 = 𝐹)) → seq0(((𝑥 ∈ V ↦ (𝑠 D 𝑥)) ∘ 1st ), (ℕ0 × {𝑓})) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})))
15 simpr 486 . . 3 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ 𝑠 = 𝑆) → 𝑠 = 𝑆)
1615oveq2d 7376 . 2 (((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) ∧ 𝑠 = 𝑆) → (ℂ ↑pm 𝑠) = (ℂ ↑pm 𝑆))
17 cnex 11114 . . . 4 ℂ ∈ V
1817elpw2 5265 . . 3 (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
1918biranri 507 . 2 ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → 𝑆 ∈ 𝒫 ℂ)
20 simpr 486 . 2 ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → 𝐹 ∈ (ℂ ↑pm 𝑆))
21 seqex 13960 . . 3 seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})) ∈ V
2221a1i 11 . 2 ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})) ∈ V)
232, 14, 16, 19, 20, 22ovmpodx 7511 1 ((𝑆 ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm 𝑆)) → (𝑆 D𝑛 𝐹) = seq0((𝐺 ∘ 1st ), (ℕ0 × {𝐹})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1548  wcel 2121  Vcvv 3433  wss 3885  𝒫 cpw 4532  {csn 4558  cmpt 5156   × cxp 5619  ccom 5625  (class class class)co 7360  cmpo 7362  1st c1st 7933  pm cpm 8768  cc 11031  0cc0 11033  0cn0 12432  seqcseq 13958   D cdv 25852   D𝑛 cdvn 25853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pr 5365  ax-un 7682  ax-inf2 9557  ax-cnex 11089
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-seq 13959  df-dvn 25857
This theorem is referenced by:  dvnff  25912  dvn0  25913  dvnp1  25914
  Copyright terms: Public domain W3C validator