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 25941

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 2734	. . . . . . . . . . . 12 ⊢ ∪ 𝐽 = ∪ 𝐽
3	2	cnprcl 23268	. . . . . . . . . . 11 ⊢ (𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩) → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
4	1, 3	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ ∪ 𝐽)
5		limccnp2.j	. . . . . . . . . . . 12 ⊢ 𝐽 = ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌))
6		limccnp2.k	. . . . . . . . . . . . . . 15 ⊢ 𝐾 = (TopOpen‘ℂ_fld)
7	6	cnfldtopon 24818	. . . . . . . . . . . . . 14 ⊢ 𝐾 ∈ (TopOn‘ℂ)
8		txtopon 23614	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ 𝐾 ∈ (TopOn‘ℂ)) → (𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ)))
9	7, 7, 8	mp2an 692	. . . . . . . . . . . . 13 ⊢ (𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ))
10		limccnp2.x	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
11		limccnp2.y	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑌 ⊆ ℂ)
12		xpss12 5703	. . . . . . . . . . . . . 14 ⊢ ((𝑋 ⊆ ℂ ∧ 𝑌 ⊆ ℂ) → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
13	10, 11, 12	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 × 𝑌) ⊆ (ℂ × ℂ))
14		resttopon 23184	. . . . . . . . . . . . 13 ⊢ (((𝐾 ×_t 𝐾) ∈ (TopOn‘(ℂ × ℂ)) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
15	9, 13, 14	sylancr 587	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)) ∈ (TopOn‘(𝑋 × 𝑌)))
16	5, 15	eqeltrid 2842	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘(𝑋 × 𝑌)))
17		toponuni 22935	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) → (𝑋 × 𝑌) = ∪ 𝐽)
18	16, 17	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 × 𝑌) = ∪ 𝐽)
19	4, 18	eleqtrrd 2841	. . . . . . . . 9 ⊢ (𝜑 → ⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌))
20		opelxp 5724	. . . . . . . . 9 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝑋 × 𝑌) ↔ (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
21	19, 20	sylib 218	. . . . . . . 8 ⊢ (𝜑 → (𝐶 ∈ 𝑋 ∧ 𝐷 ∈ 𝑌))
22	21	simpld 494	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ 𝑋)
23	22	ad2antrr 726	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ 𝑥 = 𝐵) → 𝐶 ∈ 𝑋)
24		simpll 767	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) ∧ ¬ 𝑥 = 𝐵) → 𝜑)
25		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → 𝑥 ∈ (𝐴 ∪ {𝐵}))
26		elun 4162	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
27	25, 26	sylib 218	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
28	27	ord 864	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → (¬ 𝑥 ∈ 𝐴 → 𝑥 ∈ {𝐵}))
29		elsni 4647	. . . . . . . . . 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 4565	. . . . 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 4565	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → if(𝑥 = 𝐵, 𝐷, 𝑆) ∈ 𝑌)
41	35, 40	opelxpd 5727	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∪ {𝐵})) → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ ∈ (𝑋 × 𝑌))
42		eqidd 2735	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
43	7	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘ℂ))
44		cnpf2 23273	. . . . . 6 ⊢ ((𝐽 ∈ (TopOn‘(𝑋 × 𝑌)) ∧ 𝐾 ∈ (TopOn‘ℂ) ∧ 𝐻 ∈ ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩)) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
45	16, 43, 1, 44	syl3anc 1370	. . . . 5 ⊢ (𝜑 → 𝐻:(𝑋 × 𝑌)⟶ℂ)
46	45	feqmptd 6976	. . . 4 ⊢ (𝜑 → 𝐻 = (𝑦 ∈ (𝑋 × 𝑌) ↦ (𝐻‘𝑦)))
47		fveq2 6906	. . . . 5 ⊢ (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩))
48		df-ov 7433	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
49		ovif12 7532	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐶, 𝑅)𝐻if(𝑥 = 𝐵, 𝐷, 𝑆)) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
50	48, 49	eqtr3i 2764	. . . . 5 ⊢ (𝐻‘⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))
51	47, 50	eqtrdi 2790	. . . 4 ⊢ (𝑦 = ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ → (𝐻‘𝑦) = if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆)))
52	41, 42, 46, 51	fmptco 7148	. . 3 ⊢ (𝜑 → (𝐻 ∘ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))))
53		eqid 2734	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝐴 ↦ 𝑅) = (𝑥 ∈ 𝐴 ↦ 𝑅)
54	53, 33	dmmptd 6713	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) = 𝐴)
55		limccnp2.c	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵))
56		limcrcl 25923	. . . . . . . . . . . 12 ⊢ (𝐶 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑅) lim_ℂ 𝐵) → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
57	55, 56	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝑅):dom (𝑥 ∈ 𝐴 ↦ 𝑅)⟶ℂ ∧ dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ ∧ 𝐵 ∈ ℂ))
58	57	simp2d 1142	. . . . . . . . . 10 ⊢ (𝜑 → dom (𝑥 ∈ 𝐴 ↦ 𝑅) ⊆ ℂ)
59	54, 58	eqsstrrd 4034	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
60	57	simp3d 1143	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ ℂ)
61	60	snssd 4813	. . . . . . . . 9 ⊢ (𝜑 → {𝐵} ⊆ ℂ)
62	59, 61	unssd 4201	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) ⊆ ℂ)
63		resttopon 23184	. . . . . . . 8 ⊢ ((𝐾 ∈ (TopOn‘ℂ) ∧ (𝐴 ∪ {𝐵}) ⊆ ℂ) → (𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
64	7, 62, 63	sylancr 587	. . . . . . 7 ⊢ (𝜑 → (𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})))
65		ssun2 4188	. . . . . . . 8 ⊢ {𝐵} ⊆ (𝐴 ∪ {𝐵})
66		snssg 4787	. . . . . . . . 9 ⊢ (𝐵 ∈ ℂ → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
67	60, 66	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝐵 ∈ (𝐴 ∪ {𝐵}) ↔ {𝐵} ⊆ (𝐴 ∪ {𝐵})))
68	65, 67	mpbiri 258	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ (𝐴 ∪ {𝐵}))
69	10	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑋 ⊆ ℂ)
70	69, 33	sseldd 3995	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑅 ∈ ℂ)
71		eqid 2734	. . . . . . . . 9 ⊢ (𝐾 ↾_t (𝐴 ∪ {𝐵})) = (𝐾 ↾_t (𝐴 ∪ {𝐵}))
72	59, 60, 70, 71, 6	limcmpt 25932	. . . . . . . 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 3995	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑆 ∈ ℂ)
77	59, 60, 76, 71, 6	limcmpt 25932	. . . . . . . 8 ⊢ (𝜑 → (𝐷 ∈ ((𝑥 ∈ 𝐴 ↦ 𝑆) lim_ℂ 𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵)))
78	74, 77	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, 𝐷, 𝑆)) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
79	64, 43, 43, 68, 73, 78	txcnp 23643	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵))
80	9	topontopi 22936	. . . . . . . 8 ⊢ (𝐾 ×_t 𝐾) ∈ Top
81	80	a1i 11	. . . . . . 7 ⊢ (𝜑 → (𝐾 ×_t 𝐾) ∈ Top)
82	41	fmpttd 7134	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌))
83		toponuni 22935	. . . . . . . . . 10 ⊢ ((𝐾 ↾_t (𝐴 ∪ {𝐵})) ∈ (TopOn‘(𝐴 ∪ {𝐵})) → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})))
84	64, 83	syl 17	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ∪ {𝐵}) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})))
85	84	feq2d 6722	. . . . . . . 8 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):(𝐴 ∪ {𝐵})⟶(𝑋 × 𝑌) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌)))
86	82, 85	mpbid 232	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌))
87		eqid 2734	. . . . . . . 8 ⊢ ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵})) = ∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))
88	9	toponunii 22937	. . . . . . . 8 ⊢ (ℂ × ℂ) = ∪ (𝐾 ×_t 𝐾)
89	87, 88	cnprest2 23313	. . . . . . 7 ⊢ (((𝐾 ×_t 𝐾) ∈ Top ∧ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩):∪ (𝐾 ↾_t (𝐴 ∪ {𝐵}))⟶(𝑋 × 𝑌) ∧ (𝑋 × 𝑌) ⊆ (ℂ × ℂ)) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP (𝐾 ×_t 𝐾))‘𝐵) ↔ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)))
90	81, 86, 13, 89	syl3anc 1370	. . . . . 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 7441	. . . . . 6 ⊢ ((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽) = ((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))
93	92	fveq1i 6907	. . . . 5 ⊢ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵) = (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP ((𝐾 ×_t 𝐾) ↾_t (𝑋 × 𝑌)))‘𝐵)
94	91, 93	eleqtrrdi 2849	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐽)‘𝐵))
95		iftrue 4536	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐶, 𝑅) = 𝐶)
96		iftrue 4536	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐷, 𝑆) = 𝐷)
97	95, 96	opeq12d 4885	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩ = ⟨𝐶, 𝐷⟩)
98		eqid 2734	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩) = (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)
99		opex 5474	. . . . . . . 8 ⊢ ⟨𝐶, 𝐷⟩ ∈ V
100	97, 98, 99	fvmpt 7015	. . . . . . 7 ⊢ (𝐵 ∈ (𝐴 ∪ {𝐵}) → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
101	68, 100	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵) = ⟨𝐶, 𝐷⟩)
102	101	fveq2d 6910	. . . . 5 ⊢ (𝜑 → ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)) = ((𝐽 CnP 𝐾)‘⟨𝐶, 𝐷⟩))
103	1, 102	eleqtrrd 2841	. . . 4 ⊢ (𝜑 → 𝐻 ∈ ((𝐽 CnP 𝐾)‘((𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ ⟨if(𝑥 = 𝐵, 𝐶, 𝑅), if(𝑥 = 𝐵, 𝐷, 𝑆)⟩)‘𝐵)))
104		cnpco 23290	. . . 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 2839	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∪ {𝐵}) ↦ if(𝑥 = 𝐵, (𝐶𝐻𝐷), (𝑅𝐻𝑆))) ∈ (((𝐾 ↾_t (𝐴 ∪ {𝐵})) CnP 𝐾)‘𝐵))
107	45	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐻:(𝑋 × 𝑌)⟶ℂ)
108	107, 33, 38	fovcdmd 7604	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑅𝐻𝑆) ∈ ℂ)
109	59, 60, 108, 71, 6	limcmpt 25932	. 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 1536 ∈ wcel 2105 ∪ cun 3960 ⊆ wss 3962 ifcif 4530 {csn 4630 ⟨cop 4636 ∪ cuni 4911 ↦ cmpt 5230 × cxp 5686 dom cdm 5688 ∘ ccom 5692 ⟶wf 6558 ‘cfv 6562 (class class class)co 7430 ℂcc 11150 ↾_t crest 17466 TopOpenctopn 17467 ℂ_fldccnfld 21381 Topctop 22914 TopOnctopon 22931 CnP ccnp 23248 ×_t ctx 23583 lim_ℂ climc 25911

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 ax-pre-sup 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-tp 4635 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-1o 8504 df-er 8743 df-map 8866 df-pm 8867 df-en 8984 df-dom 8985 df-sdom 8986 df-fin 8987 df-fi 9448 df-sup 9479 df-inf 9480 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-div 11918 df-nn 12264 df-2 12326 df-3 12327 df-4 12328 df-5 12329 df-6 12330 df-7 12331 df-8 12332 df-9 12333 df-n0 12524 df-z 12611 df-dec 12731 df-uz 12876 df-q 12988 df-rp 13032 df-xneg 13151 df-xadd 13152 df-xmul 13153 df-fz 13544 df-seq 14039 df-exp 14099 df-cj 15134 df-re 15135 df-im 15136 df-sqrt 15270 df-abs 15271 df-struct 17180 df-slot 17215 df-ndx 17227 df-base 17245 df-plusg 17310 df-mulr 17311 df-starv 17312 df-tset 17316 df-ple 17317 df-ds 17319 df-unif 17320 df-rest 17468 df-topn 17469 df-topgen 17489 df-psmet 21373 df-xmet 21374 df-met 21375 df-bl 21376 df-mopn 21377 df-cnfld 21382 df-top 22915 df-topon 22932 df-topsp 22954 df-bases 22968 df-cnp 23251 df-tx 23585 df-xms 24345 df-ms 24346 df-limc 25915

This theorem is referenced by: dvcnp2 25969 dvcnp2OLD 25970 dvaddbr 25988 dvmulbr 25989 dvmulbrOLD 25990 dvcobr 25997 dvcobrOLD 25998 lhop1lem 26066 taylthlem2 26430 taylthlem2OLD 26431

W3C validator