limciun - Metamath Proof Explorer

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

Theorem limciun 23658

Description: A point is a limit of 𝐹 on the finite union ∪ 𝑥 ∈ 𝐴𝐵(𝑥) iff it is the limit of the restriction of 𝐹 to each 𝐵(𝑥). (Contributed by Mario Carneiro, 30-Dec-2016.)

**Hypotheses**
Ref	Expression
limciun.1	⊢ (𝜑 → 𝐴 ∈ Fin)
limciun.2	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
limciun.3	⊢ (𝜑 → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
limciun.4	⊢ (𝜑 → 𝐶 ∈ ℂ)

**Assertion**
Ref	Expression
limciun	⊢ (𝜑 → (𝐹 lim_ℂ 𝐶) = (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)))

Distinct variable groups: 𝑥,𝐴 𝑥,𝐶 𝑥,𝐹 Allowed substitution hints: 𝜑(𝑥) 𝐵(𝑥)

Proof of Theorem limciun Dummy variables 𝑔 𝑎 𝑘 𝑢 𝑣 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		limccl 23639	. . . 4 ⊢ (𝐹 lim_ℂ 𝐶) ⊆ ℂ
2		limcresi 23649	. . . . . 6 ⊢ (𝐹 lim_ℂ 𝐶) ⊆ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)
3	2	rgenw 2924	. . . . 5 ⊢ ∀𝑥 ∈ 𝐴 (𝐹 lim_ℂ 𝐶) ⊆ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)
4		ssiin 4570	. . . . 5 ⊢ ((𝐹 lim_ℂ 𝐶) ⊆ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝐹 lim_ℂ 𝐶) ⊆ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))
5	3, 4	mpbir 221	. . . 4 ⊢ (𝐹 lim_ℂ 𝐶) ⊆ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)
6	1, 5	ssini 3836	. . 3 ⊢ (𝐹 lim_ℂ 𝐶) ⊆ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))
7	6	a1i 11	. 2 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐶) ⊆ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)))
8		elriin 4593	. . . 4 ⊢ (𝑦 ∈ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)) ↔ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)))
9		simprl 794	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → 𝑦 ∈ ℂ)
10		limciun.1	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ Fin)
11	10	ad2antrr 762	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) → 𝐴 ∈ Fin)
12		simplrr 801	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) → ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))
13		nfcv 2764	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥𝐹
14		nfcsb1v 3549	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐵
15	13, 14	nfres 5398	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥(𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵)
16		nfcv 2764	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥 lim_ℂ
17		nfcv 2764	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥𝐶
18	15, 16, 17	nfov 6676	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶)
19	18	nfcri 2758	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶)
20		csbeq1a 3542	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑎 → 𝐵 = ⦋𝑎 / 𝑥⦌𝐵)
21	20	reseq2d 5396	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑎 → (𝐹 ↾ 𝐵) = (𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵))
22	21	oveq1d 6665	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑎 → ((𝐹 ↾ 𝐵) lim_ℂ 𝐶) = ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶))
23	22	eleq2d 2687	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑎 → (𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶) ↔ 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶)))
24	19, 23	rspc 3303	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶) → 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶)))
25	12, 24	mpan9 486	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶))
26		limciun.3	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
27	26	ad2antrr 762	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
28		ssiun2 4563	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 ∈ 𝐴 → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ∪ 𝑎 ∈ 𝐴 ⦋𝑎 / 𝑥⦌𝐵)
29		nfcv 2764	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑎𝐵
30	29, 14, 20	cbviun 4557	. . . . . . . . . . . . . . . . . . . 20 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑎 ∈ 𝐴 ⦋𝑎 / 𝑥⦌𝐵
31	28, 30	syl6sseqr 3652	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ 𝐴 → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
32	31	adantl 482	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
33	27, 32	fssresd 6071	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → (𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵):⦋𝑎 / 𝑥⦌𝐵⟶ℂ)
34		simpr 477	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
35		limciun.2	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
36	35	ad2antrr 762	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
37		nfcv 2764	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥ℂ
38	14, 37	nfss 3596	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ
39	20	sseq1d 3632	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑎 → (𝐵 ⊆ ℂ ↔ ⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ))
40	38, 39	rspc 3303	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ))
41	34, 36, 40	sylc 65	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ)
42		limciun.4	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐶 ∈ ℂ)
43	42	ad2antrr 762	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → 𝐶 ∈ ℂ)
44		eqid 2622	. . . . . . . . . . . . . . . . 17 ⊢ (TopOpen‘ℂ_fld) = (TopOpen‘ℂ_fld)
45	33, 41, 43, 44	ellimc2 23641	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → (𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶) ↔ (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))))
46	45	adantlr 751	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → (𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) lim_ℂ 𝐶) ↔ (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))))
47	25, 46	mpbid 222	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))))
48	47	simprd 479	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → ∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
49		simplrl 800	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → 𝑢 ∈ (TopOpen‘ℂ_fld))
50		simplrr 801	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → 𝑦 ∈ 𝑢)
51		rsp 2929	. . . . . . . . . . . . 13 ⊢ (∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → (𝑢 ∈ (TopOpen‘ℂ_fld) → (𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))))
52	48, 49, 50, 51	syl3c 66	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
53	52	ralrimiva 2966	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) → ∀𝑎 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
54		nfv 1843	. . . . . . . . . . . 12 ⊢ Ⅎ𝑎∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)
55		nfcv 2764	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(TopOpen‘ℂ_fld)
56		nfv 1843	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥 𝐶 ∈ 𝑘
57		nfcv 2764	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥𝑘
58		nfcv 2764	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥{𝐶}
59	14, 58	nfdif 3731	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥(⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶})
60	57, 59	nfin 3820	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))
61	15, 60	nfima 5474	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶})))
62		nfcv 2764	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥𝑢
63	61, 62	nfss 3596	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢
64	56, 63	nfan 1828	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)
65	55, 64	nfrex 3007	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)
66	20	difeq1d 3727	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑎 → (𝐵 ∖ {𝐶}) = (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))
67	66	ineq2d 3814	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑎 → (𝑘 ∩ (𝐵 ∖ {𝐶})) = (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶})))
68	21, 67	imaeq12d 5467	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑎 → ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) = ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))))
69	68	sseq1d 3632	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → (((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 ↔ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
70	69	anbi2d 740	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → ((𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ (𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
71	70	rexbidv 3052	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
72	54, 65, 71	cbvral 3167	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ ∀𝑎 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
73	53, 72	sylibr 224	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) → ∀𝑥 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))
74		eleq2 2690	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝑔‘𝑥) → (𝐶 ∈ 𝑘 ↔ 𝐶 ∈ (𝑔‘𝑥)))
75		ineq1 3807	. . . . . . . . . . . . . 14 ⊢ (𝑘 = (𝑔‘𝑥) → (𝑘 ∩ (𝐵 ∖ {𝐶})) = ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶})))
76	75	imaeq2d 5466	. . . . . . . . . . . . 13 ⊢ (𝑘 = (𝑔‘𝑥) → ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) = ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))))
77	76	sseq1d 3632	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝑔‘𝑥) → (((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 ↔ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))
78	74, 77	anbi12d 747	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑔‘𝑥) → ((𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
79	78	ac6sfi 8204	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → ∃𝑔(𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
80	11, 73, 79	syl2anc 693	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) → ∃𝑔(𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
81	44	cnfldtop 22587	. . . . . . . . . . . 12 ⊢ (TopOpen‘ℂ_fld) ∈ Top
82	81	a1i 11	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (TopOpen‘ℂ_fld) ∈ Top)
83		frn 6053	. . . . . . . . . . . 12 ⊢ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) → ran 𝑔 ⊆ (TopOpen‘ℂ_fld))
84	83	ad2antrl 764	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ran 𝑔 ⊆ (TopOpen‘ℂ_fld))
85	11	adantr 481	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝐴 ∈ Fin)
86		ffn 6045	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) → 𝑔 Fn 𝐴)
87	86	ad2antrl 764	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝑔 Fn 𝐴)
88		dffn4 6121	. . . . . . . . . . . . 13 ⊢ (𝑔 Fn 𝐴 ↔ 𝑔:𝐴–onto→ran 𝑔)
89	87, 88	sylib 208	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝑔:𝐴–onto→ran 𝑔)
90		fofi 8252	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ 𝑔:𝐴–onto→ran 𝑔) → ran 𝑔 ∈ Fin)
91	85, 89, 90	syl2anc 693	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ran 𝑔 ∈ Fin)
92	44	cnfldtopon 22586	. . . . . . . . . . . . 13 ⊢ (TopOpen‘ℂ_fld) ∈ (TopOn‘ℂ)
93	92	toponunii 20721	. . . . . . . . . . . 12 ⊢ ℂ = ∪ (TopOpen‘ℂ_fld)
94	93	rintopn 20714	. . . . . . . . . . 11 ⊢ (((TopOpen‘ℂ_fld) ∈ Top ∧ ran 𝑔 ⊆ (TopOpen‘ℂ_fld) ∧ ran 𝑔 ∈ Fin) → (ℂ ∩ ∩ ran 𝑔) ∈ (TopOpen‘ℂ_fld))
95	82, 84, 91, 94	syl3anc 1326	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (ℂ ∩ ∩ ran 𝑔) ∈ (TopOpen‘ℂ_fld))
96	42	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → 𝐶 ∈ ℂ)
97	96	ad2antrr 762	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝐶 ∈ ℂ)
98		simpl 473	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → 𝐶 ∈ (𝑔‘𝑥))
99	98	ralimi 2952	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥))
100	99	ad2antll 765	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥))
101		eleq2 2690	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑔‘𝑥) → (𝐶 ∈ 𝑧 ↔ 𝐶 ∈ (𝑔‘𝑥)))
102	101	ralrn 6362	. . . . . . . . . . . . 13 ⊢ (𝑔 Fn 𝐴 → (∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧 ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥)))
103	87, 102	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧 ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥)))
104	100, 103	mpbird 247	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧)
105		elrint 4518	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (ℂ ∩ ∩ ran 𝑔) ↔ (𝐶 ∈ ℂ ∧ ∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧))
106	97, 104, 105	sylanbrc 698	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝐶 ∈ (ℂ ∩ ∩ ran 𝑔))
107		indifcom 3872	. . . . . . . . . . . . . 14 ⊢ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))
108		iunin1 4585	. . . . . . . . . . . . . 14 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))
109	107, 108	eqtr4i 2647	. . . . . . . . . . . . 13 ⊢ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))
110	109	imaeq2i 5464	. . . . . . . . . . . 12 ⊢ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) = (𝐹 “ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})))
111		imaiun 6503	. . . . . . . . . . . 12 ⊢ (𝐹 “ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) = ∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})))
112	110, 111	eqtri 2644	. . . . . . . . . . 11 ⊢ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) = ∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})))
113		inss2 3834	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (ℂ ∩ ∩ ran 𝑔) ⊆ ∩ ran 𝑔
114		fnfvelrn 6356	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑔 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑔‘𝑥) ∈ ran 𝑔)
115	86, 114	sylan 488	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → (𝑔‘𝑥) ∈ ran 𝑔)
116		intss1 4492	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑔‘𝑥) ∈ ran 𝑔 → ∩ ran 𝑔 ⊆ (𝑔‘𝑥))
117	115, 116	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → ∩ ran 𝑔 ⊆ (𝑔‘𝑥))
118	113, 117	syl5ss 3614	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → (ℂ ∩ ∩ ran 𝑔) ⊆ (𝑔‘𝑥))
119	118	ssdifd 3746	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}) ⊆ ((𝑔‘𝑥) ∖ {𝐶}))
120		sslin 3839	. . . . . . . . . . . . . . . . . . 19 ⊢ (((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}) ⊆ ((𝑔‘𝑥) ∖ {𝐶}) → (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})) ⊆ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
121		imass2 5501	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})) ⊆ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))))
122	119, 120, 121	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))))
123		indifcom 3872	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶})) = (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))
124	123	imaeq2i 5464	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) = ((𝐹 ↾ 𝐵) “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
125		inss1 3833	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})) ⊆ 𝐵
126		resima2 5432	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})) ⊆ 𝐵 → ((𝐹 ↾ 𝐵) “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))) = (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))))
127	125, 126	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ↾ 𝐵) “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))) = (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
128	124, 127	eqtri 2644	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) = (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
129	122, 128	syl6sseqr 3652	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))))
130		sstr2 3610	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) → (((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
131	129, 130	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → (((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
132	131	adantld 483	. . . . . . . . . . . . . . 15 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ 𝑥 ∈ 𝐴) → ((𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
133	132	ralimdva 2962	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) → (∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
134	133	imp 445	. . . . . . . . . . . . 13 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
135	134	adantl 482	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
136		iunss 4561	. . . . . . . . . . . 12 ⊢ (∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢 ↔ ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
137	135, 136	sylibr 224	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
138	112, 137	syl5eqss 3649	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)
139		eleq2 2690	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → (𝐶 ∈ 𝑣 ↔ 𝐶 ∈ (ℂ ∩ ∩ ran 𝑔)))
140		ineq1 3807	. . . . . . . . . . . . . 14 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})) = ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})))
141	140	imaeq2d 5466	. . . . . . . . . . . . 13 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) = (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))))
142	141	sseq1d 3632	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → ((𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢 ↔ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
143	139, 142	anbi12d 747	. . . . . . . . . . 11 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → ((𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ (𝐶 ∈ (ℂ ∩ ∩ ran 𝑔) ∧ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
144	143	rspcev 3309	. . . . . . . . . 10 ⊢ (((ℂ ∩ ∩ ran 𝑔) ∈ (TopOpen‘ℂ_fld) ∧ (𝐶 ∈ (ℂ ∩ ∩ ran 𝑔) ∧ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → ∃𝑣 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
145	95, 106, 138, 144	syl12anc 1324	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂ_fld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∃𝑣 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
146	80, 145	exlimddv 1863	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂ_fld) ∧ 𝑦 ∈ 𝑢)) → ∃𝑣 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
147	146	expr 643	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) ∧ 𝑢 ∈ (TopOpen‘ℂ_fld)) → (𝑦 ∈ 𝑢 → ∃𝑣 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
148	147	ralrimiva 2966	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → ∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑣 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
149	26	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
150		iunss 4561	. . . . . . . . 9 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ℂ ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
151	35, 150	sylibr 224	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
152	151	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
153	149, 152, 96, 44	ellimc2 23641	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → (𝑦 ∈ (𝐹 lim_ℂ 𝐶) ↔ (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂ_fld)(𝑦 ∈ 𝑢 → ∃𝑣 ∈ (TopOpen‘ℂ_fld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))))
154	9, 148, 153	mpbir2and 957	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶))) → 𝑦 ∈ (𝐹 lim_ℂ 𝐶))
155	154	ex 450	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)) → 𝑦 ∈ (𝐹 lim_ℂ 𝐶)))
156	8, 155	syl5bi 232	. . 3 ⊢ (𝜑 → (𝑦 ∈ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)) → 𝑦 ∈ (𝐹 lim_ℂ 𝐶)))
157	156	ssrdv 3609	. 2 ⊢ (𝜑 → (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)) ⊆ (𝐹 lim_ℂ 𝐶))
158	7, 157	eqssd 3620	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐶) = (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) lim_ℂ 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∃wex 1704 ∈ wcel 1990 ∀wral 2912 ∃wrex 2913 ⦋csb 3533 ∖ cdif 3571 ∩ cin 3573 ⊆ wss 3574 {csn 4177 ∩ cint 4475 ∪ ciun 4520 ∩ ciin 4521 ran crn 5115 ↾ cres 5116 “ cima 5117 Fn wfn 5883 ⟶wf 5884 –onto→wfo 5886 ‘cfv 5888 (class class class)co 6650 Fincfn 7955 ℂcc 9934 TopOpenctopn 16082 ℂ_fldccnfld 19746 Topctop 20698 lim_ℂ climc 23626

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fi 8317 df-sup 8348 df-inf 8349 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-fz 12327 df-seq 12802 df-exp 12861 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-plusg 15954 df-mulr 15955 df-starv 15956 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-rest 16083 df-topn 16084 df-topgen 16104 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-cnfld 19747 df-top 20699 df-topon 20716 df-topsp 20737 df-bases 20750 df-cnp 21032 df-xms 22125 df-ms 22126 df-limc 23630

This theorem is referenced by: limcun 23659

W3C validator