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

Theorem cpnfval 26309
Description: Condition for n-times continuous differentiability. (Contributed by Stefan O'Rear, 15-Nov-2014.) (Revised by Mario Carneiro, 11-Feb-2015.)
Assertion
Ref Expression
cpnfval (𝑆 ⊆ ℂ → (𝒞𝑛‘𝑆) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑆) ∣ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}))
Distinct variable group:   𝑓,𝑛,𝑆

Proof of Theorem cpnfval
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 cnex 11319 . . 3 ℂ ∈ V
21elpw2 5302 . 2 (𝑆 ∈ 𝒫 ℂ ↔ 𝑆 ⊆ ℂ)
3 oveq2 7458 . . . . 5 (𝑠 = 𝑆 → (ℂ ↑pm 𝑠) = (ℂ ↑pm 𝑆))
4 oveq1 7457 . . . . . . 7 (𝑠 = 𝑆 → (𝑠 D𝑛 𝑓) = (𝑆 D𝑛 𝑓))
54fveq1d 6917 . . . . . 6 (𝑠 = 𝑆 → ((𝑠 D𝑛 𝑓)‘𝑛) = ((𝑆 D𝑛 𝑓)‘𝑛))
65eleq1d 2852 . . . . 5 (𝑠 = 𝑆 → (((𝑠 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ) ↔ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)))
73, 6rabeqbidv 3432 . . . 4 (𝑠 = 𝑆 → {𝑓 ∈ (ℂ ↑pm 𝑠) ∣ ((𝑠 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)} = {𝑓 ∈ (ℂ ↑pm 𝑆) ∣ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)})
87mpteq2dv 5204 . . 3 (𝑠 = 𝑆 → (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑠) ∣ ((𝑠 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑆) ∣ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}))
9 df-cpn 26246 . . 3 𝒞𝑛 = (𝑠 ∈ 𝒫 ℂ ↦ (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑠) ∣ ((𝑠 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}))
10 nn0ex 12651 . . . 4 ℕ0 ∈ V
1110mptex 7259 . . 3 (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑆) ∣ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}) ∈ V
128, 9, 11fvmpt 7023 . 2 (𝑆 ∈ 𝒫 ℂ → (𝒞𝑛‘𝑆) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑆) ∣ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}))
132, 12sylbir 238 1 (𝑆 ⊆ ℂ → (𝒞𝑛‘𝑆) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (ℂ ↑pm 𝑆) ∣ ((𝑆 D𝑛 𝑓)‘𝑛) ∈ (dom 𝑓–cn→ℂ)}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1572   ∈ wcel 2150  {crab 3415   ⊆ wss 3899  𝒫 cpw 4559   ↦ cmpt 5191  dom cdm 5657  ‘cfv 6565  (class class class)co 7450   ↑pm cpm 8885  ℂcc 11236  ℕ0cn0 12645  –cn→ccncf 25254   D𝑛 cdvn 26241  𝒞𝑛ccpn 26242
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-1cn 11296  ax-addcl 11298
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-om 7911  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-nn 12375  df-n0 12646  df-cpn 26246
This theorem is used by:  fncpn  26310  elcpn  26311
  Copyright terms: Public domain W3C validator