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

Theorem limccnp2 26217
Description: The image of a convergent sequence under a continuous map is convergent to the image of the original point. Binary operation version. (Contributed by Mario Carneiro, 28-Dec-2016.)
Hypotheses
Ref Expression
limccnp2.r ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ 𝑋)
limccnp2.s ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ 𝑌)
limccnp2.x (𝜑 → 𝑋 ⊆ ℂ)
limccnp2.y (𝜑 → 𝑌 ⊆ ℂ)
limccnp2.k 𝐾 = (TopOpen‘ℂfld)
limccnp2.j 𝐽 = ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌))
limccnp2.c (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵))
limccnp2.d (𝜑 → 𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) limℂ 𝐵))
limccnp2.h (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
Assertion
Ref Expression
limccnp2 (𝜑 → (𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) limℂ 𝐵))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷   𝑥,𝐻   𝜑,𝑥   𝑥,𝑋   𝑥,𝐴   𝑥,𝑌
Allowed substitution hints:   𝑅(𝑥)   𝑆(𝑥)   𝐽(𝑥)   𝐾(𝑥)

Proof of Theorem limccnp2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 limccnp2.h . . . . . . . . . . 11 (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
2 eqid 2760 . . . . . . . . . . . 12 ∪ 𝐽 = ∪ 𝐽
32cnprcl 23568 . . . . . . . . . . 11 (𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩) → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
41, 3syl 18 . . . . . . . . . 10 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
5 limccnp2.j . . . . . . . . . . . 12 𝐽 = ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌))
6 limccnp2.k . . . . . . . . . . . . . . 15 𝐾 = (TopOpen‘ℂfld)
76cnfldtopon 25106 . . . . . . . . . . . . . 14 𝐾 ∈ (TopOn‘ℂ)
8 txtopon 23915 . . . . . . . . . . . . . 14 ((𝐾 ∈ (TopOn‘ℂ) ∧ 𝐾 ∈ (TopOn‘ℂ)) → (𝐾 ×t 𝐾) ∈ (TopOn‘(ℂ × ℂ)))
97, 7, 8mp2an 705 . . . . . . . . . . . . 13 (𝐾 ×t 𝐾) ∈ (TopOn‘(ℂ × ℂ))
10 limccnp2.x . . . . . . . . . . . . . 14 (𝜑 → 𝑋 ⊆ ℂ)
11 limccnp2.y . . . . . . . . . . . . . 14 (𝜑 → 𝑌 ⊆ ℂ)
12 xpss12 5665 . . . . . . . . . . . . . 14 ((𝑋 ⊆ ℂ ∧ 𝑌 ⊆ ℂ) → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
1310, 11, 12syl2anc 596 . . . . . . . . . . . . 13 (𝜑 → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
14 resttopon 23484 . . . . . . . . . . . . 13 (((𝐾 ×t 𝐾) ∈ (TopOn‘(ℂ × ℂ)) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
159, 13, 14sylancr 599 . . . . . . . . . . . 12 (𝜑 → ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
165, 15eqeltrid 2864 . . . . . . . . . . 11 (𝜑 → 𝐽 ∈ (TopOn‘(𝑋 × 𝑌)))
17 toponuni 23237 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) → (𝑋 × 𝑌) = ∪ 𝐽)
1816, 17syl 18 . . . . . . . . . 10 (𝜑 → (𝑋 × 𝑌) = ∪ 𝐽)
194, 18eleqtrrd 2863 . . . . . . . . 9 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌))
20 opelxp 5686 . . . . . . . . 9 (⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌) ↔ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
2119, 20sylib 221 . . . . . . . 8 (𝜑 → (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
2221simpld 500 . . . . . . 7 (𝜑 → 𝐶 ∈ 𝑋)
2322ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐶 ∈ 𝑋)
24 simpll 779 . . . . . . 7 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝜑)
25 elun 4152 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
2625bilani 510 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
2726ord 878 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 ∈ {𝐵}))
28 elsni 4597 . . . . . . . . . 10 (𝑥 ∈ {𝐵} → 𝑥 = 𝐵)
2927, 28syl6 36 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 = 𝐵))
3029con1d 146 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 = 𝐵 → 𝑥 ∈ 𝐴))
3130imp 412 . . . . . . 7 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ 𝐴)
32 limccnp2.r . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ 𝑋)
3324, 31, 32syl2anc 596 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑅 ∈ 𝑋)
3423, 33ifclda 4517 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐶, 𝑅) ∈ 𝑋)
3521simprd 501 . . . . . . 7 (𝜑 → 𝐷 ∈ 𝑌)
3635ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐷 ∈ 𝑌)
37 limccnp2.s . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ 𝑌)
3824, 31, 37syl2anc 596 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑆 ∈ 𝑌)
3936, 38ifclda 4517 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐷, 𝑆) ∈ 𝑌)
4034, 39opelxpd 5689 . . . 4 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ ∈ (𝑋 × 𝑌))
41 eqidd 2761 . . . 4 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
427a1i 11 . . . . . 6 (𝜑 → 𝐾 ∈ (TopOn‘ℂ))
43 cnpf2 23573 . . . . . 6 ((𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩)) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
4416, 42, 1, 43syl3anc 1398 . . . . 5 (𝜑 → 𝐻:(𝑋 × 𝑌)⟶ℂ)
4544feqmptd 6953 . . . 4 (𝜑 → 𝐻 = (𝑦 ∈ (𝑋 × 𝑌) ↦ (𝐻‘𝑦)))
46 fveq2 6885 . . . . 5 (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
47 df-ov 7423 . . . . . 6 (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
48 ovif12 7520 . . . . . 6 (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
4947, 48eqtr3i 2785 . . . . 5 (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
5046, 49eqtrdi 2811 . . . 4 (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆)))
5140, 41, 45, 50fmptco 7130 . . 3 (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))))
52 eqid 2760 . . . . . . . . . . 11 (𝑥 ∈ 𝐴 ↦ 𝑅) = (𝑥 ∈ 𝐴 ↦ 𝑅)
5352, 32dmmptd 6684 . . . . . . . . . 10 (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) = 𝐴)
54 limccnp2.c . . . . . . . . . . . 12 (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵))
55 limcrcl 26199 . . . . . . . . . . . 12 (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵) → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
5654, 55syl 18 . . . . . . . . . . 11 (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
5756simp2d 1161 . . . . . . . . . 10 (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ)
5853, 57eqsstrrd 3943 . . . . . . . . 9 (𝜑 → 𝐴 ⊆ ℂ)
5956simp3d 1162 . . . . . . . . . 10 (𝜑 → 𝐵 ∈ ℂ)
6059snssd 4743 . . . . . . . . 9 (𝜑 → {𝐵} ⊆ ℂ)
6158, 60unssd 4190 . . . . . . . 8 (𝜑 → (𝐴 ∪ {𝐵}) ⊆ ℂ)
62 resttopon 23484 . . . . . . . 8 ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
637, 61, 62sylancr 599 . . . . . . 7 (𝜑 → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
64 ssun2 4177 . . . . . . . 8 {𝐵} ⊆ (𝐴 ∪ {𝐵})
65 snssg 4740 . . . . . . . . 9 (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
6659, 65syl 18 . . . . . . . 8 (𝜑 → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
6764, 66mpbiri 261 . . . . . . 7 (𝜑 → 𝐵 ∈ (𝐴 ∪ {𝐵}))
6810adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑋 ⊆ ℂ)
6968, 32sseldd 3909 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ ℂ)
70 eqid 2760 . . . . . . . . 9 (𝐾 ↾t (𝐴 ∪ {𝐵})) = (𝐾 ↾t (𝐴 ∪ {𝐵}))
7158, 59, 69, 70, 6limcmpt 26208 . . . . . . . 8 (𝜑 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
7254, 71mpbid 235 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
73 limccnp2.d . . . . . . . 8 (𝜑 → 𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) limℂ 𝐵))
7411adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑌 ⊆ ℂ)
7574, 37sseldd 3909 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ ℂ)
7658, 59, 75, 70, 6limcmpt 26208 . . . . . . . 8 (𝜑 → (𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) limℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
7773, 76mpbid 235 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
7863, 42, 42, 67, 72, 77txcnp 23944 . . . . . 6 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP (𝐾 ×t 𝐾))‘𝐵))
799topontopi 23238 . . . . . . . 8 (𝐾 ×t 𝐾) ∈ Top
8079a1i 11 . . . . . . 7 (𝜑 → (𝐾 ×t 𝐾) ∈ Top)
8140fmpttd 7115 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌))
82 toponuni 23237 . . . . . . . . . 10 ((𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})) → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾t (𝐴 ∪ {𝐵})))
8363, 82syl 18 . . . . . . . . 9 (𝜑 → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾t (𝐴 ∪ {𝐵})))
8483feq2d 6693 . . . . . . . 8 (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌)))
8581, 84mpbid 235 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌))
86 eqid 2760 . . . . . . . 8 ∪ (𝐾 ↾t (𝐴 ∪ {𝐵})) = ∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))
879toponunii 23239 . . . . . . . 8 (ℂ × ℂ) = ∪ (𝐾 ×t 𝐾)
8886, 87cnprest2 23613 . . . . . . 7 (((𝐾 ×t 𝐾) ∈ Top ∧ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP (𝐾 ×t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵)))
8980, 85, 13, 88syl3anc 1398 . . . . . 6 (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP (𝐾 ×t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵)))
9078, 89mpbid 235 . . . . 5 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵))
915oveq2i 7431 . . . . . 6 ((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽) = ((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))
9291fveq1i 6886 . . . . 5 (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) = (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵)
9390, 92eleqtrrdi 2871 . . . 4 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵))
94 iftrue 4487 . . . . . . . . 9 (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐶, 𝑅) = 𝐶)
95 iftrue 4487 . . . . . . . . 9 (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐷, 𝑆) = 𝐷)
9694, 95opeq12d 4847 . . . . . . . 8 (𝑥 = 𝐵 → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ = ⟨𝐶, 𝐷⟩)
97 eqid 2760 . . . . . . . 8 (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
98 opex 5431 . . . . . . . 8 ⟨𝐶, 𝐷⟩ ∈ V
9996, 97, 98fvmpt 6993 . . . . . . 7 (𝐵 ∈ (𝐴 ∪ {𝐵}) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
10067, 99syl 18 . . . . . 6 (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
101100fveq2d 6889 . . . . 5 (𝜑 → ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)) = ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
1021, 101eleqtrrd 2863 . . . 4 (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)))
103 cnpco 23590 . . . 4 (((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵))) → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
10493, 102, 103syl2anc 596 . . 3 (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
10551, 104eqeltrrd 2861 . 2 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
10644adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
107106, 32, 37fovcdmd 7593 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅𝐻𝑆) ∈ ℂ)
10858, 59, 107, 70, 6limcmpt 26208 . 2 (𝜑 → ((𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) limℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
109105, 108mpbird 260 1 (𝜑 → (𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) limℂ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895   ∪ cun 4149  ifcif 4481  {csn 4584  ⟨cop 4834  ∪ cuni 4866   ↦ cmpt 5185   × cxp 5648  dom cdm 5650   ∘ ccom 5654  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  ℂcc 11201   ↾t crest 17596  TopOpenctopn 17597  ℂfldccnfld 21683  Topctop 23216  TopOnctopon 23233   CnP ccnp 23548   ×t ctx 23884   limℂ climc 26187
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11259  ax-resscn 11260  ax-1cn 11261  ax-icn 11262  ax-addcl 11263  ax-addrcl 11264  ax-mulcl 11265  ax-mulrcl 11266  ax-mulcom 11267  ax-addass 11268  ax-mulass 11269  ax-distr 11270  ax-i2m1 11271  ax-1ne0 11272  ax-1rid 11273  ax-rnegex 11274  ax-rrecex 11275  ax-cnre 11276  ax-pre-lttri 11277  ax-pre-lttrn 11278  ax-pre-ltadd 11279  ax-pre-mulgt0 11280  ax-pre-sup 11281
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-er 8720  df-map 8852  df-pm 8853  df-en 8977  df-dom 8978  df-sdom 8979  df-fin 8980  df-fi 9406  df-sup 9437  df-inf 9438  df-pnf 11348  df-mnf 11349  df-xr 11350  df-ltxr 11351  df-le 11352  df-sub 11546  df-neg 11547  df-div 11977  df-nn 12339  df-2 12408  df-3 12409  df-4 12410  df-5 12411  df-6 12412  df-7 12413  df-8 12414  df-9 12415  df-n0 12610  df-z 12697  df-dec 12818  df-uz 12969  df-q 13079  df-rp 13124  df-xneg 13244  df-xadd 13245  df-xmul 13246  df-fz 13643  df-seq 14148  df-exp 14208  df-cj 15271  df-re 15272  df-im 15273  df-sqrt 15407  df-abs 15408  df-struct 17330  df-slot 17365  df-ndx 17377  df-base 17393  df-plusg 17446  df-mulr 17447  df-starv 17448  df-tset 17452  df-ple 17453  df-ds 17455  df-unif 17456  df-rest 17598  df-topn 17599  df-topgen 17619  df-psmet 21675  df-xmet 21676  df-met 21677  df-bl 21678  df-mopn 21679  df-cnfld 21684  df-top 23217  df-topon 23234  df-topsp 23256  df-bases 23269  df-cnp 23551  df-tx 23886  df-xms 24644  df-ms 24645  df-limc 26191
This theorem is used by:  dvcnp2  26245  dvaddbr  26263  dvmulbr  26264  dvcobr  26271  lhop1lem  26338  taylthlem2  26706
  Copyright terms: Public domain W3C validator