Theorem ptcnp 23832

Description: If every projection of a function is continuous at 𝐷, then the function itself is continuous at 𝐷 into the product topology. (Contributed by Mario Carneiro, 3-Feb-2015.) (Revised by Mario Carneiro, 22-Aug-2015.)

Hypotheses

Ref	Expression
ptcnp.2	⊢ 𝐾 = (∏t‘𝐹)
ptcnp.3	⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
ptcnp.4	⊢ (𝜑 → 𝐼 ∈ 𝑉)
ptcnp.5	⊢ (𝜑 → 𝐹:𝐼⟶Top)
ptcnp.6	⊢ (𝜑 → 𝐷 ∈ 𝑋)
ptcnp.7	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ ((𝐽 CnP (𝐹‘𝑘))‘𝐷))

Assertion

Ref	Expression
ptcnp	⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) ∈ ((𝐽 CnP 𝐾)‘𝐷))

Distinct variable groups:   𝑥,𝑘,𝐷   𝑘,𝐼,𝑥   𝑘,𝐽   𝜑,𝑘,𝑥   𝑘,𝐹,𝑥   𝑘,𝑉,𝑥   𝑘,𝑋,𝑥

Allowed substitution hints:   𝐴(𝑥, 𝑘)   𝐽(𝑥)   𝐾(𝑥, 𝑘)

Proof of Theorem ptcnp

