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

Theorem txcnmpt 22224
Description: A map into the product of two topological spaces is continuous if both of its projections are continuous. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 22-Aug-2015.)
Hypotheses
Ref Expression
txcnmpt.1 𝑊 = 𝑈
txcnmpt.2 𝐻 = (𝑥𝑊 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)
Assertion
Ref Expression
txcnmpt ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻 ∈ (𝑈 Cn (𝑅 ×t 𝑆)))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝑅   𝑥,𝑆   𝑥,𝑈   𝑥,𝑊
Allowed substitution hint:   𝐻(𝑥)

Proof of Theorem txcnmpt
Dummy variables 𝑠 𝑟 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 txcnmpt.1 . . . . . . 7 𝑊 = 𝑈
2 eqid 2819 . . . . . . 7 𝑅 = 𝑅
31, 2cnf 21846 . . . . . 6 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝐹:𝑊 𝑅)
43adantr 483 . . . . 5 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐹:𝑊 𝑅)
54ffvelrnda 6844 . . . 4 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥𝑊) → (𝐹𝑥) ∈ 𝑅)
6 eqid 2819 . . . . . . 7 𝑆 = 𝑆
71, 6cnf 21846 . . . . . 6 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝐺:𝑊 𝑆)
87adantl 484 . . . . 5 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐺:𝑊 𝑆)
98ffvelrnda 6844 . . . 4 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥𝑊) → (𝐺𝑥) ∈ 𝑆)
105, 9opelxpd 5586 . . 3 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥𝑊) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ ( 𝑅 × 𝑆))
11 txcnmpt.2 . . 3 𝐻 = (𝑥𝑊 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)
1210, 11fmptd 6871 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻:𝑊⟶( 𝑅 × 𝑆))
1311mptpreima 6085 . . . . . 6 (𝐻 “ (𝑟 × 𝑠)) = {𝑥𝑊 ∣ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)}
144adantr 483 . . . . . . . . . . . . 13 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → 𝐹:𝑊 𝑅)
1514adantr 483 . . . . . . . . . . . 12 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → 𝐹:𝑊 𝑅)
16 ffn 6507 . . . . . . . . . . . 12 (𝐹:𝑊 𝑅𝐹 Fn 𝑊)
17 elpreima 6821 . . . . . . . . . . . 12 (𝐹 Fn 𝑊 → (𝑥 ∈ (𝐹𝑟) ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
1815, 16, 173syl 18 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐹𝑟) ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
19 ibar 531 . . . . . . . . . . . 12 (𝑥𝑊 → ((𝐹𝑥) ∈ 𝑟 ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
2019adantl 484 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → ((𝐹𝑥) ∈ 𝑟 ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
2118, 20bitr4d 284 . . . . . . . . . 10 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐹𝑟) ↔ (𝐹𝑥) ∈ 𝑟))
228ad2antrr 724 . . . . . . . . . . . 12 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → 𝐺:𝑊 𝑆)
23 ffn 6507 . . . . . . . . . . . 12 (𝐺:𝑊 𝑆𝐺 Fn 𝑊)
24 elpreima 6821 . . . . . . . . . . . 12 (𝐺 Fn 𝑊 → (𝑥 ∈ (𝐺𝑠) ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
2522, 23, 243syl 18 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐺𝑠) ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
26 ibar 531 . . . . . . . . . . . 12 (𝑥𝑊 → ((𝐺𝑥) ∈ 𝑠 ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
2726adantl 484 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → ((𝐺𝑥) ∈ 𝑠 ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
2825, 27bitr4d 284 . . . . . . . . . 10 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐺𝑠) ↔ (𝐺𝑥) ∈ 𝑠))
2921, 28anbi12d 632 . . . . . . . . 9 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → ((𝑥 ∈ (𝐹𝑟) ∧ 𝑥 ∈ (𝐺𝑠)) ↔ ((𝐹𝑥) ∈ 𝑟 ∧ (𝐺𝑥) ∈ 𝑠)))
30 elin 4167 . . . . . . . . 9 (𝑥 ∈ ((𝐹𝑟) ∩ (𝐺𝑠)) ↔ (𝑥 ∈ (𝐹𝑟) ∧ 𝑥 ∈ (𝐺𝑠)))
31 opelxp 5584 . . . . . . . . 9 (⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠) ↔ ((𝐹𝑥) ∈ 𝑟 ∧ (𝐺𝑥) ∈ 𝑠))
3229, 30, 313bitr4g 316 . . . . . . . 8 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ ((𝐹𝑟) ∩ (𝐺𝑠)) ↔ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)))
3332rabbi2dva 4192 . . . . . . 7 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝑊 ∩ ((𝐹𝑟) ∩ (𝐺𝑠))) = {𝑥𝑊 ∣ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)})
34 inss1 4203 . . . . . . . . . 10 ((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ (𝐹𝑟)
35 cnvimass 5942 . . . . . . . . . 10 (𝐹𝑟) ⊆ dom 𝐹
3634, 35sstri 3974 . . . . . . . . 9 ((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ dom 𝐹
3736, 14fssdm 6523 . . . . . . . 8 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → ((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ 𝑊)
38 sseqin2 4190 . . . . . . . 8 (((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ 𝑊 ↔ (𝑊 ∩ ((𝐹𝑟) ∩ (𝐺𝑠))) = ((𝐹𝑟) ∩ (𝐺𝑠)))
3937, 38sylib 220 . . . . . . 7 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝑊 ∩ ((𝐹𝑟) ∩ (𝐺𝑠))) = ((𝐹𝑟) ∩ (𝐺𝑠)))
4033, 39eqtr3d 2856 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → {𝑥𝑊 ∣ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)} = ((𝐹𝑟) ∩ (𝐺𝑠)))
4113, 40syl5eq 2866 . . . . 5 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐻 “ (𝑟 × 𝑠)) = ((𝐹𝑟) ∩ (𝐺𝑠)))
42 cntop1 21840 . . . . . . . 8 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑈 ∈ Top)
4342adantl 484 . . . . . . 7 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ Top)
4443adantr 483 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → 𝑈 ∈ Top)
45 cnima 21865 . . . . . . 7 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝑟𝑅) → (𝐹𝑟) ∈ 𝑈)
4645ad2ant2r 745 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐹𝑟) ∈ 𝑈)
47 cnima 21865 . . . . . . 7 ((𝐺 ∈ (𝑈 Cn 𝑆) ∧ 𝑠𝑆) → (𝐺𝑠) ∈ 𝑈)
4847ad2ant2l 744 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐺𝑠) ∈ 𝑈)
49 inopn 21499 . . . . . 6 ((𝑈 ∈ Top ∧ (𝐹𝑟) ∈ 𝑈 ∧ (𝐺𝑠) ∈ 𝑈) → ((𝐹𝑟) ∩ (𝐺𝑠)) ∈ 𝑈)
5044, 46, 48, 49syl3anc 1366 . . . . 5 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → ((𝐹𝑟) ∩ (𝐺𝑠)) ∈ 𝑈)
5141, 50eqeltrd 2911 . . . 4 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
5251ralrimivva 3189 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑟𝑅𝑠𝑆 (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
53 vex 3496 . . . . . 6 𝑟 ∈ V
54 vex 3496 . . . . . 6 𝑠 ∈ V
5553, 54xpex 7468 . . . . 5 (𝑟 × 𝑠) ∈ V
5655rgen2w 3149 . . . 4 𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V
57 eqid 2819 . . . . 5 (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
58 imaeq2 5918 . . . . . 6 (𝑧 = (𝑟 × 𝑠) → (𝐻𝑧) = (𝐻 “ (𝑟 × 𝑠)))
5958eleq1d 2895 . . . . 5 (𝑧 = (𝑟 × 𝑠) → ((𝐻𝑧) ∈ 𝑈 ↔ (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
6057, 59ralrnmpo 7281 . . . 4 (∀𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V → (∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈 ↔ ∀𝑟𝑅𝑠𝑆 (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
6156, 60ax-mp 5 . . 3 (∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈 ↔ ∀𝑟𝑅𝑠𝑆 (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
6252, 61sylibr 236 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈)
631toptopon 21517 . . . 4 (𝑈 ∈ Top ↔ 𝑈 ∈ (TopOn‘𝑊))
6443, 63sylib 220 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ (TopOn‘𝑊))
65 cntop2 21841 . . . 4 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ Top)
66 cntop2 21841 . . . 4 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ Top)
67 eqid 2819 . . . . 5 ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
6867txval 22164 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
6965, 66, 68syl2an 597 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
70 toptopon2 21518 . . . . 5 (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘ 𝑅))
7165, 70sylib 220 . . . 4 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ (TopOn‘ 𝑅))
72 toptopon2 21518 . . . . 5 (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘ 𝑆))
7366, 72sylib 220 . . . 4 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ (TopOn‘ 𝑆))
74 txtopon 22191 . . . 4 ((𝑅 ∈ (TopOn‘ 𝑅) ∧ 𝑆 ∈ (TopOn‘ 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘( 𝑅 × 𝑆)))
7571, 73, 74syl2an 597 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘( 𝑅 × 𝑆)))
7664, 69, 75tgcn 21852 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝐻 ∈ (𝑈 Cn (𝑅 ×t 𝑆)) ↔ (𝐻:𝑊⟶( 𝑅 × 𝑆) ∧ ∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈)))
7712, 62, 76mpbir2and 711 1 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻 ∈ (𝑈 Cn (𝑅 ×t 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1531  wcel 2108  wral 3136  {crab 3140  Vcvv 3493  cin 3933  wss 3934  cop 4565   cuni 4830  cmpt 5137   × cxp 5546  ccnv 5547  dom cdm 5548  ran crn 5549  cima 5551   Fn wfn 6343  wf 6344  cfv 6348  (class class class)co 7148  cmpo 7150  topGenctg 16703  Topctop 21493  TopOnctopon 21510   Cn ccn 21824   ×t ctx 22160
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 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-1st 7681  df-2nd 7682  df-map 8400  df-topgen 16709  df-top 21494  df-topon 21511  df-bases 21546  df-cn 21827  df-tx 22162
This theorem is referenced by:  uptx  22225  hauseqlcld  22246  txkgen  22252  cnmpt1t  22265  cnmpt2t  22273  txpconn  32472
  Copyright terms: Public domain W3C validator