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

Theorem txrest 22690
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 2738 . . . . . 6 ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
21txval 22623 . . . . 5 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
32adantr 480 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
43oveq1d 7270 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
51txbasex 22625 . . . 4 ((𝑅𝑉𝑆𝑊) → ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6 xpexg 7578 . . . 4 ((𝐴𝑋𝐵𝑌) → (𝐴 × 𝐵) ∈ V)
7 tgrest 22218 . . . 4 ((ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
85, 6, 7syl2an 595 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
9 elrest 17055 . . . . . . . 8 ((ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
105, 6, 9syl2an 595 . . . . . . 7 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
11 vex 3426 . . . . . . . . . . 11 𝑟 ∈ V
1211inex1 5236 . . . . . . . . . 10 (𝑟𝐴) ∈ V
1312a1i 11 . . . . . . . . 9 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑟𝑅) → (𝑟𝐴) ∈ V)
14 elrest 17055 . . . . . . . . . 10 ((𝑅𝑉𝐴𝑋) → (𝑢 ∈ (𝑅t 𝐴) ↔ ∃𝑟𝑅 𝑢 = (𝑟𝐴)))
1514ad2ant2r 743 . . . . . . . . 9 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑢 ∈ (𝑅t 𝐴) ↔ ∃𝑟𝑅 𝑢 = (𝑟𝐴)))
16 xpeq1 5594 . . . . . . . . . . . 12 (𝑢 = (𝑟𝐴) → (𝑢 × 𝑣) = ((𝑟𝐴) × 𝑣))
1716eqeq2d 2749 . . . . . . . . . . 11 (𝑢 = (𝑟𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × 𝑣)))
1817rexbidv 3225 . . . . . . . . . 10 (𝑢 = (𝑟𝐴) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆t 𝐵)𝑥 = ((𝑟𝐴) × 𝑣)))
19 vex 3426 . . . . . . . . . . . . 13 𝑠 ∈ V
2019inex1 5236 . . . . . . . . . . . 12 (𝑠𝐵) ∈ V
2120a1i 11 . . . . . . . . . . 11 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑠𝑆) → (𝑠𝐵) ∈ V)
22 elrest 17055 . . . . . . . . . . . 12 ((𝑆𝑊𝐵𝑌) → (𝑣 ∈ (𝑆t 𝐵) ↔ ∃𝑠𝑆 𝑣 = (𝑠𝐵)))
2322ad2ant2l 742 . . . . . . . . . . 11 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑣 ∈ (𝑆t 𝐵) ↔ ∃𝑠𝑆 𝑣 = (𝑠𝐵)))
24 xpeq2 5601 . . . . . . . . . . . . 13 (𝑣 = (𝑠𝐵) → ((𝑟𝐴) × 𝑣) = ((𝑟𝐴) × (𝑠𝐵)))
2524eqeq2d 2749 . . . . . . . . . . . 12 (𝑣 = (𝑠𝐵) → (𝑥 = ((𝑟𝐴) × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2625adantl 481 . . . . . . . . . . 11 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑣 = (𝑠𝐵)) → (𝑥 = ((𝑟𝐴) × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2721, 23, 26rexxfr2d 5329 . . . . . . . . . 10 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = ((𝑟𝐴) × 𝑣) ↔ ∃𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2818, 27sylan9bbr 510 . . . . . . . . 9 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑢 = (𝑟𝐴)) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2913, 15, 28rexxfr2d 5329 . . . . . . . 8 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3011, 19xpex 7581 . . . . . . . . . 10 (𝑟 × 𝑠) ∈ V
3130rgen2w 3076 . . . . . . . . 9 𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V
32 eqid 2738 . . . . . . . . . 10 (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
33 ineq1 4136 . . . . . . . . . . . 12 (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34 inxp 5730 . . . . . . . . . . . 12 ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟𝐴) × (𝑠𝐵))
3533, 34eqtrdi 2795 . . . . . . . . . . 11 (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟𝐴) × (𝑠𝐵)))
3635eqeq2d 2749 . . . . . . . . . 10 (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3732, 36rexrnmpo 7391 . . . . . . . . 9 (∀𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V → (∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3831, 37ax-mp 5 . . . . . . . 8 (∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵)))
3929, 38bitr4di 288 . . . . . . 7 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
4010, 39bitr4d 281 . . . . . 6 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)))
4140abbi2dv 2876 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)})
42 eqid 2738 . . . . . 6 (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))
4342rnmpo 7385 . . . . 5 ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)}
4441, 43eqtr4di 2797 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)))
4544fveq2d 6760 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
464, 8, 453eqtr2d 2784 . 2 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
47 ovex 7288 . . 3 (𝑅t 𝐴) ∈ V
48 ovex 7288 . . 3 (𝑆t 𝐵) ∈ V
49 eqid 2738 . . . 4 ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))
5049txval 22623 . . 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, 51eqtr4di 2797 1 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅t 𝐴) ×t (𝑆t 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  {cab 2715  wral 3063  wrex 3064  Vcvv 3422  cin 3882   × cxp 5578  ran crn 5581  cfv 6418  (class class class)co 7255  cmpo 7257  t crest 17048  topGenctg 17065   ×t ctx 22619
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-rest 17050  df-topgen 17071  df-tx 22621
This theorem is referenced by:  txlly  22695  txnlly  22696  txkgen  22711  cnmpt2res  22736  xkoinjcn  22746  cnmpopc  23997  cnheiborlem  24023  lhop1lem  25082  cxpcn3  25806  raddcn  31781  cvmlift2lem6  33170  cvmlift2lem9  33173  cvmlift2lem12  33176
  Copyright terms: Public domain W3C validator