Theorem limciun 25058

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 25039	. . . 4 ⊢ (𝐹 limℂ 𝐶) ⊆ ℂ
2		limcresi 25049	. . . . . 6 ⊢ (𝐹 limℂ 𝐶) ⊆ ((𝐹 ↾ 𝐵) limℂ 𝐶)
3	2	rgenw 3076	. . . . 5 ⊢ ∀𝑥 ∈ 𝐴 (𝐹 limℂ 𝐶) ⊆ ((𝐹 ↾ 𝐵) limℂ 𝐶)
4		ssiin 4985	. . . . 5 ⊢ ((𝐹 limℂ 𝐶) ⊆ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶) ↔ ∀𝑥 ∈ 𝐴 (𝐹 limℂ 𝐶) ⊆ ((𝐹 ↾ 𝐵) limℂ 𝐶))
5	3, 4	mpbir 230	. . . 4 ⊢ (𝐹 limℂ 𝐶) ⊆ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶)
6	1, 5	ssini 4165	. . 3 ⊢ (𝐹 limℂ 𝐶) ⊆ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶))
7	6	a1i 11	. 2 ⊢ (𝜑 → (𝐹 limℂ 𝐶) ⊆ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶)))
8		elriin 5010	. . . 4 ⊢ (𝑦 ∈ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶)) ↔ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶)))
9		simprl 768	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → 𝑦 ∈ ℂ)
10		limciun.1	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ Fin)
11	10	ad2antrr 723	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) → 𝐴 ∈ Fin)
12		simplrr 775	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) → ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))
13		nfcv 2907	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥𝐹
14		nfcsb1v 3857	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐵
15	13, 14	nfres 5893	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥(𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵)
16		nfcv 2907	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥 limℂ
17		nfcv 2907	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥𝐶
18	15, 16, 17	nfov 7305	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶)
19	18	nfcri 2894	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶)
20		csbeq1a 3846	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑎 → 𝐵 = ⦋𝑎 / 𝑥⦌𝐵)
21	20	reseq2d 5891	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑎 → (𝐹 ↾ 𝐵) = (𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵))
22	21	oveq1d 7290	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑎 → ((𝐹 ↾ 𝐵) limℂ 𝐶) = ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶))
23	22	eleq2d 2824	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑎 → (𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶) ↔ 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶)))
24	19, 23	rspc 3549	. . . . . . . . . . . . . . . 16 ⊢ (𝑎 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶) → 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶)))
25	12, 24	mpan9 507	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → 𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶))
26		limciun.3	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
27	26	ad2antrr 723	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
28		ssiun2 4977	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑎 ∈ 𝐴 → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ∪ 𝑎 ∈ 𝐴 ⦋𝑎 / 𝑥⦌𝐵)
29		nfcv 2907	. . . . . . . . . . . . . . . . . . . . 21 ⊢ Ⅎ𝑎𝐵
30	29, 14, 20	cbviun 4966	. . . . . . . . . . . . . . . . . . . 20 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑎 ∈ 𝐴 ⦋𝑎 / 𝑥⦌𝐵
31	28, 30	sseqtrrdi 3972	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ 𝐴 → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
32	31	adantl 482	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
33	27, 32	fssresd 6641	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → (𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵):⦋𝑎 / 𝑥⦌𝐵⟶ℂ)
34		simpr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
35		limciun.2	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
36	35	ad2antrr 723	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
37		nfcv 2907	. . . . . . . . . . . . . . . . . . . 20 ⊢ Ⅎ𝑥ℂ
38	14, 37	nfss 3913	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ
39	20	sseq1d 3952	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑎 → (𝐵 ⊆ ℂ ↔ ⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ))
40	38, 39	rspc 3549	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ))
41	34, 36, 40	sylc 65	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐵 ⊆ ℂ)
42		limciun.4	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐶 ∈ ℂ)
43	42	ad2antrr 723	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → 𝐶 ∈ ℂ)
44		eqid 2738	. . . . . . . . . . . . . . . . 17 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld)
45	33, 41, 43, 44	ellimc2 25041	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑎 ∈ 𝐴) → (𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶) ↔ (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))))
46	45	adantlr 712	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → (𝑦 ∈ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) limℂ 𝐶) ↔ (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))))
47	25, 46	mpbid 231	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))))
48	47	simprd 496	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → ∀𝑢 ∈ (TopOpen‘ℂfld)(𝑦 ∈ 𝑢 → ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
49		simplrl 774	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → 𝑢 ∈ (TopOpen‘ℂfld))
50		simplrr 775	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ 𝑎 ∈ 𝐴) → 𝑦 ∈ 𝑢)
51		rsp 3131	. . . . . . . . . . . . 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 3103	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) → ∀𝑎 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
54		nfv 1917	. . . . . . . . . . . 12 ⊢ Ⅎ𝑎∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)
55		nfcv 2907	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(TopOpen‘ℂfld)
56		nfv 1917	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥 𝐶 ∈ 𝑘
57		nfcv 2907	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥𝑘
58		nfcv 2907	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑥{𝐶}
59	14, 58	nfdif 4060	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑥(⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶})
60	57, 59	nfin 4150	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑥(𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))
61	15, 60	nfima 5977	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶})))
62		nfcv 2907	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥𝑢
63	61, 62	nfss 3913	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢
64	56, 63	nfan 1902	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)
65	55, 64	nfrex 3242	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)
66	20	difeq1d 4056	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑎 → (𝐵 ∖ {𝐶}) = (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))
67	66	ineq2d 4146	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑎 → (𝑘 ∩ (𝐵 ∖ {𝐶})) = (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶})))
68	21, 67	imaeq12d 5970	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑎 → ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) = ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))))
69	68	sseq1d 3952	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → (((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 ↔ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
70	69	anbi2d 629	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → ((𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ (𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
71	70	rexbidv 3226	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
72	54, 65, 71	cbvralw 3373	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ ∀𝑎 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ ⦋𝑎 / 𝑥⦌𝐵) “ (𝑘 ∩ (⦋𝑎 / 𝑥⦌𝐵 ∖ {𝐶}))) ⊆ 𝑢))
73	53, 72	sylibr 233	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) → ∀𝑥 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))
74		eleq2 2827	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝑔‘𝑥) → (𝐶 ∈ 𝑘 ↔ 𝐶 ∈ (𝑔‘𝑥)))
75		ineq1 4139	. . . . . . . . . . . . . 14 ⊢ (𝑘 = (𝑔‘𝑥) → (𝑘 ∩ (𝐵 ∖ {𝐶})) = ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶})))
76	75	imaeq2d 5969	. . . . . . . . . . . . 13 ⊢ (𝑘 = (𝑔‘𝑥) → ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) = ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))))
77	76	sseq1d 3952	. . . . . . . . . . . 12 ⊢ (𝑘 = (𝑔‘𝑥) → (((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 ↔ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))
78	74, 77	anbi12d 631	. . . . . . . . . . 11 ⊢ (𝑘 = (𝑔‘𝑥) → ((𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
79	78	ac6sfi 9058	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Fin ∧ ∀𝑥 ∈ 𝐴 ∃𝑘 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑘 ∧ ((𝐹 ↾ 𝐵) “ (𝑘 ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → ∃𝑔(𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
80	11, 73, 79	syl2anc 584	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) → ∃𝑔(𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
81	44	cnfldtop 23947	. . . . . . . . . . 11 ⊢ (TopOpen‘ℂfld) ∈ Top
82		frn 6607	. . . . . . . . . . . 12 ⊢ (𝑔:𝐴⟶(TopOpen‘ℂfld) → ran 𝑔 ⊆ (TopOpen‘ℂfld))
83	82	ad2antrl 725	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ran 𝑔 ⊆ (TopOpen‘ℂfld))
84	11	adantr 481	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝐴 ∈ Fin)
85		ffn 6600	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝐴⟶(TopOpen‘ℂfld) → 𝑔 Fn 𝐴)
86	85	ad2antrl 725	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝑔 Fn 𝐴)
87		dffn4 6694	. . . . . . . . . . . . 13 ⊢ (𝑔 Fn 𝐴 ↔ 𝑔:𝐴–onto→ran 𝑔)
88	86, 87	sylib 217	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝑔:𝐴–onto→ran 𝑔)
89		fofi 9105	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Fin ∧ 𝑔:𝐴–onto→ran 𝑔) → ran 𝑔 ∈ Fin)
90	84, 88, 89	syl2anc 584	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ran 𝑔 ∈ Fin)
91		unicntop 23949	. . . . . . . . . . . 12 ⊢ ℂ = ∪ (TopOpen‘ℂfld)
92	91	rintopn 22058	. . . . . . . . . . 11 ⊢ (((TopOpen‘ℂfld) ∈ Top ∧ ran 𝑔 ⊆ (TopOpen‘ℂfld) ∧ ran 𝑔 ∈ Fin) → (ℂ ∩ ∩ ran 𝑔) ∈ (TopOpen‘ℂfld))
93	81, 83, 90, 92	mp3an2i 1465	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (ℂ ∩ ∩ ran 𝑔) ∈ (TopOpen‘ℂfld))
94	42	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → 𝐶 ∈ ℂ)
95	94	ad2antrr 723	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝐶 ∈ ℂ)
96		simpl 483	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → 𝐶 ∈ (𝑔‘𝑥))
97	96	ralimi 3087	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥))
98	97	ad2antll 726	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥))
99		eleq2 2827	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑔‘𝑥) → (𝐶 ∈ 𝑧 ↔ 𝐶 ∈ (𝑔‘𝑥)))
100	99	ralrn 6964	. . . . . . . . . . . . 13 ⊢ (𝑔 Fn 𝐴 → (∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧 ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥)))
101	86, 100	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧 ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ (𝑔‘𝑥)))
102	98, 101	mpbird 256	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧)
103		elrint 4922	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (ℂ ∩ ∩ ran 𝑔) ↔ (𝐶 ∈ ℂ ∧ ∀𝑧 ∈ ran 𝑔 𝐶 ∈ 𝑧))
104	95, 102, 103	sylanbrc 583	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → 𝐶 ∈ (ℂ ∩ ∩ ran 𝑔))
105		indifcom 4206	. . . . . . . . . . . . . 14 ⊢ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))
106		iunin1 5001	. . . . . . . . . . . . . 14 ⊢ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})) = (∪ 𝑥 ∈ 𝐴 𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))
107	105, 106	eqtr4i 2769	. . . . . . . . . . . . 13 ⊢ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})) = ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))
108	107	imaeq2i 5967	. . . . . . . . . . . 12 ⊢ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) = (𝐹 “ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})))
109		imaiun 7118	. . . . . . . . . . . 12 ⊢ (𝐹 “ ∪ 𝑥 ∈ 𝐴 (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) = ∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})))
110	108, 109	eqtri 2766	. . . . . . . . . . 11 ⊢ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) = ∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})))
111		inss2 4163	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (ℂ ∩ ∩ ran 𝑔) ⊆ ∩ ran 𝑔
112		fnfvelrn 6958	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑔 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑔‘𝑥) ∈ ran 𝑔)
113	85, 112	sylan 580	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → (𝑔‘𝑥) ∈ ran 𝑔)
114		intss1 4894	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑔‘𝑥) ∈ ran 𝑔 → ∩ ran 𝑔 ⊆ (𝑔‘𝑥))
115	113, 114	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → ∩ ran 𝑔 ⊆ (𝑔‘𝑥))
116	111, 115	sstrid 3932	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → (ℂ ∩ ∩ ran 𝑔) ⊆ (𝑔‘𝑥))
117	116	ssdifd 4075	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}) ⊆ ((𝑔‘𝑥) ∖ {𝐶}))
118		sslin 4168	. . . . . . . . . . . . . . . . . . 19 ⊢ (((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}) ⊆ ((𝑔‘𝑥) ∖ {𝐶}) → (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})) ⊆ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
119		imass2 6010	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶})) ⊆ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))))
120	117, 118, 119	3syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))))
121		indifcom 4206	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶})) = (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))
122	121	imaeq2i 5967	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) = ((𝐹 ↾ 𝐵) “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
123		inss1 4162	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})) ⊆ 𝐵
124		resima2 5926	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})) ⊆ 𝐵 → ((𝐹 ↾ 𝐵) “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))) = (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))))
125	123, 124	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ↾ 𝐵) “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶}))) = (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
126	122, 125	eqtri 2766	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) = (𝐹 “ (𝐵 ∩ ((𝑔‘𝑥) ∖ {𝐶})))
127	120, 126	sseqtrrdi 3972	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))))
128		sstr2 3928	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) → (((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
129	127, 128	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → (((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢 → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
130	129	adantld 491	. . . . . . . . . . . . . . 15 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ 𝑥 ∈ 𝐴) → ((𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
131	130	ralimdva 3108	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝐴⟶(TopOpen‘ℂfld) → (∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢) → ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢))
132	131	imp 407	. . . . . . . . . . . . 13 ⊢ ((𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
133	132	adantl 482	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
134		iunss 4975	. . . . . . . . . . . 12 ⊢ (∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢 ↔ ∀𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
135	133, 134	sylibr 233	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∪ 𝑥 ∈ 𝐴 (𝐹 “ (𝐵 ∩ ((ℂ ∩ ∩ ran 𝑔) ∖ {𝐶}))) ⊆ 𝑢)
136	110, 135	eqsstrid 3969	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)
137		eleq2 2827	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → (𝐶 ∈ 𝑣 ↔ 𝐶 ∈ (ℂ ∩ ∩ ran 𝑔)))
138		ineq1 4139	. . . . . . . . . . . . . 14 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})) = ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶})))
139	138	imaeq2d 5969	. . . . . . . . . . . . 13 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) = (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))))
140	139	sseq1d 3952	. . . . . . . . . . . 12 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → ((𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢 ↔ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
141	137, 140	anbi12d 631	. . . . . . . . . . 11 ⊢ (𝑣 = (ℂ ∩ ∩ ran 𝑔) → ((𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢) ↔ (𝐶 ∈ (ℂ ∩ ∩ ran 𝑔) ∧ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
142	141	rspcev 3561	. . . . . . . . . 10 ⊢ (((ℂ ∩ ∩ ran 𝑔) ∈ (TopOpen‘ℂfld) ∧ (𝐶 ∈ (ℂ ∩ ∩ ran 𝑔) ∧ (𝐹 “ ((ℂ ∩ ∩ ran 𝑔) ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)) → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
143	93, 104, 136, 142	syl12anc 834	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) ∧ (𝑔:𝐴⟶(TopOpen‘ℂfld) ∧ ∀𝑥 ∈ 𝐴 (𝐶 ∈ (𝑔‘𝑥) ∧ ((𝐹 ↾ 𝐵) “ ((𝑔‘𝑥) ∩ (𝐵 ∖ {𝐶}))) ⊆ 𝑢))) → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
144	80, 143	exlimddv 1938	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ (𝑢 ∈ (TopOpen‘ℂfld) ∧ 𝑦 ∈ 𝑢)) → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢))
145	144	expr 457	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) ∧ 𝑢 ∈ (TopOpen‘ℂfld)) → (𝑦 ∈ 𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
146	145	ralrimiva 3103	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → ∀𝑢 ∈ (TopOpen‘ℂfld)(𝑦 ∈ 𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))
147	26	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → 𝐹:∪ 𝑥 ∈ 𝐴 𝐵⟶ℂ)
148		iunss 4975	. . . . . . . . 9 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ℂ ↔ ∀𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
149	35, 148	sylibr 233	. . . . . . . 8 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
150	149	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ℂ)
151	147, 150, 94, 44	ellimc2 25041	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → (𝑦 ∈ (𝐹 limℂ 𝐶) ↔ (𝑦 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝑦 ∈ 𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐶 ∈ 𝑣 ∧ (𝐹 “ (𝑣 ∩ (∪ 𝑥 ∈ 𝐴 𝐵 ∖ {𝐶}))) ⊆ 𝑢)))))
152	9, 146, 151	mpbir2and 710	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶))) → 𝑦 ∈ (𝐹 limℂ 𝐶))
153	152	ex 413	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ ℂ ∧ ∀𝑥 ∈ 𝐴 𝑦 ∈ ((𝐹 ↾ 𝐵) limℂ 𝐶)) → 𝑦 ∈ (𝐹 limℂ 𝐶)))
154	8, 153	syl5bi 241	. . 3 ⊢ (𝜑 → (𝑦 ∈ (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶)) → 𝑦 ∈ (𝐹 limℂ 𝐶)))
155	154	ssrdv 3927	. 2 ⊢ (𝜑 → (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶)) ⊆ (𝐹 limℂ 𝐶))
156	7, 155	eqssd 3938	1 ⊢ (𝜑 → (𝐹 limℂ 𝐶) = (ℂ ∩ ∩ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐵) limℂ 𝐶)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106  ∀wral 3064  ∃wrex 3065  ⦋csb 3832   ∖ cdif 3884   ∩ cin 3886   ⊆ wss 3887  {csn 4561  ∩ cint 4879  ∪ ciun 4924  ∩ ciin 4925  ran crn 5590   ↾ cres 5591   “ cima 5592   Fn wfn 6428  ⟶wf 6429  –onto→wfo 6431  ‘cfv 6433  (class class class)co 7275  Fincfn 8733  ℂcc 10869  TopOpenctopn 17132  ℂ_fldccnfld 20597  Topctop 22042   lim_ℂ climc 25026

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-er 8498  df-map 8617  df-pm 8618  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-fi 9170  df-sup 9201  df-inf 9202  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-4 12038  df-5 12039  df-6 12040  df-7 12041  df-8 12042  df-9 12043  df-n0 12234  df-z 12320  df-dec 12438  df-uz 12583  df-q 12689  df-rp 12731  df-xneg 12848  df-xadd 12849  df-xmul 12850  df-fz 13240  df-seq 13722  df-exp 13783  df-cj 14810  df-re 14811  df-im 14812  df-sqrt 14946  df-abs 14947  df-struct 16848  df-slot 16883  df-ndx 16895  df-base 16913  df-plusg 16975  df-mulr 16976  df-starv 16977  df-tset 16981  df-ple 16982  df-ds 16984  df-unif 16985  df-rest 17133  df-topn 17134  df-topgen 17154  df-psmet 20589  df-xmet 20590  df-met 20591  df-bl 20592  df-mopn 20593  df-cnfld 20598  df-top 22043  df-topon 22060  df-topsp 22082  df-bases 22096  df-cnp 22379  df-xms 23473  df-ms 23474  df-limc 25030

This theorem is referenced by:  limcun  25059