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

Theorem txrest 22174
Description: The subspace of a topological product space induced by a subset with a Cartesian product representation is a topological product of the subspaces induced by the subspaces of the terms of the products. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 2-Sep-2015.)
Assertion
Ref Expression
txrest (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅t 𝐴) ×t (𝑆t 𝐵)))

Proof of Theorem txrest
Dummy variables 𝑠 𝑟 𝑢 𝑣 𝑥 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2826 . . . . . 6 ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
21txval 22107 . . . . 5 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
32adantr 481 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
43oveq1d 7165 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
51txbasex 22109 . . . 4 ((𝑅𝑉𝑆𝑊) → ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6 xpexg 7466 . . . 4 ((𝐴𝑋𝐵𝑌) → (𝐴 × 𝐵) ∈ V)
7 tgrest 21702 . . . 4 ((ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
85, 6, 7syl2an 595 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
9 elrest 16696 . . . . . . . 8 ((ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
105, 6, 9syl2an 595 . . . . . . 7 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
11 vex 3503 . . . . . . . . . . 11 𝑟 ∈ V
1211inex1 5218 . . . . . . . . . 10 (𝑟𝐴) ∈ V
1312a1i 11 . . . . . . . . 9 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑟𝑅) → (𝑟𝐴) ∈ V)
14 elrest 16696 . . . . . . . . . 10 ((𝑅𝑉𝐴𝑋) → (𝑢 ∈ (𝑅t 𝐴) ↔ ∃𝑟𝑅 𝑢 = (𝑟𝐴)))
1514ad2ant2r 743 . . . . . . . . 9 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑢 ∈ (𝑅t 𝐴) ↔ ∃𝑟𝑅 𝑢 = (𝑟𝐴)))
16 xpeq1 5568 . . . . . . . . . . . 12 (𝑢 = (𝑟𝐴) → (𝑢 × 𝑣) = ((𝑟𝐴) × 𝑣))
1716eqeq2d 2837 . . . . . . . . . . 11 (𝑢 = (𝑟𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × 𝑣)))
1817rexbidv 3302 . . . . . . . . . 10 (𝑢 = (𝑟𝐴) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆t 𝐵)𝑥 = ((𝑟𝐴) × 𝑣)))
19 vex 3503 . . . . . . . . . . . . 13 𝑠 ∈ V
2019inex1 5218 . . . . . . . . . . . 12 (𝑠𝐵) ∈ V
2120a1i 11 . . . . . . . . . . 11 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑠𝑆) → (𝑠𝐵) ∈ V)
22 elrest 16696 . . . . . . . . . . . 12 ((𝑆𝑊𝐵𝑌) → (𝑣 ∈ (𝑆t 𝐵) ↔ ∃𝑠𝑆 𝑣 = (𝑠𝐵)))
2322ad2ant2l 742 . . . . . . . . . . 11 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑣 ∈ (𝑆t 𝐵) ↔ ∃𝑠𝑆 𝑣 = (𝑠𝐵)))
24 xpeq2 5575 . . . . . . . . . . . . 13 (𝑣 = (𝑠𝐵) → ((𝑟𝐴) × 𝑣) = ((𝑟𝐴) × (𝑠𝐵)))
2524eqeq2d 2837 . . . . . . . . . . . 12 (𝑣 = (𝑠𝐵) → (𝑥 = ((𝑟𝐴) × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2625adantl 482 . . . . . . . . . . 11 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑣 = (𝑠𝐵)) → (𝑥 = ((𝑟𝐴) × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2721, 23, 26rexxfr2d 5308 . . . . . . . . . 10 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = ((𝑟𝐴) × 𝑣) ↔ ∃𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2818, 27sylan9bbr 511 . . . . . . . . 9 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑢 = (𝑟𝐴)) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2913, 15, 28rexxfr2d 5308 . . . . . . . 8 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3011, 19xpex 7469 . . . . . . . . . 10 (𝑟 × 𝑠) ∈ V
3130rgen2w 3156 . . . . . . . . 9 𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V
32 eqid 2826 . . . . . . . . . 10 (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
33 ineq1 4185 . . . . . . . . . . . 12 (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34 inxp 5702 . . . . . . . . . . . 12 ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟𝐴) × (𝑠𝐵))
3533, 34syl6eq 2877 . . . . . . . . . . 11 (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟𝐴) × (𝑠𝐵)))
3635eqeq2d 2837 . . . . . . . . . 10 (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3732, 36rexrnmpo 7284 . . . . . . . . 9 (∀𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V → (∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3831, 37ax-mp 5 . . . . . . . 8 (∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵)))
3929, 38syl6bbr 290 . . . . . . 7 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
4010, 39bitr4d 283 . . . . . 6 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)))
4140abbi2dv 2955 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)})
42 eqid 2826 . . . . . 6 (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))
4342rnmpo 7278 . . . . 5 ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)}
4441, 43syl6eqr 2879 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)))
4544fveq2d 6673 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
464, 8, 453eqtr2d 2867 . 2 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
47 ovex 7183 . . 3 (𝑅t 𝐴) ∈ V
48 ovex 7183 . . 3 (𝑆t 𝐵) ∈ V
49 eqid 2826 . . . 4 ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))
5049txval 22107 . . 3 (((𝑅t 𝐴) ∈ V ∧ (𝑆t 𝐵) ∈ V) → ((𝑅t 𝐴) ×t (𝑆t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
5147, 48, 50mp2an 688 . 2 ((𝑅t 𝐴) ×t (𝑆t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)))
5246, 51syl6eqr 2879 1 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅t 𝐴) ×t (𝑆t 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1530  wcel 2107  {cab 2804  wral 3143  wrex 3144  Vcvv 3500  cin 3939   × cxp 5552  ran crn 5555  cfv 6354  (class class class)co 7150  cmpo 7152  t crest 16689  topGenctg 16706   ×t ctx 22103
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7455
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-ral 3148  df-rex 3149  df-reu 3150  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-iun 4919  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7153  df-oprab 7154  df-mpo 7155  df-1st 7685  df-2nd 7686  df-rest 16691  df-topgen 16712  df-tx 22105
This theorem is referenced by:  txlly  22179  txnlly  22180  txkgen  22195  cnmpt2res  22220  xkoinjcn  22230  cnmpopc  23466  cnheiborlem  23492  lhop1lem  24544  cxpcn3  25261  raddcn  31077  cvmlift2lem6  32458  cvmlift2lem9  32461  cvmlift2lem12  32464
  Copyright terms: Public domain W3C validator