Metamath Proof Explorer


Theorem limcdif

Description: It suffices to consider functions which are not defined at B to define the limit of a function. In particular, the value of the original function F at B does not affect the limit of F . (Contributed by Mario Carneiro, 25-Dec-2016)

Ref Expression
Hypothesis limccl.f ⊢ φ → F : A ⟶ ℂ
Assertion limcdif ⊢ φ → F lim ℂ B = F ↾ A ∖ B lim ℂ B

Proof

Step Hyp Ref Expression
1 limccl.f ⊢ φ → F : A ⟶ ℂ
2 1 fdmd ⊢ φ → dom ⁡ F = A
3 2 adantr ⊢ φ ∧ x ∈ F lim ℂ B → dom ⁡ F = A
4 limcrcl ⊢ x ∈ F lim ℂ B → F : dom ⁡ F ⟶ ℂ ∧ dom ⁡ F ⊆ ℂ ∧ B ∈ ℂ
5 4 adantl ⊢ φ ∧ x ∈ F lim ℂ B → F : dom ⁡ F ⟶ ℂ ∧ dom ⁡ F ⊆ ℂ ∧ B ∈ ℂ
6 5 simp2d ⊢ φ ∧ x ∈ F lim ℂ B → dom ⁡ F ⊆ ℂ
7 3 6 eqsstrrd ⊢ φ ∧ x ∈ F lim ℂ B → A ⊆ ℂ
8 5 simp3d ⊢ φ ∧ x ∈ F lim ℂ B → B ∈ ℂ
9 7 8 jca ⊢ φ ∧ x ∈ F lim ℂ B → A ⊆ ℂ ∧ B ∈ ℂ
10 9 ex ⊢ φ → x ∈ F lim ℂ B → A ⊆ ℂ ∧ B ∈ ℂ
11 undif1 ⊢ A ∖ B ∪ B = A ∪ B
12 difss ⊢ A ∖ B ⊆ A
13 fssres ⊢ F : A ⟶ ℂ ∧ A ∖ B ⊆ A → F ↾ A ∖ B : A ∖ B ⟶ ℂ
14 1 12 13 sylancl ⊢ φ → F ↾ A ∖ B : A ∖ B ⟶ ℂ
15 14 fdmd ⊢ φ → dom ⁡ F ↾ A ∖ B = A ∖ B
16 15 adantr ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → dom ⁡ F ↾ A ∖ B = A ∖ B
17 limcrcl ⊢ x ∈ F ↾ A ∖ B lim ℂ B → F ↾ A ∖ B : dom ⁡ F ↾ A ∖ B ⟶ ℂ ∧ dom ⁡ F ↾ A ∖ B ⊆ ℂ ∧ B ∈ ℂ
18 17 adantl ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → F ↾ A ∖ B : dom ⁡ F ↾ A ∖ B ⟶ ℂ ∧ dom ⁡ F ↾ A ∖ B ⊆ ℂ ∧ B ∈ ℂ
19 18 simp2d ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → dom ⁡ F ↾ A ∖ B ⊆ ℂ
20 16 19 eqsstrrd ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → A ∖ B ⊆ ℂ
21 18 simp3d ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → B ∈ ℂ
22 21 snssd ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → B ⊆ ℂ
23 20 22 unssd ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → A ∖ B ∪ B ⊆ ℂ
24 11 23 eqsstrrid ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → A ∪ B ⊆ ℂ
25 24 unssad ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → A ⊆ ℂ
26 25 21 jca ⊢ φ ∧ x ∈ F ↾ A ∖ B lim ℂ B → A ⊆ ℂ ∧ B ∈ ℂ
27 26 ex ⊢ φ → x ∈ F ↾ A ∖ B lim ℂ B → A ⊆ ℂ ∧ B ∈ ℂ
28 eqid ⊢ TopOpen ⁡ ℂ fld ↾ 𝑡 A ∪ B = TopOpen ⁡ ℂ fld ↾ 𝑡 A ∪ B
29 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
30 eqid ⊢ z ∈ A ∪ B ⟼ if z = B x F ⁡ z = z ∈ A ∪ B ⟼ if z = B x F ⁡ z
31 1 adantr ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → F : A ⟶ ℂ
32 simprl ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → A ⊆ ℂ
33 simprr ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → B ∈ ℂ
34 28 29 30 31 32 33 ellimc ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → x ∈ F lim ℂ B ↔ z ∈ A ∪ B ⟼ if z = B x F ⁡ z ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A ∪ B CnP TopOpen ⁡ ℂ fld ⁡ B
35 11 eqcomi ⊢ A ∪ B = A ∖ B ∪ B
36 35 oveq2i ⊢ TopOpen ⁡ ℂ fld ↾ 𝑡 A ∪ B = TopOpen ⁡ ℂ fld ↾ 𝑡 A ∖ B ∪ B
37 35 mpteq1i ⊢ z ∈ A ∪ B ⟼ if z = B x F ⁡ z = z ∈ A ∖ B ∪ B ⟼ if z = B x F ⁡ z
38 elun ⊢ z ∈ A ∖ B ∪ B ↔ z ∈ A ∖ B ∨ z ∈ B
39 velsn ⊢ z ∈ B ↔ z = B
40 39 orbi2i ⊢ z ∈ A ∖ B ∨ z ∈ B ↔ z ∈ A ∖ B ∨ z = B
41 pm5.61 ⊢ z ∈ A ∖ B ∨ z = B ∧ ¬ z = B ↔ z ∈ A ∖ B ∧ ¬ z = B
42 fvres ⊢ z ∈ A ∖ B → F ↾ A ∖ B ⁡ z = F ⁡ z
43 42 adantr ⊢ z ∈ A ∖ B ∧ ¬ z = B → F ↾ A ∖ B ⁡ z = F ⁡ z
44 41 43 sylbi ⊢ z ∈ A ∖ B ∨ z = B ∧ ¬ z = B → F ↾ A ∖ B ⁡ z = F ⁡ z
45 44 ifeq2da ⊢ z ∈ A ∖ B ∨ z = B → if z = B x F ↾ A ∖ B ⁡ z = if z = B x F ⁡ z
46 40 45 sylbi ⊢ z ∈ A ∖ B ∨ z ∈ B → if z = B x F ↾ A ∖ B ⁡ z = if z = B x F ⁡ z
47 38 46 sylbi ⊢ z ∈ A ∖ B ∪ B → if z = B x F ↾ A ∖ B ⁡ z = if z = B x F ⁡ z
48 47 mpteq2ia ⊢ z ∈ A ∖ B ∪ B ⟼ if z = B x F ↾ A ∖ B ⁡ z = z ∈ A ∖ B ∪ B ⟼ if z = B x F ⁡ z
49 37 48 eqtr4i ⊢ z ∈ A ∪ B ⟼ if z = B x F ⁡ z = z ∈ A ∖ B ∪ B ⟼ if z = B x F ↾ A ∖ B ⁡ z
50 14 adantr ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → F ↾ A ∖ B : A ∖ B ⟶ ℂ
51 32 ssdifssd ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → A ∖ B ⊆ ℂ
52 36 29 49 50 51 33 ellimc ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → x ∈ F ↾ A ∖ B lim ℂ B ↔ z ∈ A ∪ B ⟼ if z = B x F ⁡ z ∈ TopOpen ⁡ ℂ fld ↾ 𝑡 A ∪ B CnP TopOpen ⁡ ℂ fld ⁡ B
53 34 52 bitr4d ⊢ φ ∧ A ⊆ ℂ ∧ B ∈ ℂ → x ∈ F lim ℂ B ↔ x ∈ F ↾ A ∖ B lim ℂ B
54 53 ex ⊢ φ → A ⊆ ℂ ∧ B ∈ ℂ → x ∈ F lim ℂ B ↔ x ∈ F ↾ A ∖ B lim ℂ B
55 10 27 54 pm5.21ndd ⊢ φ → x ∈ F lim ℂ B ↔ x ∈ F ↾ A ∖ B lim ℂ B
56 55 eqrdv ⊢ φ → F lim ℂ B = F ↾ A ∖ B lim ℂ B