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

Theorem ptpjcn 23945
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.
StepHypRef Expression
1 ptpjcn.1 . . . 4 𝑌 = ∪ 𝐽
2 ptpjcn.2 . . . . . 6 𝐽 = (∏t‘𝐹)
32ptuni 23928 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
433adant3 1150 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ 𝐽)
51, 4eqtr4id 2817 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝑌 = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
65mpteq1d 5198 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) = (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)))
7 pttop 23916 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∏t‘𝐹) ∈ Top)
873adant3 1150 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (∏t‘𝐹) ∈ Top)
92, 8eqeltrid 2868 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → 𝐽 ∈ Top)
10 ffvelcdm 7092 . . . 4 ((𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
11103adant1 1148 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝐹‘𝐼) ∈ Top)
12 vex 3458 . . . . . . . . . 10 𝑥 ∈ V
1312elixp 8946 . . . . . . . . 9 (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↔ (𝑥 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)))
1413simprbi 503 . . . . . . . 8 (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘))
15 fveq2 6896 . . . . . . . . . 10 (𝑘 = 𝐼 → (𝑥‘𝑘) = (𝑥‘𝐼))
16 fveq2 6896 . . . . . . . . . . 11 (𝑘 = 𝐼 → (𝐹‘𝑘) = (𝐹‘𝐼))
1716unieqd 4883 . . . . . . . . . 10 (𝑘 = 𝐼 → ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝐼))
1815, 17eleq12d 2858 . . . . . . . . 9 (𝑘 = 𝐼 → ((𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘) ↔ (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼)))
1918rspcva 3578 . . . . . . . 8 ((𝐼 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑥‘𝑘) ∈ ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
2014, 19sylan2 605 . . . . . . 7 ((𝐼 ∈ 𝐴 ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
21203ad2antl3 1206 . . . . . 6 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) ∧ 𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)) → (𝑥‘𝐼) ∈ ∪ (𝐹‘𝐼))
2221fmpttd 7126 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼))
235feq2d 6704 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ↔ (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)⟶∪ (𝐹‘𝐼)))
2422, 23mpbird 260 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼))
25 eqid 2763 . . . . . . . . . . . 12 {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
2625ptbas 23913 . . . . . . . . . . 11 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
27 bastg 23299 . . . . . . . . . . 11 ({𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
2826, 27syl 18 . . . . . . . . . 10 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
29 ffn 6720 . . . . . . . . . . 11 (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
3025ptval 23904 . . . . . . . . . . . 12 ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → (∏t‘𝐹) = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
312, 30eqtrid 2810 . . . . . . . . . . 11 ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
3229, 31sylan2 605 . . . . . . . . . 10 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
3328, 32sseqtrrd 3950 . . . . . . . . 9 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
3433adantr 486 . . . . . . . 8 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ⊆ 𝐽)
35 eqid 2763 . . . . . . . . 9 X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘)
3625, 35ptpjpre2 23914 . . . . . . . 8 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ {𝑤 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑤 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))})
3734, 36sseldd 3914 . . . . . . 7 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ (𝐼 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝐼))) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
3837expr 462 . . . . . 6 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → (𝑢 ∈ (𝐹‘𝐼) → (◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
3938ralrimiv 3157 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
40393impa 1127 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)
4124, 40jca 521 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽))
42 eqid 2763 . . . 4 ∪ (𝐹‘𝐼) = ∪ (𝐹‘𝐼)
431, 42iscn2 23571 . . 3 ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)) ↔ ((𝐽 ∈ Top ∧ (𝐹‘𝐼) ∈ Top) ∧ ((𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)):𝑌⟶∪ (𝐹‘𝐼) ∧ ∀𝑢 ∈ (𝐹‘𝐼)(◡(𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) “ 𝑢) ∈ 𝐽)))
449, 11, 41, 43syl21anbrc 1363 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))
456, 44eqeltrd 2864 1 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top ∧ 𝐼 ∈ 𝐴) → (𝑥 ∈ 𝑌 ↦ (𝑥‘𝐼)) ∈ (𝐽 Cn (𝐹‘𝐼)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2146  {cab 2741  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∖ cdif 4048  ∪ cuni 4870   ↦ cmpt 5189  ◡ccnv 5654   “ cima 5658   Fn wfn 6542  ⟶wf 6543  ‘cfv 6547  (class class class)co 7430  Xcixp 8939  Fincfn 8987  topGenctg 17623  ∏tcpt 17624  Topctop 23226  TopBasesctb 23278   Cn ccn 23557
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  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 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1o 8490  df-2o 8491  df-map 8863  df-ixp 8940  df-en 8988  df-fin 8991  df-fi 9416  df-topgen 17629  df-pt 17630  df-top 23227  df-topon 23244  df-bases 23279  df-cn 23560
This theorem is used by:  pthaus  23972  ptrescn  23973  xkopjcn  23990  pt1hmeo  24140  ptunhmeo  24142  tmdgsum  24429  symgtgp  24440  prdstmdd  24458  prdstgpd  24459  poimir  38717  broucube  38718
  Copyright terms: Public domain W3C validator