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

Theorem limccnp2 26242
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 2763 . . . . . . . . . . . 12 ∪ 𝐽 = ∪ 𝐽
32cnprcl 23593 . . . . . . . . . . 11 (𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩) → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
41, 3syl 18 . . . . . . . . . 10 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
5 limccnp2.j . . . . . . . . . . . 12 𝐽 = ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌))
6 limccnp2.k . . . . . . . . . . . . . . 15 𝐾 = (TopOpen‘ℂfld)
76cnfldtopon 25131 . . . . . . . . . . . . . 14 𝐾 ∈ (TopOn‘ℂ)
8 txtopon 23940 . . . . . . . . . . . . . 14 ((𝐾 ∈ (TopOn‘ℂ) ∧ 𝐾 ∈ (TopOn‘ℂ)) → (𝐾 ×t 𝐾) ∈ (TopOn‘(ℂ × ℂ)))
97, 7, 8mp2an 705 . . . . . . . . . . . . 13 (𝐾 ×t 𝐾) ∈ (TopOn‘(ℂ × ℂ))
10 limccnp2.x . . . . . . . . . . . . . 14 (𝜑 → 𝑋 ⊆ ℂ)
11 limccnp2.y . . . . . . . . . . . . . 14 (𝜑 → 𝑌 ⊆ ℂ)
12 xpss12 5670 . . . . . . . . . . . . . 14 ((𝑋 ⊆ ℂ ∧ 𝑌 ⊆ ℂ) → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
1310, 11, 12syl2anc 596 . . . . . . . . . . . . 13 (𝜑 → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
14 resttopon 23509 . . . . . . . . . . . . 13 (((𝐾 ×t 𝐾) ∈ (TopOn‘(ℂ × ℂ)) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
159, 13, 14sylancr 599 . . . . . . . . . . . 12 (𝜑 → ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
165, 15eqeltrid 2868 . . . . . . . . . . 11 (𝜑 → 𝐽 ∈ (TopOn‘(𝑋 × 𝑌)))
17 toponuni 23262 . . . . . . . . . . 11 (𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) → (𝑋 × 𝑌) = ∪ 𝐽)
1816, 17syl 18 . . . . . . . . . 10 (𝜑 → (𝑋 × 𝑌) = ∪ 𝐽)
194, 18eleqtrrd 2867 . . . . . . . . 9 (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌))
20 opelxp 5691 . . . . . . . . 9 (⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌) ↔ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
2119, 20sylib 221 . . . . . . . 8 (𝜑 → (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
2221simpld 500 . . . . . . 7 (𝜑 → 𝐶 ∈ 𝑋)
2322ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐶 ∈ 𝑋)
24 simpll 779 . . . . . . 7 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝜑)
25 elun 4155 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
2625bilani 510 . . . . . . . . . . 11 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
2726ord 878 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 ∈ {𝐵}))
28 elsni 4601 . . . . . . . . . 10 (𝑥 ∈ {𝐵} → 𝑥 = 𝐵)
2927, 28syl6 36 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 = 𝐵))
3029con1d 146 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 = 𝐵 → 𝑥 ∈ 𝐴))
3130imp 412 . . . . . . 7 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ 𝐴)
32 limccnp2.r . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ 𝑋)
3324, 31, 32syl2anc 596 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑅 ∈ 𝑋)
3423, 33ifclda 4521 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐶, 𝑅) ∈ 𝑋)
3521simprd 501 . . . . . . 7 (𝜑 → 𝐷 ∈ 𝑌)
3635ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐷 ∈ 𝑌)
37 limccnp2.s . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ 𝑌)
3824, 31, 37syl2anc 596 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑆 ∈ 𝑌)
3936, 38ifclda 4521 . . . . 5 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐷, 𝑆) ∈ 𝑌)
4034, 39opelxpd 5694 . . . 4 ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ ∈ (𝑋 × 𝑌))
41 eqidd 2764 . . . 4 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
427a1i 11 . . . . . 6 (𝜑 → 𝐾 ∈ (TopOn‘ℂ))
43 cnpf2 23598 . . . . . 6 ((𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩)) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
4416, 42, 1, 43syl3anc 1399 . . . . 5 (𝜑 → 𝐻:(𝑋 × 𝑌)⟶ℂ)
4544feqmptd 6976 . . . 4 (𝜑 → 𝐻 = (𝑦 ∈ (𝑋 × 𝑌) ↦ (𝐻‘𝑦)))
46 fveq2 6908 . . . . 5 (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
47 df-ov 7446 . . . . . 6 (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
48 ovif12 7543 . . . . . 6 (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
4947, 48eqtr3i 2788 . . . . 5 (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
5046, 49eqtrdi 2814 . . . 4 (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆)))
5140, 41, 45, 50fmptco 7154 . . 3 (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))))
52 eqid 2763 . . . . . . . . . . 11 (𝑥 ∈ 𝐴 ↦ 𝑅) = (𝑥 ∈ 𝐴 ↦ 𝑅)
5352, 32dmmptd 6706 . . . . . . . . . 10 (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) = 𝐴)
54 limccnp2.c . . . . . . . . . . . 12 (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵))
55 limcrcl 26224 . . . . . . . . . . . 12 (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵) → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
5654, 55syl 18 . . . . . . . . . . 11 (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
5756simp2d 1161 . . . . . . . . . 10 (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ)
5853, 57eqsstrrd 3948 . . . . . . . . 9 (𝜑 → 𝐴 ⊆ ℂ)
5956simp3d 1162 . . . . . . . . . 10 (𝜑 → 𝐵 ∈ ℂ)
6059snssd 4747 . . . . . . . . 9 (𝜑 → {𝐵} ⊆ ℂ)
6158, 60unssd 4193 . . . . . . . 8 (𝜑 → (𝐴 ∪ {𝐵}) ⊆ ℂ)
62 resttopon 23509 . . . . . . . 8 ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
637, 61, 62sylancr 599 . . . . . . 7 (𝜑 → (𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
64 ssun2 4180 . . . . . . . 8 {𝐵} ⊆ (𝐴 ∪ {𝐵})
65 snssg 4744 . . . . . . . . 9 (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
6659, 65syl 18 . . . . . . . 8 (𝜑 → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
6764, 66mpbiri 261 . . . . . . 7 (𝜑 → 𝐵 ∈ (𝐴 ∪ {𝐵}))
6810adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑋 ⊆ ℂ)
6968, 32sseldd 3914 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ ℂ)
70 eqid 2763 . . . . . . . . 9 (𝐾 ↾t (𝐴 ∪ {𝐵})) = (𝐾 ↾t (𝐴 ∪ {𝐵}))
7158, 59, 69, 70, 6limcmpt 26233 . . . . . . . 8 (𝜑 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) limℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
7254, 71mpbid 235 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
73 limccnp2.d . . . . . . . 8 (𝜑 → 𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) limℂ 𝐵))
7411adantr 486 . . . . . . . . . 10 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑌 ⊆ ℂ)
7574, 37sseldd 3914 . . . . . . . . 9 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ ℂ)
7658, 59, 75, 70, 6limcmpt 26233 . . . . . . . 8 (𝜑 → (𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) limℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
7773, 76mpbid 235 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
7863, 42, 42, 67, 72, 77txcnp 23969 . . . . . 6 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP (𝐾 ×t 𝐾))‘𝐵))
799topontopi 23263 . . . . . . . 8 (𝐾 ×t 𝐾) ∈ Top
8079a1i 11 . . . . . . 7 (𝜑 → (𝐾 ×t 𝐾) ∈ Top)
8140fmpttd 7139 . . . . . . . 8 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌))
82 toponuni 23262 . . . . . . . . . 10 ((𝐾 ↾t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})) → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾t (𝐴 ∪ {𝐵})))
8363, 82syl 18 . . . . . . . . 9 (𝜑 → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾t (𝐴 ∪ {𝐵})))
8483feq2d 6715 . . . . . . . 8 (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌)))
8581, 84mpbid 235 . . . . . . 7 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌))
86 eqid 2763 . . . . . . . 8 ∪ (𝐾 ↾t (𝐴 ∪ {𝐵})) = ∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))
879toponunii 23264 . . . . . . . 8 (ℂ × ℂ) = ∪ (𝐾 ×t 𝐾)
8886, 87cnprest2 23638 . . . . . . 7 (((𝐾 ×t 𝐾) ∈ Top ∧ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP (𝐾 ×t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵)))
8980, 85, 13, 88syl3anc 1399 . . . . . 6 (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP (𝐾 ×t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵)))
9078, 89mpbid 235 . . . . 5 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵))
915oveq2i 7454 . . . . . 6 ((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽) = ((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))
9291fveq1i 6909 . . . . 5 (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) = (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×t 𝐾) ↾t (𝑋 × 𝑌)))‘𝐵)
9390, 92eleqtrrdi 2875 . . . 4 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵))
94 iftrue 4491 . . . . . . . . 9 (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐶, 𝑅) = 𝐶)
95 iftrue 4491 . . . . . . . . 9 (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐷, 𝑆) = 𝐷)
9694, 95opeq12d 4851 . . . . . . . 8 (𝑥 = 𝐵 → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ = ⟨𝐶, 𝐷⟩)
97 eqid 2763 . . . . . . . 8 (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
98 opex 5436 . . . . . . . 8 ⟨𝐶, 𝐷⟩ ∈ V
9996, 97, 98fvmpt 7016 . . . . . . 7 (𝐵 ∈ (𝐴 ∪ {𝐵}) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
10067, 99syl 18 . . . . . 6 (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
101100fveq2d 6912 . . . . 5 (𝜑 → ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)) = ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
1021, 101eleqtrrd 2867 . . . 4 (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)))
103 cnpco 23615 . . . 4 (((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵))) → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
10493, 102, 103syl2anc 596 . . 3 (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
10551, 104eqeltrrd 2865 . 2 (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
10644adantr 486 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
107106, 32, 37fovcdmd 7617 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅𝐻𝑆) ∈ ℂ)
10858, 59, 107, 70, 6limcmpt 26233 . 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 1570   ∈ wcel 2147   ⊆ wss 3900   ∪ cun 4152  ifcif 4485  {csn 4588  ⟨cop 4838  ∪ cuni 4870   ↦ cmpt 5189   × cxp 5653  dom cdm 5655   ∘ ccom 5659  ⟶wf 6554  ‘cfv 6558  (class class class)co 7443  ℂcc 11225   ↾t crest 17620  TopOpenctopn 17621  ℂfldccnfld 21708  Topctop 23241  TopOnctopon 23258   CnP ccnp 23573   ×t ctx 23909   limℂ climc 26212
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304  ax-pre-sup 11305
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-er 8745  df-map 8877  df-pm 8878  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-fi 9430  df-sup 9461  df-inf 9462  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-div 12001  df-nn 12363  df-2 12432  df-3 12433  df-4 12434  df-5 12435  df-6 12436  df-7 12437  df-8 12438  df-9 12439  df-n0 12634  df-z 12721  df-dec 12842  df-uz 12993  df-q 13103  df-rp 13148  df-xneg 13268  df-xadd 13269  df-xmul 13270  df-fz 13667  df-seq 14172  df-exp 14232  df-cj 15295  df-re 15296  df-im 15297  df-sqrt 15431  df-abs 15432  df-struct 17354  df-slot 17389  df-ndx 17401  df-base 17417  df-plusg 17470  df-mulr 17471  df-starv 17472  df-tset 17476  df-ple 17477  df-ds 17479  df-unif 17480  df-rest 17622  df-topn 17623  df-topgen 17643  df-psmet 21700  df-xmet 21701  df-met 21702  df-bl 21703  df-mopn 21704  df-cnfld 21709  df-top 23242  df-topon 23259  df-topsp 23281  df-bases 23294  df-cnp 23576  df-tx 23911  df-xms 24669  df-ms 24670  df-limc 26216
This theorem is used by:  dvcnp2  26270  dvaddbr  26288  dvmulbr  26289  dvcobr  26296  lhop1lem  26363  taylthlem2  26731
  Copyright terms: Public domain W3C validator