Dummy variables 𝑓 𝑔 𝑤 𝑧 𝑎 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptcnp.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝑋))
2	1	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝐽 ∈ (TopOn‘𝑋))
3		ptcnp.5	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐼⟶Top)
4	3	ffvelcdmda 7083	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝐹‘𝑘) ∈ Top)
5		toptopon2 23127	. . . . . . . . 9 ⊢ ((𝐹‘𝑘) ∈ Top ↔ (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)))
6	4, 5	sylib 221	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)))
7		ptcnp.7	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ ((𝐽 CnP (𝐹‘𝑘))‘𝐷))
8		cnpf2 23459	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ ((𝐽 CnP (𝐹‘𝑘))‘𝐷)) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶∪ (𝐹‘𝑘))
9	2, 6, 7, 8	syl3anc 1398	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶∪ (𝐹‘𝑘))
10	9	fvmptelcdm 7112	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ ∪ (𝐹‘𝑘))
11	10	an32s 665	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → 𝐴 ∈ ∪ (𝐹‘𝑘))
12	11	ralrimiva 3159	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑘 ∈ 𝐼 𝐴 ∈ ∪ (𝐹‘𝑘))
13		ptcnp.4	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
14	13	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐼 ∈ 𝑉)
15		mptelixpg 8939	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → ((𝑘 ∈ 𝐼 ↦ 𝐴) ∈ X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘) ↔ ∀𝑘 ∈ 𝐼 𝐴 ∈ ∪ (𝐹‘𝑘)))
16	14, 15	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑘 ∈ 𝐼 ↦ 𝐴) ∈ X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘) ↔ ∀𝑘 ∈ 𝐼 𝐴 ∈ ∪ (𝐹‘𝑘)))
17	12, 16	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑘 ∈ 𝐼 ↦ 𝐴) ∈ X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘))
18	17	fmpttd 7114	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)):𝑋⟶X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘))
19		df-3an 1105	. . . . . . . 8 ⊢ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ↔ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)))
20		ptcnp.2	. . . . . . . . . . . . 13 ⊢ 𝐾 = (∏t‘𝐹)
21		ptcnp.6	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
22		nfv 1947	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘(𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))
23		nfv 1947	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))
24		nfcv 2927	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘𝑋
25		nfmpt1 5212	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘(𝑘 ∈ 𝐼 ↦ 𝐴)
26	24, 25	nfmpt 5211	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘(𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))
27		nfcv 2927	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘𝐷
28	26, 27	nffv 6895	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷)
29	28	nfel1 2943	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)
30	23, 29	nfan 1932	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛))
31	22, 30	nfan 1932	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))
32		simprll 791	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → 𝑔 Fn 𝐼)
33		simprlr 792	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))
34		fveq2 6885	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (𝑔‘𝑛) = (𝑔‘𝑘))
35		fveq2 6885	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
36	34, 35	eleq12d 2859	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → ((𝑔‘𝑛) ∈ (𝐹‘𝑛) ↔ (𝑔‘𝑘) ∈ (𝐹‘𝑘)))
37	36	rspccva 3582	. . . . . . . . . . . . . 14 ⊢ ((∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ 𝑘 ∈ 𝐼) → (𝑔‘𝑘) ∈ (𝐹‘𝑘))
38	33, 37	sylan 592	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) ∧ 𝑘 ∈ 𝐼) → (𝑔‘𝑘) ∈ (𝐹‘𝑘))
39		simprrl 793	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → (𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)))
40	39	simpld 500	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → 𝑤 ∈ Fin)
41	39	simprd 501	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))
42	35	unieqd 4887	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → ∪ (𝐹‘𝑛) = ∪ (𝐹‘𝑘))
43	34, 42	eqeq12d 2781	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → ((𝑔‘𝑛) = ∪ (𝐹‘𝑛) ↔ (𝑔‘𝑘) = ∪ (𝐹‘𝑘)))
44	43	rspccva 3582	. . . . . . . . . . . . . 14 ⊢ ((∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛) ∧ 𝑘 ∈ (𝐼 ∖ 𝑤)) → (𝑔‘𝑘) = ∪ (𝐹‘𝑘))
45	41, 44	sylan 592	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) ∧ 𝑘 ∈ (𝐼 ∖ 𝑤)) → (𝑔‘𝑘) = ∪ (𝐹‘𝑘))
46		simprrr 794	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛))
47	34	cbvixpv 8919	. . . . . . . . . . . . . 14 ⊢ X𝑛 ∈ 𝐼 (𝑔‘𝑛) = X𝑘 ∈ 𝐼 (𝑔‘𝑘)
48	46, 47	eleqtrdi 2875	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑘 ∈ 𝐼 (𝑔‘𝑘))
49	20, 1, 13, 3, 21, 7, 31, 32, 38, 40, 45, 48	ptcnplem 23831	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))
50	49	anassrs 473	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛))) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))
51	50	expr 462	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))) ∧ (𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
52	51	rexlimdvaa 3169	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))) → (∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))))
53	52	impr 460	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
54	19, 53	sylan2b 606	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
55		eleq2 2854	. . . . . . . 8 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 ↔ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))
56	47	eqeq2i 2778	. . . . . . . . . . . 12 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) ↔ 𝑓 = X𝑘 ∈ 𝐼 (𝑔‘𝑘))
57	56	biimpi 219	. . . . . . . . . . 11 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → 𝑓 = X𝑘 ∈ 𝐼 (𝑔‘𝑘))
58	57	sseq2d 3970	. . . . . . . . . 10 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓 ↔ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))
59	58	anbi2d 642	. . . . . . . . 9 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ((𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓) ↔ (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
60	59	rexbidv 3191	. . . . . . . 8 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓) ↔ ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
61	55, 60	imbi12d 347	. . . . . . 7 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ((((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)) ↔ (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))))
62	54, 61	syl5ibrcom 250	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
63	62	expimpd 459	. . . . 5 ⊢ (𝜑 → (((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
64	63	exlimdv 1966	. . . 4 ⊢ (𝜑 → (∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
65	64	alrimiv 1960	. . 3 ⊢ (𝜑 → ∀𝑓(∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
66		eqeq1 2769	. . . . . 6 ⊢ (𝑎 = 𝑓 → (𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) ↔ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)))
67	66	anbi2d 642	. . . . 5 ⊢ (𝑎 = 𝑓 → (((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) ↔ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))))
68	67	exbidv 1954	. . . 4 ⊢ (𝑎 = 𝑓 → (∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) ↔ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))))
69	68	ralab 3658	. . 3 ⊢ (∀𝑓 ∈ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)) ↔ ∀𝑓(∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
70	65, 69	sylibr 237	. 2 ⊢ (𝜑 → ∀𝑓 ∈ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)))
71	3	ffnd 6710	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐼)
72		eqid 2765	. . . . . 6 ⊢ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} = {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}
73	72	ptval 23780	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 Fn 𝐼) → (∏t‘𝐹) = (topGen‘{𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}))
74	13, 71, 73	syl2anc 596	. . . 4 ⊢ (𝜑 → (∏t‘𝐹) = (topGen‘{𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}))
75	20, 74	eqtrid 2812	. . 3 ⊢ (𝜑 → 𝐾 = (topGen‘{𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}))
76	3	feqmptd 6953	. . . . . 6 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘)))
77	76	fveq2d 6889	. . . . 5 ⊢ (𝜑 → (∏t‘𝐹) = (∏t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))))
78	20, 77	eqtrid 2812	. . . 4 ⊢ (𝜑 → 𝐾 = (∏t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))))
79	6	ralrimiva 3159	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ 𝐼 (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)))
80		eqid 2765	. . . . . 6 ⊢ (∏t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))) = (∏t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘)))
81	80	pttopon 23806	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘))) → (∏t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))) ∈ (TopOn‘X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘)))
82	13, 79, 81	syl2anc 596	. . . 4 ⊢ (𝜑 → (∏t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))) ∈ (TopOn‘X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘)))
83	78, 82	eqeltrd 2865	. . 3 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘)))
84	1, 75, 83, 21	tgcnp 23462	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) ∈ ((𝐽 CnP 𝐾)‘𝐷) ↔ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)):𝑋⟶X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘) ∧ ∀𝑓 ∈ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)))))
85	18, 70, 84	mpbir2and 726	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) ∈ ((𝐽 CnP 𝐾)‘𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2146  {cab 2743  ∀wral 3081  ∃wrex 3091   ∖ cdif 3903   ⊆ wss 3906  ∪ cuni 4874   ↦ cmpt 5194   “ cima 5666   Fn wfn 6535  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  Xcixp 8901  Fincfn 8949  topGenctg 17514  ∏_tcpt 17515  Topctop 23102  TopOnctopon 23119   CnP ccnp 23434

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-iin 4961  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-1o 8459  df-2o 8460  df-map 8832  df-ixp 8902  df-en 8950  df-dom 8951  df-fin 8953  df-fi 9378  df-topgen 17520  df-pt 17521  df-top 23103  df-topon 23120  df-bases 23155  df-cnp 23437

This theorem is used by:  ptcn  23837