Theorem ptpjcn 23823

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 23806	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
4	3	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
5	1, 4	eqtr4id 2819	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝑌 = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
6	5	mpteq1d 5203	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) = (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)))
7		pttop 23794	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∏t‘𝐹) ∈ Top)
8	7	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (∏t‘𝐹) ∈ Top)
9	2, 8	eqeltrid 2869	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝐽 ∈ Top)
10		ffvelcdm 7080	. . . 4 ⊢ ((𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
11	10	3adant1 1148	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
12		vex 3461	. . . . . . . . . 10 ⊢ 𝑥 ∈ V
13	12	elixp 8908	. . . . . . . . 9 ⊢ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ (𝑥 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)))
14	13	simprbi 503	. . . . . . . 8 ⊢ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘))
15		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑘 = 𝐼 → (𝑥‘𝑘) = (𝑥‘𝐼))
16		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑘 = 𝐼 → (𝐹‘𝑘) = (𝐹‘𝐼))
17	16	unieqd 4887	. . . . . . . . . 10 ⊢ (𝑘 = 𝐼 → ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝐼))
18	15, 17	eleq12d 2859	. . . . . . . . 9 ⊢ (𝑘 = 𝐼 → ((𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘) ↔ (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼)))
19	18	rspcva 3581	. . . . . . . 8 ⊢ ((𝐼 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
20	14, 19	sylan2 605	. . . . . . 7 ⊢ ((𝐼 ∈ 𝐴 ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
21	20	3ad2antl3 1206	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
22	21	fmpttd 7114	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼))
23	5	feq2d 6693	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ↔ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼)))
24	22, 23	mpbird 260	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼))
25		eqid 2765	. . . . . . . . . . . 12 ⊢ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
26	25	ptbas 23791	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
27		bastg 23177	. . . . . . . . . . 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 6709	. . . . . . . . . . 11 ⊢ (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
30	25	ptval 23782	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → (∏t‘𝐹) = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
31	2, 30	eqtrid 2812	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
32	29, 31	sylan2 605	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
33	28, 32	sseqtrrd 3975	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
34	33	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
35		eqid 2765	. . . . . . . . 9 ⊢ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)
36	25, 35	ptpjpre2 23792	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))})
37	34, 36	sseldd 3939	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
38	37	expr 462	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → (𝑢 ∈ (𝐹‘𝐼) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
39	38	ralrimiv 3158	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
40	39	3impa 1127	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
41	24, 40	jca 521	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
42		eqid 2765	. . . 4 ⊢ ∪ (𝐹‘𝐼) = ∪ (𝐹‘𝐼)
43	1, 42	iscn2 23449	. . 3 ⊢ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)) ↔ ((𝐽 ∈ Top ∧ (𝐹‘𝐼) ∈ Top) ∧ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)))
44	9, 11, 41, 43	syl21anbrc 1363	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))
45	6, 44	eqeltrd 2865	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2146  {cab 2743  ∀wral 3081  ∃wrex 3091   ∖ cdif 3903   ⊆ wss 3906  ∪ cuni 4874   ↦ cmpt 5194  ^◡ccnv 5662   “ cima 5666   Fn wfn 6535  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  Xcixp 8901  Fincfn 8949  topGenctg 17516  ∏_tcpt 17517  Topctop 23104  TopBasesctb 23156   Cn ccn 23435

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-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-1o 8459  df-2o 8460  df-map 8832  df-ixp 8902  df-en 8950  df-fin 8953  df-fi 9378  df-topgen 17522  df-pt 17523  df-top 23105  df-topon 23122  df-bases 23157  df-cn 23438

This theorem is used by:  pthaus  23850  ptrescn  23851  xkopjcn  23868  pt1hmeo  24018  ptunhmeo  24020  tmdgsum  24307  symgtgp  24318  prdstmdd  24336  prdstgpd  24337  poimir  38365  broucube  38366