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

Theorem txcnmpt 23764
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 2770 . . . . . . 7 𝑅 = 𝑅
31, 2cnf 23386 . . . . . 6 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝐹:𝑊 𝑅)
43adantr 485 . . . . 5 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐹:𝑊 𝑅)
54ffvelcdmda 7083 . . . 4 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥𝑊) → (𝐹𝑥) ∈ 𝑅)
6 eqid 2770 . . . . . . 7 𝑆 = 𝑆
71, 6cnf 23386 . . . . . 6 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝐺:𝑊 𝑆)
87adantl 486 . . . . 5 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐺:𝑊 𝑆)
98ffvelcdmda 7083 . . . 4 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥𝑊) → (𝐺𝑥) ∈ 𝑆)
105, 9opelxpd 5704 . . 3 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ 𝑥𝑊) → ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ ( 𝑅 × 𝑆))
11 txcnmpt.2 . . 3 𝐻 = (𝑥𝑊 ↦ ⟨(𝐹𝑥), (𝐺𝑥)⟩)
1210, 11fmptd 7113 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻:𝑊⟶( 𝑅 × 𝑆))
1311mptpreima 6243 . . . . . 6 (𝐻 “ (𝑟 × 𝑠)) = {𝑥𝑊 ∣ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)}
144adantr 485 . . . . . . . . . . . . 13 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → 𝐹:𝑊 𝑅)
1514adantr 485 . . . . . . . . . . . 12 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → 𝐹:𝑊 𝑅)
16 ffn 6709 . . . . . . . . . . . 12 (𝐹:𝑊 𝑅𝐹 Fn 𝑊)
17 elpreima 7057 . . . . . . . . . . . 12 (𝐹 Fn 𝑊 → (𝑥 ∈ (𝐹𝑟) ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
1815, 16, 173syl 19 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐹𝑟) ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
19 ibar 537 . . . . . . . . . . . 12 (𝑥𝑊 → ((𝐹𝑥) ∈ 𝑟 ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
2019adantl 486 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → ((𝐹𝑥) ∈ 𝑟 ↔ (𝑥𝑊 ∧ (𝐹𝑥) ∈ 𝑟)))
2118, 20bitr4d 285 . . . . . . . . . 10 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐹𝑟) ↔ (𝐹𝑥) ∈ 𝑟))
228ad2antrr 738 . . . . . . . . . . . 12 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → 𝐺:𝑊 𝑆)
23 ffn 6709 . . . . . . . . . . . 12 (𝐺:𝑊 𝑆𝐺 Fn 𝑊)
24 elpreima 7057 . . . . . . . . . . . 12 (𝐺 Fn 𝑊 → (𝑥 ∈ (𝐺𝑠) ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
2522, 23, 243syl 19 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐺𝑠) ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
26 ibar 537 . . . . . . . . . . . 12 (𝑥𝑊 → ((𝐺𝑥) ∈ 𝑠 ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
2726adantl 486 . . . . . . . . . . 11 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → ((𝐺𝑥) ∈ 𝑠 ↔ (𝑥𝑊 ∧ (𝐺𝑥) ∈ 𝑠)))
2825, 27bitr4d 285 . . . . . . . . . 10 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ (𝐺𝑠) ↔ (𝐺𝑥) ∈ 𝑠))
2921, 28anbi12d 643 . . . . . . . . 9 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → ((𝑥 ∈ (𝐹𝑟) ∧ 𝑥 ∈ (𝐺𝑠)) ↔ ((𝐹𝑥) ∈ 𝑟 ∧ (𝐺𝑥) ∈ 𝑠)))
30 elin 3929 . . . . . . . . 9 (𝑥 ∈ ((𝐹𝑟) ∩ (𝐺𝑠)) ↔ (𝑥 ∈ (𝐹𝑟) ∧ 𝑥 ∈ (𝐺𝑠)))
31 opelxp 5701 . . . . . . . . 9 (⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠) ↔ ((𝐹𝑥) ∈ 𝑟 ∧ (𝐺𝑥) ∈ 𝑠))
3229, 30, 313bitr4g 317 . . . . . . . 8 ((((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) ∧ 𝑥𝑊) → (𝑥 ∈ ((𝐹𝑟) ∩ (𝐺𝑠)) ↔ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)))
3332rabbi2dva 4186 . . . . . . 7 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝑊 ∩ ((𝐹𝑟) ∩ (𝐺𝑠))) = {𝑥𝑊 ∣ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)})
34 inss1 4197 . . . . . . . . . 10 ((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ (𝐹𝑟)
35 cnvimass 6088 . . . . . . . . . 10 (𝐹𝑟) ⊆ dom 𝐹
3634, 35sstri 3954 . . . . . . . . 9 ((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ dom 𝐹
3736, 14fssdm 6729 . . . . . . . 8 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → ((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ 𝑊)
38 sseqin2 4184 . . . . . . . 8 (((𝐹𝑟) ∩ (𝐺𝑠)) ⊆ 𝑊 ↔ (𝑊 ∩ ((𝐹𝑟) ∩ (𝐺𝑠))) = ((𝐹𝑟) ∩ (𝐺𝑠)))
3937, 38sylib 221 . . . . . . 7 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝑊 ∩ ((𝐹𝑟) ∩ (𝐺𝑠))) = ((𝐹𝑟) ∩ (𝐺𝑠)))
4033, 39eqtr3d 2807 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → {𝑥𝑊 ∣ ⟨(𝐹𝑥), (𝐺𝑥)⟩ ∈ (𝑟 × 𝑠)} = ((𝐹𝑟) ∩ (𝐺𝑠)))
4113, 40eqtrid 2817 . . . . 5 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐻 “ (𝑟 × 𝑠)) = ((𝐹𝑟) ∩ (𝐺𝑠)))
42 cntop1 23380 . . . . . . . 8 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑈 ∈ Top)
4342adantl 486 . . . . . . 7 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ Top)
4443adantr 485 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → 𝑈 ∈ Top)
45 cnima 23405 . . . . . . 7 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝑟𝑅) → (𝐹𝑟) ∈ 𝑈)
4645ad2ant2r 759 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐹𝑟) ∈ 𝑈)
47 cnima 23405 . . . . . . 7 ((𝐺 ∈ (𝑈 Cn 𝑆) ∧ 𝑠𝑆) → (𝐺𝑠) ∈ 𝑈)
4847ad2ant2l 758 . . . . . 6 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐺𝑠) ∈ 𝑈)
49 inopn 23039 . . . . . 6 ((𝑈 ∈ Top ∧ (𝐹𝑟) ∈ 𝑈 ∧ (𝐺𝑠) ∈ 𝑈) → ((𝐹𝑟) ∩ (𝐺𝑠)) ∈ 𝑈)
5044, 46, 48, 49syl3anc 1396 . . . . 5 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → ((𝐹𝑟) ∩ (𝐺𝑠)) ∈ 𝑈)
5141, 50eqeltrd 2870 . . . 4 (((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) ∧ (𝑟𝑅𝑠𝑆)) → (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
5251ralrimivva 3215 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑟𝑅𝑠𝑆 (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
53 vex 3466 . . . . . 6 𝑟 ∈ V
54 vex 3466 . . . . . 6 𝑠 ∈ V
5553, 54xpex 7755 . . . . 5 (𝑟 × 𝑠) ∈ V
5655rgen2w 3091 . . . 4 𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V
57 eqid 2770 . . . . 5 (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
58 imaeq2 6062 . . . . . 6 (𝑧 = (𝑟 × 𝑠) → (𝐻𝑧) = (𝐻 “ (𝑟 × 𝑠)))
5958eleq1d 2855 . . . . 5 (𝑧 = (𝑟 × 𝑠) → ((𝐻𝑧) ∈ 𝑈 ↔ (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
6057, 59ralrnmpo 7553 . . . 4 (∀𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V → (∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈 ↔ ∀𝑟𝑅𝑠𝑆 (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈))
6156, 60ax-mp 5 . . 3 (∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈 ↔ ∀𝑟𝑅𝑠𝑆 (𝐻 “ (𝑟 × 𝑠)) ∈ 𝑈)
6252, 61sylibr 237 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → ∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈)
631toptopon 23057 . . . 4 (𝑈 ∈ Top ↔ 𝑈 ∈ (TopOn‘𝑊))
6443, 63sylib 221 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝑈 ∈ (TopOn‘𝑊))
65 cntop2 23381 . . . 4 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ Top)
66 cntop2 23381 . . . 4 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ Top)
67 eqid 2770 . . . . 5 ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
6867txval 23704 . . . 4 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
6965, 66, 68syl2an 607 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
70 toptopon2 23058 . . . . 5 (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘ 𝑅))
7165, 70sylib 221 . . . 4 (𝐹 ∈ (𝑈 Cn 𝑅) → 𝑅 ∈ (TopOn‘ 𝑅))
72 toptopon2 23058 . . . . 5 (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘ 𝑆))
7366, 72sylib 221 . . . 4 (𝐺 ∈ (𝑈 Cn 𝑆) → 𝑆 ∈ (TopOn‘ 𝑆))
74 txtopon 23731 . . . 4 ((𝑅 ∈ (TopOn‘ 𝑅) ∧ 𝑆 ∈ (TopOn‘ 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘( 𝑅 × 𝑆)))
7571, 73, 74syl2an 607 . . 3 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝑅 ×t 𝑆) ∈ (TopOn‘( 𝑅 × 𝑆)))
7664, 69, 75tgcn 23392 . 2 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → (𝐻 ∈ (𝑈 Cn (𝑅 ×t 𝑆)) ↔ (𝐻:𝑊⟶( 𝑅 × 𝑆) ∧ ∀𝑧 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))(𝐻𝑧) ∈ 𝑈)))
7712, 62, 76mpbir2and 725 1 ((𝐹 ∈ (𝑈 Cn 𝑅) ∧ 𝐺 ∈ (𝑈 Cn 𝑆)) → 𝐻 ∈ (𝑈 Cn (𝑅 ×t 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wcel 2150  wral 3086  {crab 3423  Vcvv 3462  cin 3912  wss 3913  cop 4600   cuni 4877  cmpt 5197   × cxp 5663  ccnv 5664  dom cdm 5665  ran crn 5666  cima 5668   Fn wfn 6535  wf 6536  cfv 6540  (class class class)co 7414  cmpo 7416  topGenctg 17493  Topctop 23033  TopOnctopon 23050   Cn ccn 23364   ×t ctx 23700
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742  ax-sep 5262  ax-nul 5274  ax-pow 5340  ax-pr 5408  ax-un 7736
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2099  df-mo 2574  df-eu 2604  df-clab 2749  df-cleq 2762  df-clel 2845  df-nfc 2919  df-ne 2966  df-ral 3087  df-rex 3097  df-rab 3424  df-v 3464  df-sbc 3753  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5560  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7989  df-2nd 7990  df-map 8829  df-topgen 17499  df-top 23034  df-topon 23051  df-bases 23086  df-cn 23367  df-tx 23702
This theorem is referenced by:  uptx  23765  hauseqlcld  23786  txkgen  23792  cnmpt1t  23805  cnmpt2t  23813  txpconn  35682
  Copyright terms: Public domain W3C validator