ptcnp - Metamath Proof Explorer

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

Theorem ptcnp 23525

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 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → 𝐽 ∈ (TopOn‘𝑋))
3		ptcnp.5	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐼⟶Top)
4	3	ffvelcdmda 7094	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝐹‘𝑘) ∈ Top)
5		toptopon2 22819	. . . . . . . . 9 ⊢ ((𝐹‘𝑘) ∈ Top ↔ (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)))
6	4, 5	sylib 217	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)))
7		ptcnp.7	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ ((𝐽 CnP (𝐹‘𝑘))‘𝐷))
8		cnpf2 23153	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)) ∧ (𝑥 ∈ 𝑋 ↦ 𝐴) ∈ ((𝐽 CnP (𝐹‘𝑘))‘𝐷)) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶∪ (𝐹‘𝑘))
9	2, 6, 7, 8	syl3anc 1369	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐼) → (𝑥 ∈ 𝑋 ↦ 𝐴):𝑋⟶∪ (𝐹‘𝑘))
10	9	fvmptelcdm 7123	. . . . . 6 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐼) ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ ∪ (𝐹‘𝑘))
11	10	an32s 651	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ 𝑘 ∈ 𝐼) → 𝐴 ∈ ∪ (𝐹‘𝑘))
12	11	ralrimiva 3143	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∀𝑘 ∈ 𝐼 𝐴 ∈ ∪ (𝐹‘𝑘))
13		ptcnp.4	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
14	13	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐼 ∈ 𝑉)
15		mptelixpg 8953	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → ((𝑘 ∈ 𝐼 ↦ 𝐴) ∈ X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘) ↔ ∀𝑘 ∈ 𝐼 𝐴 ∈ ∪ (𝐹‘𝑘)))
16	14, 15	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝑘 ∈ 𝐼 ↦ 𝐴) ∈ X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘) ↔ ∀𝑘 ∈ 𝐼 𝐴 ∈ ∪ (𝐹‘𝑘)))
17	12, 16	mpbird 257	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑘 ∈ 𝐼 ↦ 𝐴) ∈ X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘))
18	17	fmpttd 7125	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)):𝑋⟶X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘))
19		df-3an 1087	. . . . . . . 8 ⊢ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ↔ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)))
20		ptcnp.2	. . . . . . . . . . . . 13 ⊢ 𝐾 = (∏_t‘𝐹)
21		ptcnp.6	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 ∈ 𝑋)
22		nfv 1910	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘(𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))
23		nfv 1910	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))
24		nfcv 2899	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘𝑋
25		nfmpt1 5256	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘(𝑘 ∈ 𝐼 ↦ 𝐴)
26	24, 25	nfmpt 5255	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘(𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))
27		nfcv 2899	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘𝐷
28	26, 27	nffv 6907	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷)
29	28	nfel1 2916	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)
30	23, 29	nfan 1895	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑘((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛))
31	22, 30	nfan 1895	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))
32		simprll 778	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → 𝑔 Fn 𝐼)
33		simprlr 779	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))
34		fveq2 6897	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (𝑔‘𝑛) = (𝑔‘𝑘))
35		fveq2 6897	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
36	34, 35	eleq12d 2823	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → ((𝑔‘𝑛) ∈ (𝐹‘𝑛) ↔ (𝑔‘𝑘) ∈ (𝐹‘𝑘)))
37	36	rspccva 3608	. . . . . . . . . . . . . 14 ⊢ ((∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ 𝑘 ∈ 𝐼) → (𝑔‘𝑘) ∈ (𝐹‘𝑘))
38	33, 37	sylan 579	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) ∧ 𝑘 ∈ 𝐼) → (𝑔‘𝑘) ∈ (𝐹‘𝑘))
39		simprrl 780	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → (𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)))
40	39	simpld 494	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → 𝑤 ∈ Fin)
41	39	simprd 495	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))
42	35	unieqd 4921	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑘 → ∪ (𝐹‘𝑛) = ∪ (𝐹‘𝑘))
43	34, 42	eqeq12d 2744	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑘 → ((𝑔‘𝑛) = ∪ (𝐹‘𝑛) ↔ (𝑔‘𝑘) = ∪ (𝐹‘𝑘)))
44	43	rspccva 3608	. . . . . . . . . . . . . 14 ⊢ ((∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛) ∧ 𝑘 ∈ (𝐼 ∖ 𝑤)) → (𝑔‘𝑘) = ∪ (𝐹‘𝑘))
45	41, 44	sylan 579	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) ∧ 𝑘 ∈ (𝐼 ∖ 𝑤)) → (𝑔‘𝑘) = ∪ (𝐹‘𝑘))
46		simprrr 781	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛))
47	34	cbvixpv 8933	. . . . . . . . . . . . . 14 ⊢ X𝑛 ∈ 𝐼 (𝑔‘𝑛) = X𝑘 ∈ 𝐼 (𝑔‘𝑘)
48	46, 47	eleqtrdi 2839	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑘 ∈ 𝐼 (𝑔‘𝑘))
49	20, 1, 13, 3, 21, 7, 31, 32, 38, 40, 45, 48	ptcnplem 23524	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))
50	49	anassrs 467	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))) ∧ ((𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛))) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))
51	50	expr 456	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))) ∧ (𝑤 ∈ Fin ∧ ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
52	51	rexlimdvaa 3153	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛))) → (∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))))
53	52	impr 454	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛)) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
54	19, 53	sylan2b 593	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
55		eleq2 2818	. . . . . . . 8 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 ↔ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛)))
56	47	eqeq2i 2741	. . . . . . . . . . . 12 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) ↔ 𝑓 = X𝑘 ∈ 𝐼 (𝑔‘𝑘))
57	56	biimpi 215	. . . . . . . . . . 11 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → 𝑓 = X𝑘 ∈ 𝐼 (𝑔‘𝑘))
58	57	sseq2d 4012	. . . . . . . . . 10 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓 ↔ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))
59	58	anbi2d 629	. . . . . . . . 9 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ((𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓) ↔ (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
60	59	rexbidv 3175	. . . . . . . 8 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓) ↔ ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘))))
61	55, 60	imbi12d 344	. . . . . . 7 ⊢ (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ((((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)) ↔ (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ X𝑛 ∈ 𝐼 (𝑔‘𝑛) → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ X𝑘 ∈ 𝐼 (𝑔‘𝑘)))))
62	54, 61	syl5ibrcom 246	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛))) → (𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
63	62	expimpd 453	. . . . 5 ⊢ (𝜑 → (((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
64	63	exlimdv 1929	. . . 4 ⊢ (𝜑 → (∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
65	64	alrimiv 1923	. . 3 ⊢ (𝜑 → ∀𝑓(∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
66		eqeq1 2732	. . . . . 6 ⊢ (𝑎 = 𝑓 → (𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛) ↔ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)))
67	66	anbi2d 629	. . . . 5 ⊢ (𝑎 = 𝑓 → (((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) ↔ ((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))))
68	67	exbidv 1917	. . . 4 ⊢ (𝑎 = 𝑓 → (∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) ↔ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))))
69	68	ralab 3686	. . 3 ⊢ (∀𝑓 ∈ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)) ↔ ∀𝑓(∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑓 = X𝑛 ∈ 𝐼 (𝑔‘𝑛)) → (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓))))
70	65, 69	sylibr 233	. 2 ⊢ (𝜑 → ∀𝑓 ∈ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)))
71	3	ffnd 6723	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐼)
72		eqid 2728	. . . . . 6 ⊢ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} = {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}
73	72	ptval 23473	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐹 Fn 𝐼) → (∏_t‘𝐹) = (topGen‘{𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}))
74	13, 71, 73	syl2anc 583	. . . 4 ⊢ (𝜑 → (∏_t‘𝐹) = (topGen‘{𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}))
75	20, 74	eqtrid 2780	. . 3 ⊢ (𝜑 → 𝐾 = (topGen‘{𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))}))
76	3	feqmptd 6967	. . . . . 6 ⊢ (𝜑 → 𝐹 = (𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘)))
77	76	fveq2d 6901	. . . . 5 ⊢ (𝜑 → (∏_t‘𝐹) = (∏_t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))))
78	20, 77	eqtrid 2780	. . . 4 ⊢ (𝜑 → 𝐾 = (∏_t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))))
79	6	ralrimiva 3143	. . . . 5 ⊢ (𝜑 → ∀𝑘 ∈ 𝐼 (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘)))
80		eqid 2728	. . . . . 6 ⊢ (∏_t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))) = (∏_t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘)))
81	80	pttopon 23499	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 (𝐹‘𝑘) ∈ (TopOn‘∪ (𝐹‘𝑘))) → (∏_t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))) ∈ (TopOn‘X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘)))
82	13, 79, 81	syl2anc 583	. . . 4 ⊢ (𝜑 → (∏_t‘(𝑘 ∈ 𝐼 ↦ (𝐹‘𝑘))) ∈ (TopOn‘X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘)))
83	78, 82	eqeltrd 2829	. . 3 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘)))
84	1, 75, 83, 21	tgcnp 23156	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) ∈ ((𝐽 CnP 𝐾)‘𝐷) ↔ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)):𝑋⟶X𝑘 ∈ 𝐼 ∪ (𝐹‘𝑘) ∧ ∀𝑓 ∈ {𝑎 ∣ ∃𝑔((𝑔 Fn 𝐼 ∧ ∀𝑛 ∈ 𝐼 (𝑔‘𝑛) ∈ (𝐹‘𝑛) ∧ ∃𝑤 ∈ Fin ∀𝑛 ∈ (𝐼 ∖ 𝑤)(𝑔‘𝑛) = ∪ (𝐹‘𝑛)) ∧ 𝑎 = X𝑛 ∈ 𝐼 (𝑔‘𝑛))} (((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴))‘𝐷) ∈ 𝑓 → ∃𝑧 ∈ 𝐽 (𝐷 ∈ 𝑧 ∧ ((𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) “ 𝑧) ⊆ 𝑓)))))
85	18, 70, 84	mpbir2and 712	1 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝑘 ∈ 𝐼 ↦ 𝐴)) ∈ ((𝐽 CnP 𝐾)‘𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 ∀wal 1532 = wceq 1534 ∃wex 1774 ∈ wcel 2099 {cab 2705 ∀wral 3058 ∃wrex 3067 ∖ cdif 3944 ⊆ wss 3947 ∪ cuni 4908 ↦ cmpt 5231 “ cima 5681 Fn wfn 6543 ⟶wf 6544 ‘cfv 6548 (class class class)co 7420 Xcixp 8915 Fincfn 8963 topGenctg 17418 ∏_tcpt 17419 Topctop 22794 TopOnctopon 22811 CnP ccnp 23128

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-1o 8486 df-er 8724 df-map 8846 df-ixp 8916 df-en 8964 df-dom 8965 df-fin 8967 df-fi 9434 df-topgen 17424 df-pt 17425 df-top 22795 df-topon 22812 df-bases 22848 df-cnp 23131

This theorem is referenced by: ptcn 23530

W3C validator