Metamath Proof Explorer


Theorem dvfval

Description: Value and set bounds on the derivative operator. (Contributed by Mario Carneiro, 7-Aug-2014) (Revised by Mario Carneiro, 25-Dec-2016)

Ref Expression
Hypotheses dvval.t ⊢ T = K ↾ 𝑡 S
dvval.k ⊢ K = TopOpen ⁡ ℂ fld
Assertion dvfval ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → S D F = ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ∧ S D F ⊆ int ⁡ T ⁡ A × ℂ

Proof

Step Hyp Ref Expression
1 dvval.t ⊢ T = K ↾ 𝑡 S
2 dvval.k ⊢ K = TopOpen ⁡ ℂ fld
3 df-dv ⊢ D = s ∈ 𝒫 ℂ , f ∈ ℂ ↑ 𝑝𝑚 s ⟼ ⋃ x ∈ int ⁡ TopOpen ⁡ ℂ fld ↾ 𝑡 s ⁡ dom ⁡ f x × z ∈ dom ⁡ f ∖ x ⟼ f ⁡ z − f ⁡ x z − x lim ℂ x
4 3 a1i ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → D = s ∈ 𝒫 ℂ , f ∈ ℂ ↑ 𝑝𝑚 s ⟼ ⋃ x ∈ int ⁡ TopOpen ⁡ ℂ fld ↾ 𝑡 s ⁡ dom ⁡ f x × z ∈ dom ⁡ f ∖ x ⟼ f ⁡ z − f ⁡ x z − x lim ℂ x
5 2 oveq1i ⊢ K ↾ 𝑡 s = TopOpen ⁡ ℂ fld ↾ 𝑡 s
6 simprl ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → s = S
7 6 oveq2d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → K ↾ 𝑡 s = K ↾ 𝑡 S
8 7 1 eqtr4di ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → K ↾ 𝑡 s = T
9 5 8 eqtr3id ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → TopOpen ⁡ ℂ fld ↾ 𝑡 s = T
10 9 fveq2d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → int ⁡ TopOpen ⁡ ℂ fld ↾ 𝑡 s = int ⁡ T
11 simprr ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → f = F
12 11 dmeqd ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → dom ⁡ f = dom ⁡ F
13 simpl2 ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → F : A ⟶ ℂ
14 13 fdmd ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → dom ⁡ F = A
15 12 14 eqtrd ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → dom ⁡ f = A
16 10 15 fveq12d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → int ⁡ TopOpen ⁡ ℂ fld ↾ 𝑡 s ⁡ dom ⁡ f = int ⁡ T ⁡ A
17 15 difeq1d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → dom ⁡ f ∖ x = A ∖ x
18 11 fveq1d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → f ⁡ z = F ⁡ z
19 11 fveq1d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → f ⁡ x = F ⁡ x
20 18 19 oveq12d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → f ⁡ z − f ⁡ x = F ⁡ z − F ⁡ x
21 20 oveq1d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → f ⁡ z − f ⁡ x z − x = F ⁡ z − F ⁡ x z − x
22 17 21 mpteq12dv ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → z ∈ dom ⁡ f ∖ x ⟼ f ⁡ z − f ⁡ x z − x = z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x
23 22 oveq1d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → z ∈ dom ⁡ f ∖ x ⟼ f ⁡ z − f ⁡ x z − x lim ℂ x = z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x
24 23 xpeq2d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → x × z ∈ dom ⁡ f ∖ x ⟼ f ⁡ z − f ⁡ x z − x lim ℂ x = x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x
25 16 24 iuneq12d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S ∧ f = F → ⋃ x ∈ int ⁡ TopOpen ⁡ ℂ fld ↾ 𝑡 s ⁡ dom ⁡ f x × z ∈ dom ⁡ f ∖ x ⟼ f ⁡ z − f ⁡ x z − x lim ℂ x = ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x
26 simpr ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S → s = S
27 26 oveq2d ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S ∧ s = S → ℂ ↑ 𝑝𝑚 s = ℂ ↑ 𝑝𝑚 S
28 simp1 ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → S ⊆ ℂ
29 cnex ⊢ ℂ ∈ V
30 29 elpw2 ⊢ S ∈ 𝒫 ℂ ↔ S ⊆ ℂ
31 28 30 sylibr ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → S ∈ 𝒫 ℂ
32 29 a1i ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → ℂ ∈ V
33 simp2 ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → F : A ⟶ ℂ
34 simp3 ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → A ⊆ S
35 elpm2r ⊢ ℂ ∈ V ∧ S ∈ 𝒫 ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → F ∈ ℂ ↑ 𝑝𝑚 S
36 32 31 33 34 35 syl22anc ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → F ∈ ℂ ↑ 𝑝𝑚 S
37 limccl ⊢ z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ ℂ
38 xpss2 ⊢ z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ ℂ → x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ x × ℂ
39 37 38 ax-mp ⊢ x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ x × ℂ
40 39 rgenw ⊢ ∀ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ x × ℂ
41 ss2iun ⊢ ∀ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ x × ℂ → ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ ⋃ x ∈ int ⁡ T ⁡ A x × ℂ
42 40 41 ax-mp ⊢ ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ ⋃ x ∈ int ⁡ T ⁡ A x × ℂ
43 iunxpconst ⊢ ⋃ x ∈ int ⁡ T ⁡ A x × ℂ = int ⁡ T ⁡ A × ℂ
44 42 43 sseqtri ⊢ ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ int ⁡ T ⁡ A × ℂ
45 44 a1i ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ int ⁡ T ⁡ A × ℂ
46 fvex ⊢ int ⁡ T ⁡ A ∈ V
47 46 29 xpex ⊢ int ⁡ T ⁡ A × ℂ ∈ V
48 47 ssex ⊢ ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ⊆ int ⁡ T ⁡ A × ℂ → ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ∈ V
49 45 48 syl ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ∈ V
50 4 25 27 31 36 49 ovmpodx ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → S D F = ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x
51 50 45 eqsstrd ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → S D F ⊆ int ⁡ T ⁡ A × ℂ
52 50 51 jca ⊢ S ⊆ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → S D F = ⋃ x ∈ int ⁡ T ⁡ A x × z ∈ A ∖ x ⟼ F ⁡ z − F ⁡ x z − x lim ℂ x ∧ S D F ⊆ int ⁡ T ⁡ A × ℂ