limccnp2 - Metamath Proof Explorer

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

Theorem limccnp2 25932

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.

Step	Hyp	Ref	Expression
1		limccnp2.h	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
2		eqid 2761	. . . . . . . . . . . 12 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	cnprcl 23283	. . . . . . . . . . 11 ⊢ (𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩) → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
4	1, 3	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
5		limccnp2.j	. . . . . . . . . . . 12 ⊢ 𝐽 = ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌))
6		limccnp2.k	. . . . . . . . . . . . . . 15 ⊢ 𝐾 = (TopOpen‘ℂ_fld)
7	6	cnfldtopon 24820	. . . . . . . . . . . . . 14 ⊢ 𝐾 ∈ (TopOn‘ℂ)
8		txtopon 23629	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ 𝐾 ∈ (TopOn‘ℂ)) → (𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ)))
9	7, 7, 8	mp2an 702	. . . . . . . . . . . . 13 ⊢ (𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ))
10		limccnp2.x	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
11		limccnp2.y	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑌 ⊆ ℂ)
12		xpss12 5660	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ⊆ ℂ ∧ 𝑌 ⊆ ℂ) → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
13	10, 11, 12	syl2anc 593	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
14		resttopon 23199	. . . . . . . . . . . . 13 ⊢ (((𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ)) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
15	9, 13, 14	sylancr 596	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
16	5, 15	eqeltrid 2865	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(𝑋 × 𝑌)))
17		toponuni 22952	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) → (𝑋 × 𝑌) = ∪ 𝐽)
18	16, 17	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 × 𝑌) = ∪ 𝐽)
19	4, 18	eleqtrrd 2864	. . . . . . . . 9 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌))
20		opelxp 5681	. . . . . . . . 9 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌) ↔ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
21	19, 20	sylib 220	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
22	21	simpld 498	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
23	22	ad2antrr 736	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐶 ∈ 𝑋)
24		simpll 776	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝜑)
25		elun 4106	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
26	25	bilani 508	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
27	26	ord 875	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 ∈ {𝐵}))
28		elsni 4598	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐵} → 𝑥 = 𝐵)
29	27, 28	syl6 35	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 = 𝐵))
30	29	con1d 145	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 = 𝐵 → 𝑥 ∈ 𝐴))
31	30	imp 410	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ 𝐴)
32		limccnp2.r	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ 𝑋)
33	24, 31, 32	syl2anc 593	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑅 ∈ 𝑋)
34	23, 33	ifclda 4515	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐶, 𝑅) ∈ 𝑋)
35	21	simprd 499	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝑌)
36	35	ad2antrr 736	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐷 ∈ 𝑌)
37		limccnp2.s	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ 𝑌)
38	24, 31, 37	syl2anc 593	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑆 ∈ 𝑌)
39	36, 38	ifclda 4515	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐷, 𝑆) ∈ 𝑌)
40	34, 39	opelxpd 5684	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ ∈ (𝑋 × 𝑌))
41		eqidd 2762	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
42	7	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘ℂ))
43		cnpf2 23288	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩)) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
44	16, 42, 1, 43	syl3anc 1389	. . . . 5 ⊢ (𝜑 → 𝐻:(𝑋 × 𝑌)⟶ℂ)
45	44	feqmptd 6929	. . . 4 ⊢ (𝜑 → 𝐻 = (𝑦 ∈ (𝑋 × 𝑌) ↦ (𝐻‘𝑦)))
46		fveq2 6861	. . . . 5 ⊢ (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
47		df-ov 7393	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
48		ovif12 7490	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
49	47, 48	eqtr3i 2786	. . . . 5 ⊢ (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
50	46, 49	eqtrdi 2812	. . . 4 ⊢ (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆)))
51	40, 41, 45, 50	fmptco 7105	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))))
52		eqid 2761	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 ↦ 𝑅) = (𝑥 ∈ 𝐴 ↦ 𝑅)
53	52, 32	dmmptd 6660	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) = 𝐴)
54		limccnp2.c	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵))
55		limcrcl 25914	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵) → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
56	54, 55	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
57	56	simp2d 1155	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ)
58	53, 57	eqsstrrd 3971	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
59	56	simp3d 1156	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℂ)
60	59	snssd 4744	. . . . . . . . 9 ⊢ (𝜑 → {𝐵} ⊆ ℂ)
61	58, 60	unssd 4144	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) ⊆ ℂ)
62		resttopon 23199	. . . . . . . 8 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
63	7, 61, 62	sylancr 596	. . . . . . 7 ⊢ (𝜑 → (𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
64		ssun2 4131	. . . . . . . 8 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵})
65		snssg 4741	. . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
66	59, 65	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
67	64, 66	mpbiri 260	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ (𝐴 ∪ {𝐵}))
68	10	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑋 ⊆ ℂ)
69	68, 32	sseldd 3937	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ ℂ)
70		eqid 2761	. . . . . . . . 9 ⊢ (𝐾 ↾_t (𝐴 ∪ {𝐵})) = (𝐾 ↾_t (𝐴 ∪ {𝐵}))
71	58, 59, 69, 70, 6	limcmpt 25923	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
72	54, 71	mpbid 234	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
73		limccnp2.d	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) lim_ℂ 𝐵))
74	11	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑌 ⊆ ℂ)
75	74, 37	sseldd 3937	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ ℂ)
76	58, 59, 75, 70, 6	limcmpt 25923	. . . . . . . 8 ⊢ (𝜑 → (𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
77	73, 76	mpbid 234	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
78	63, 42, 42, 67, 72, 77	txcnp 23658	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵))
79	9	topontopi 22953	. . . . . . . 8 ⊢ (𝐾 ×_t 𝐾) ∈ Top
80	79	a1i 11	. . . . . . 7 ⊢ (𝜑 → (𝐾 ×_t 𝐾) ∈ Top)
81	40	fmpttd 7090	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌))
82		toponuni 22952	. . . . . . . . . 10 ⊢ ((𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})) → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})))
83	63, 82	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})))
84	83	feq2d 6669	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌)))
85	81, 84	mpbid 234	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌))
86		eqid 2761	. . . . . . . 8 ⊢ ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))
87	9	toponunii 22954	. . . . . . . 8 ⊢ (ℂ × ℂ) = ∪ (𝐾 ×_t 𝐾)
88	86, 87	cnprest2 23328	. . . . . . 7 ⊢ (((𝐾 ×_t 𝐾) ∈ Top ∧ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)))
89	80, 85, 13, 88	syl3anc 1389	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)))
90	78, 89	mpbid 234	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵))
91	5	oveq2i 7401	. . . . . 6 ⊢ ((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽) = ((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))
92	91	fveq1i 6862	. . . . 5 ⊢ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) = (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)
93	90, 92	eleqtrrdi 2872	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵))
94		iftrue 4485	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐶, 𝑅) = 𝐶)
95		iftrue 4485	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐷, 𝑆) = 𝐷)
96	94, 95	opeq12d 4838	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ = ⟨𝐶, 𝐷⟩)
97		eqid 2761	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
98		opex 5430	. . . . . . . 8 ⊢ ⟨𝐶, 𝐷⟩ ∈ V
99	96, 97, 98	fvmpt 6969	. . . . . . 7 ⊢ (𝐵 ∈ (𝐴 ∪ {𝐵}) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
100	67, 99	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
101	100	fveq2d 6865	. . . . 5 ⊢ (𝜑 → ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)) = ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
102	1, 101	eleqtrrd 2864	. . . 4 ⊢ (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)))
103		cnpco 23305	. . . 4 ⊢ (((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵))) → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
104	93, 102, 103	syl2anc 593	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
105	51, 104	eqeltrrd 2862	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
106	44	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
107	106, 32, 37	fovcdmd 7562	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅𝐻𝑆) ∈ ℂ)
108	58, 59, 107, 70, 6	limcmpt 25923	. 2 ⊢ (𝜑 → ((𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
109	105, 108	mpbird 259	1 ⊢ (𝜑 → (𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) lim_ℂ 𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∪ cun 3902 ⊆ wss 3904 ifcif 4479 {csn 4581 ⟨cop 4587 ∪ cuni 4864 ↦ cmpt 5180 × cxp 5643 dom cdm 5645 ∘ ccom 5649 ⟶wf 6511 ‘cfv 6515 (class class class)co 7390 ℂcc 11066 ↾_t crest 17430 TopOpenctopn 17431 ℂ_fldccnfld 21402 Topctop 22931 TopOnctopon 22948 CnP ccnp 23263 ×_t ctx 23598 lim_ℂ climc 25902

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7712 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6282 df-ord 6343 df-on 6344 df-lim 6345 df-suc 6346 df-iota 6471 df-fun 6517 df-fn 6518 df-f 6519 df-f1 6520 df-fo 6521 df-f1o 6522 df-fv 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7841 df-1st 7964 df-2nd 7965 df-frecs 8255 df-wrecs 8286 df-recs 8335 df-rdg 8374 df-1o 8430 df-er 8671 df-map 8803 df-pm 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-fi 9352 df-sup 9383 df-inf 9384 df-pnf 11213 df-mnf 11214 df-xr 11215 df-ltxr 11216 df-le 11217 df-sub 11411 df-neg 11412 df-div 11840 df-nn 12206 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12477 df-z 12564 df-dec 12684 df-uz 12835 df-q 12945 df-rp 12989 df-xneg 13109 df-xadd 13110 df-xmul 13111 df-fz 13508 df-seq 14010 df-exp 14070 df-cj 15107 df-re 15108 df-im 15109 df-sqrt 15243 df-abs 15244 df-struct 17164 df-slot 17199 df-ndx 17211 df-base 17227 df-plusg 17280 df-mulr 17281 df-starv 17282 df-tset 17286 df-ple 17287 df-ds 17289 df-unif 17290 df-rest 17432 df-topn 17433 df-topgen 17453 df-psmet 21394 df-xmet 21395 df-met 21396 df-bl 21397 df-mopn 21398 df-cnfld 21403 df-top 22932 df-topon 22949 df-topsp 22971 df-bases 22984 df-cnp 23266 df-tx 23600 df-xms 24358 df-ms 24359 df-limc 25906

This theorem is referenced by: dvcnp2 25960 dvaddbr 25978 dvmulbr 25979 dvcobr 25986 lhop1lem 26053 taylthlem2 26412

W3C validator