Theorem ptpjcn 23840

Description: Continuity of a projection map into a topological product. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 3-Feb-2015.)

Hypotheses

Ref	Expression
ptpjcn.1	⊢ 𝑌 = ∪ 𝐽
ptpjcn.2	⊢ 𝐽 = (∏t‘𝐹)

Assertion

Ref	Expression
ptpjcn	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐼   𝑥,𝑉   𝑥,𝑌

Allowed substitution hint:   𝐽(𝑥)

Proof of Theorem ptpjcn

Dummy variables 𝑔 𝑘 𝑢 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptpjcn.1	. . . 4 ⊢ 𝑌 = ∪ 𝐽
2		ptpjcn.2	. . . . . 6 ⊢ 𝐽 = (∏t‘𝐹)
3	2	ptuni 23823	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
4	3	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
5	1, 4	eqtr4id 2814	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝑌 = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
6	5	mpteq1d 5195	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) = (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)))
7		pttop 23811	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∏t‘𝐹) ∈ Top)
8	7	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (∏t‘𝐹) ∈ Top)
9	2, 8	eqeltrid 2864	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝐽 ∈ Top)
10		ffvelcdm 7075	. . . 4 ⊢ ((𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
11	10	3adant1 1148	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
12		vex 3454	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
13	12	elixp 8914	. . . . . . . . 9 ⊢ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ (𝑥 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)))
14	13	simprbi 503	. . . . . . . 8 ⊢ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘))
15		fveq2 6879	. . . . . . . . . 10 ⊢ (𝑘 = 𝐼 → (𝑥‘𝑘) = (𝑥‘𝐼))
16		fveq2 6879	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐼 → (𝐹‘𝑘) = (𝐹‘𝐼))
17	16	unieqd 4880	. . . . . . . . . 10 ⊢ (𝑘 = 𝐼 → ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝐼))
18	15, 17	eleq12d 2854	. . . . . . . . 9 ⊢ (𝑘 = 𝐼 → ((𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘) ↔ (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼)))
19	18	rspcva 3574	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
20	14, 19	sylan2 605	. . . . . . 7 ⊢ ((𝐼 ∈ 𝐴 ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
21	20	3ad2antl3 1206	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
22	21	fmpttd 7109	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼))
23	5	feq2d 6687	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ↔ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼)))
24	22, 23	mpbird 260	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼))
25		eqid 2760	. . . . . . . . . . . 12 ⊢ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
26	25	ptbas 23808	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
27		bastg 23194	. . . . . . . . . . 11 ⊢ ({𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
28	26, 27	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
29		ffn 6703	. . . . . . . . . . 11 ⊢ (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
30	25	ptval 23799	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → (∏t‘𝐹) = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
31	2, 30	eqtrid 2807	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
32	29, 31	sylan2 605	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
33	28, 32	sseqtrrd 3968	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
34	33	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
35		eqid 2760	. . . . . . . . 9 ⊢ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)
36	25, 35	ptpjpre2 23809	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))})
37	34, 36	sseldd 3932	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
38	37	expr 462	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → (𝑢 ∈ (𝐹‘𝐼) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
39	38	ralrimiv 3153	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
40	39	3impa 1127	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
41	24, 40	jca 521	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
42		eqid 2760	. . . 4 ⊢ ∪ (𝐹‘𝐼) = ∪ (𝐹‘𝐼)
43	1, 42	iscn2 23466	. . 3 ⊢ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)) ↔ ((𝐽 ∈ Top ∧ (𝐹‘𝐼) ∈ Top) ∧ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)))
44	9, 11, 41, 43	syl21anbrc 1363	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))
45	6, 44	eqeltrd 2860	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738  ∀wral 3076  ∃wrex 3086   ∖ cdif 3896   ⊆ wss 3899  ∪ cuni 4867   ↦ cmpt 5186  ^◡ccnv 5654   “ cima 5658   Fn wfn 6528  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  Xcixp 8907  Fincfn 8955  topGenctg 17525  ∏_tcpt 17526  Topctop 23121  TopBasesctb 23173   Cn ccn 23452

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1o 8458  df-2o 8459  df-map 8831  df-ixp 8908  df-en 8956  df-fin 8959  df-fi 9384  df-topgen 17531  df-pt 17532  df-top 23122  df-topon 23139  df-bases 23174  df-cn 23455

This theorem is used by:  pthaus  23867  ptrescn  23868  xkopjcn  23885  pt1hmeo  24035  ptunhmeo  24037  tmdgsum  24324  symgtgp  24335  prdstmdd  24353  prdstgpd  24354  poimir  38405  broucube  38406