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 25821

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 2733	. . . . . . . . . . . 12 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	cnprcl 23161	. . . . . . . . . . 11 ⊢ (𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩) → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
4	1, 3	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
5		limccnp2.j	. . . . . . . . . . . 12 ⊢ 𝐽 = ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌))
6		limccnp2.k	. . . . . . . . . . . . . . 15 ⊢ 𝐾 = (TopOpen‘ℂ_fld)
7	6	cnfldtopon 24698	. . . . . . . . . . . . . 14 ⊢ 𝐾 ∈ (TopOn‘ℂ)
8		txtopon 23507	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ 𝐾 ∈ (TopOn‘ℂ)) → (𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ)))
9	7, 7, 8	mp2an 692	. . . . . . . . . . . . 13 ⊢ (𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ))
10		limccnp2.x	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
11		limccnp2.y	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑌 ⊆ ℂ)
12		xpss12 5634	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ⊆ ℂ ∧ 𝑌 ⊆ ℂ) → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
13	10, 11, 12	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
14		resttopon 23077	. . . . . . . . . . . . 13 ⊢ (((𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ)) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
15	9, 13, 14	sylancr 587	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
16	5, 15	eqeltrid 2837	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(𝑋 × 𝑌)))
17		toponuni 22830	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) → (𝑋 × 𝑌) = ∪ 𝐽)
18	16, 17	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 × 𝑌) = ∪ 𝐽)
19	4, 18	eleqtrrd 2836	. . . . . . . . 9 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌))
20		opelxp 5655	. . . . . . . . 9 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌) ↔ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
21	19, 20	sylib 218	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
22	21	simpld 494	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
23	22	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐶 ∈ 𝑋)
24		simpll 766	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝜑)
25		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → 𝑥 ∈ (𝐴 ∪ {𝐵}))
26		elun 4102	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
27	25, 26	sylib 218	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
28	27	ord 864	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 ∈ {𝐵}))
29		elsni 4592	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝐵} → 𝑥 = 𝐵)
30	28, 29	syl6 35	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 = 𝐵))
31	30	con1d 145	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 = 𝐵 → 𝑥 ∈ 𝐴))
32	31	imp 406	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ 𝐴)
33		limccnp2.r	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ 𝑋)
34	24, 32, 33	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑅 ∈ 𝑋)
35	23, 34	ifclda 4510	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐶, 𝑅) ∈ 𝑋)
36	21	simprd 495	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝑌)
37	36	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐷 ∈ 𝑌)
38		limccnp2.s	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ 𝑌)
39	24, 32, 38	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝑆 ∈ 𝑌)
40	37, 39	ifclda 4510	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐷, 𝑆) ∈ 𝑌)
41	35, 40	opelxpd 5658	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ ∈ (𝑋 × 𝑌))
42		eqidd 2734	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
43	7	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘ℂ))
44		cnpf2 23166	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩)) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
45	16, 43, 1, 44	syl3anc 1373	. . . . 5 ⊢ (𝜑 → 𝐻:(𝑋 × 𝑌)⟶ℂ)
46	45	feqmptd 6896	. . . 4 ⊢ (𝜑 → 𝐻 = (𝑦 ∈ (𝑋 × 𝑌) ↦ (𝐻‘𝑦)))
47		fveq2 6828	. . . . 5 ⊢ (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
48		df-ov 7355	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
49		ovif12 7452	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
50	48, 49	eqtr3i 2758	. . . . 5 ⊢ (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
51	47, 50	eqtrdi 2784	. . . 4 ⊢ (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆)))
52	41, 42, 46, 51	fmptco 7068	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))))
53		eqid 2733	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 ↦ 𝑅) = (𝑥 ∈ 𝐴 ↦ 𝑅)
54	53, 33	dmmptd 6631	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) = 𝐴)
55		limccnp2.c	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵))
56		limcrcl 25803	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵) → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
57	55, 56	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
58	57	simp2d 1143	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ)
59	54, 58	eqsstrrd 3966	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
60	57	simp3d 1144	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℂ)
61	60	snssd 4760	. . . . . . . . 9 ⊢ (𝜑 → {𝐵} ⊆ ℂ)
62	59, 61	unssd 4141	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) ⊆ ℂ)
63		resttopon 23077	. . . . . . . 8 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
64	7, 62, 63	sylancr 587	. . . . . . 7 ⊢ (𝜑 → (𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
65		ssun2 4128	. . . . . . . 8 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵})
66		snssg 4735	. . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
67	60, 66	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
68	65, 67	mpbiri 258	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ (𝐴 ∪ {𝐵}))
69	10	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑋 ⊆ ℂ)
70	69, 33	sseldd 3931	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ ℂ)
71		eqid 2733	. . . . . . . . 9 ⊢ (𝐾 ↾_t (𝐴 ∪ {𝐵})) = (𝐾 ↾_t (𝐴 ∪ {𝐵}))
72	59, 60, 70, 71, 6	limcmpt 25812	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
73	55, 72	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐶, 𝑅)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
74		limccnp2.d	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) lim_ℂ 𝐵))
75	11	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑌 ⊆ ℂ)
76	75, 38	sseldd 3931	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ ℂ)
77	59, 60, 76, 71, 6	limcmpt 25812	. . . . . . . 8 ⊢ (𝜑 → (𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
78	74, 77	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
79	64, 43, 43, 68, 73, 78	txcnp 23536	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵))
80	9	topontopi 22831	. . . . . . . 8 ⊢ (𝐾 ×_t 𝐾) ∈ Top
81	80	a1i 11	. . . . . . 7 ⊢ (𝜑 → (𝐾 ×_t 𝐾) ∈ Top)
82	41	fmpttd 7054	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌))
83		toponuni 22830	. . . . . . . . . 10 ⊢ ((𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})) → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})))
84	64, 83	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})))
85	84	feq2d 6640	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌)))
86	82, 85	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌))
87		eqid 2733	. . . . . . . 8 ⊢ ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))
88	9	toponunii 22832	. . . . . . . 8 ⊢ (ℂ × ℂ) = ∪ (𝐾 ×_t 𝐾)
89	87, 88	cnprest2 23206	. . . . . . 7 ⊢ (((𝐾 ×_t 𝐾) ∈ Top ∧ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)))
90	81, 86, 13, 89	syl3anc 1373	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)))
91	79, 90	mpbid 232	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵))
92	5	oveq2i 7363	. . . . . 6 ⊢ ((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽) = ((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))
93	92	fveq1i 6829	. . . . 5 ⊢ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) = (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)
94	91, 93	eleqtrrdi 2844	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵))
95		iftrue 4480	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐶, 𝑅) = 𝐶)
96		iftrue 4480	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐷, 𝑆) = 𝐷)
97	95, 96	opeq12d 4832	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ = ⟨𝐶, 𝐷⟩)
98		eqid 2733	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
99		opex 5407	. . . . . . . 8 ⊢ ⟨𝐶, 𝐷⟩ ∈ V
100	97, 98, 99	fvmpt 6935	. . . . . . 7 ⊢ (𝐵 ∈ (𝐴 ∪ {𝐵}) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
101	68, 100	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
102	101	fveq2d 6832	. . . . 5 ⊢ (𝜑 → ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)) = ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
103	1, 102	eleqtrrd 2836	. . . 4 ⊢ (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)))
104		cnpco 23183	. . . 4 ⊢ (((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵))) → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
105	94, 103, 104	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
106	52, 105	eqeltrrd 2834	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
107	45	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
108	107, 33, 38	fovcdmd 7524	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅𝐻𝑆) ∈ ℂ)
109	59, 60, 108, 71, 6	limcmpt 25812	. 2 ⊢ (𝜑 → ((𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
110	106, 109	mpbird 257	1 ⊢ (𝜑 → (𝐶𝐻𝐷) ∈ ((𝑥 ∈ 𝐴 ↦ (𝑅𝐻𝑆)) lim_ℂ 𝐵))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∪ cun 3896 ⊆ wss 3898 ifcif 4474 {csn 4575 ⟨cop 4581 ∪ cuni 4858 ↦ cmpt 5174 × cxp 5617 dom cdm 5619 ∘ ccom 5623 ⟶wf 6482 ‘cfv 6486 (class class class)co 7352 ℂcc 11011 ↾_t crest 17326 TopOpenctopn 17327 ℂ_fldccnfld 21293 Topctop 22809 TopOnctopon 22826 CnP ccnp 23141 ×_t ctx 23476 lim_ℂ climc 25791

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090 ax-pre-sup 11091

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-tp 4580 df-op 4582 df-uni 4859 df-int 4898 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-tr 5201 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6253 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-om 7803 df-1st 7927 df-2nd 7928 df-frecs 8217 df-wrecs 8248 df-recs 8297 df-rdg 8335 df-1o 8391 df-er 8628 df-map 8758 df-pm 8759 df-en 8876 df-dom 8877 df-sdom 8878 df-fin 8879 df-fi 9302 df-sup 9333 df-inf 9334 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-nn 12133 df-2 12195 df-3 12196 df-4 12197 df-5 12198 df-6 12199 df-7 12200 df-8 12201 df-9 12202 df-n0 12389 df-z 12476 df-dec 12595 df-uz 12739 df-q 12849 df-rp 12893 df-xneg 13013 df-xadd 13014 df-xmul 13015 df-fz 13410 df-seq 13911 df-exp 13971 df-cj 15008 df-re 15009 df-im 15010 df-sqrt 15144 df-abs 15145 df-struct 17060 df-slot 17095 df-ndx 17107 df-base 17123 df-plusg 17176 df-mulr 17177 df-starv 17178 df-tset 17182 df-ple 17183 df-ds 17185 df-unif 17186 df-rest 17328 df-topn 17329 df-topgen 17349 df-psmet 21285 df-xmet 21286 df-met 21287 df-bl 21288 df-mopn 21289 df-cnfld 21294 df-top 22810 df-topon 22827 df-topsp 22849 df-bases 22862 df-cnp 23144 df-tx 23478 df-xms 24236 df-ms 24237 df-limc 25795

This theorem is referenced by: dvcnp2 25849 dvcnp2OLD 25850 dvaddbr 25868 dvmulbr 25869 dvmulbrOLD 25870 dvcobr 25877 dvcobrOLD 25878 lhop1lem 25946 taylthlem2 26310 taylthlem2OLD 26311

W3C validator