Metamath Proof Explorer


Theorem cpnfval

Description: Condition for n-times continuous differentiability. (Contributed by Stefan O'Rear, 15-Nov-2014) (Revised by Mario Carneiro, 11-Feb-2015)

Ref Expression
Assertion cpnfval ⊢ S ⊆ ℂ → C n ⁡ S = n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 S | S D n f ⁡ n : dom ⁡ f ⟶cn ℂ

Proof

Step Hyp Ref Expression
1 cnex ⊢ ℂ ∈ V
2 1 elpw2 ⊢ S ∈ 𝒫 ℂ ↔ S ⊆ ℂ
3 oveq2 ⊢ s = S → ℂ ↑ 𝑝𝑚 s = ℂ ↑ 𝑝𝑚 S
4 oveq1 ⊢ s = S → s D n f = S D n f
5 4 fveq1d ⊢ s = S → s D n f ⁡ n = S D n f ⁡ n
6 5 eleq1d ⊢ s = S → s D n f ⁡ n : dom ⁡ f ⟶cn ℂ ↔ S D n f ⁡ n : dom ⁡ f ⟶cn ℂ
7 3 6 rabeqbidv ⊢ s = S → f ∈ ℂ ↑ 𝑝𝑚 s | s D n f ⁡ n : dom ⁡ f ⟶cn ℂ = f ∈ ℂ ↑ 𝑝𝑚 S | S D n f ⁡ n : dom ⁡ f ⟶cn ℂ
8 7 mpteq2dv ⊢ s = S → n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 s | s D n f ⁡ n : dom ⁡ f ⟶cn ℂ = n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 S | S D n f ⁡ n : dom ⁡ f ⟶cn ℂ
9 df-cpn ⊢ C n = s ∈ 𝒫 ℂ ⟼ n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 s | s D n f ⁡ n : dom ⁡ f ⟶cn ℂ
10 nn0ex ⊢ ℕ 0 ∈ V
11 10 mptex ⊢ n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 S | S D n f ⁡ n : dom ⁡ f ⟶cn ℂ ∈ V
12 8 9 11 fvmpt ⊢ S ∈ 𝒫 ℂ → C n ⁡ S = n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 S | S D n f ⁡ n : dom ⁡ f ⟶cn ℂ
13 2 12 sylbir ⊢ S ⊆ ℂ → C n ⁡ S = n ∈ ℕ 0 ⟼ f ∈ ℂ ↑ 𝑝𝑚 S | S D n f ⁡ n : dom ⁡ f ⟶cn ℂ