Theorem ptpjcn 23777

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 23760	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
4	3	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
5	1, 4	eqtr4id 2817	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝑌 = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
6	5	mpteq1d 5201	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) = (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)))
7		pttop 23748	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∏t‘𝐹) ∈ Top)
8	7	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (∏t‘𝐹) ∈ Top)
9	2, 8	eqeltrid 2867	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝐽 ∈ Top)
10		ffvelcdm 7076	. . . 4 ⊢ ((𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
11	10	3adant1 1148	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
12		vex 3459	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
13	12	elixp 8898	. . . . . . . . 9 ⊢ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ (𝑥 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)))
14	13	simprbi 502	. . . . . . . 8 ⊢ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘))
15		fveq2 6881	. . . . . . . . . 10 ⊢ (𝑘 = 𝐼 → (𝑥‘𝑘) = (𝑥‘𝐼))
16		fveq2 6881	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐼 → (𝐹‘𝑘) = (𝐹‘𝐼))
17	16	unieqd 4885	. . . . . . . . . 10 ⊢ (𝑘 = 𝐼 → ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝐼))
18	15, 17	eleq12d 2857	. . . . . . . . 9 ⊢ (𝑘 = 𝐼 → ((𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘) ↔ (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼)))
19	18	rspcva 3579	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
20	14, 19	sylan2 604	. . . . . . 7 ⊢ ((𝐼 ∈ 𝐴 ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
21	20	3ad2antl3 1206	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
22	21	fmpttd 7110	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼))
23	5	feq2d 6689	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ↔ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼)))
24	22, 23	mpbird 260	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼))
25		eqid 2763	. . . . . . . . . . . 12 ⊢ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
26	25	ptbas 23745	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
27		bastg 23132	. . . . . . . . . . 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 6705	. . . . . . . . . . 11 ⊢ (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
30	25	ptval 23736	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → (∏t‘𝐹) = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
31	2, 30	eqtrid 2810	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
32	29, 31	sylan2 604	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
33	28, 32	sseqtrrd 3974	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
34	33	adantr 485	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
35		eqid 2763	. . . . . . . . 9 ⊢ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)
36	25, 35	ptpjpre2 23746	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))})
37	34, 36	sseldd 3938	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
38	37	expr 461	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → (𝑢 ∈ (𝐹‘𝐼) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
39	38	ralrimiv 3156	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
40	39	3impa 1127	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
41	24, 40	jca 520	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
42		eqid 2763	. . . 4 ⊢ ∪ (𝐹‘𝐼) = ∪ (𝐹‘𝐼)
43	1, 42	iscn2 23404	. . 3 ⊢ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)) ↔ ((𝐽 ∈ Top ∧ (𝐹‘𝐼) ∈ Top) ∧ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)))
44	9, 11, 41, 43	syl21anbrc 1363	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))
45	6, 44	eqeltrd 2863	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570  ∃wex 1809   ∈ wcel 2143  {cab 2741  ∀wral 3079  ∃wrex 3089   ∖ cdif 3902   ⊆ wss 3905  ∪ cuni 4872   ↦ cmpt 5192  ^◡ccnv 5660   “ cima 5664   Fn wfn 6531  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  Xcixp 8891  Fincfn 8939  topGenctg 17494  ∏_tcpt 17495  Topctop 23059  TopBasesctb 23111   Cn ccn 23390

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1o 8449  df-2o 8450  df-map 8822  df-ixp 8892  df-en 8940  df-fin 8943  df-fi 9367  df-topgen 17500  df-pt 17501  df-top 23060  df-topon 23077  df-bases 23112  df-cn 23393

This theorem is used by:  pthaus  23804  ptrescn  23805  xkopjcn  23822  pt1hmeo  23972  ptunhmeo  23974  tmdgsum  24261  symgtgp  24272  prdstmdd  24290  prdstgpd  24291  poimir  38332  broucube  38333