Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  txrest GIF version

Theorem txrest 12507
 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 2140 . . . . . 6 ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
21txval 12486 . . . . 5 ((𝑅𝑉𝑆𝑊) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
32adantr 274 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑅 ×t 𝑆) = (topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))))
43oveq1d 5799 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
51txbasex 12488 . . . 4 ((𝑅𝑉𝑆𝑊) → ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V)
6 xpexg 4663 . . . 4 ((𝐴𝑋𝐵𝑌) → (𝐴 × 𝐵) ∈ V)
7 tgrest 12400 . . . 4 ((ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
85, 6, 7syl2an 287 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = ((topGen‘ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))) ↾t (𝐴 × 𝐵)))
9 elrest 12189 . . . . . . . 8 ((ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ∈ V ∧ (𝐴 × 𝐵) ∈ V) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
105, 6, 9syl2an 287 . . . . . . 7 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
11 vex 2693 . . . . . . . . . . 11 𝑟 ∈ V
1211inex1 4071 . . . . . . . . . 10 (𝑟𝐴) ∈ V
1312a1i 9 . . . . . . . . 9 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑟𝑅) → (𝑟𝐴) ∈ V)
14 elrest 12189 . . . . . . . . . 10 ((𝑅𝑉𝐴𝑋) → (𝑢 ∈ (𝑅t 𝐴) ↔ ∃𝑟𝑅 𝑢 = (𝑟𝐴)))
1514ad2ant2r 501 . . . . . . . . 9 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑢 ∈ (𝑅t 𝐴) ↔ ∃𝑟𝑅 𝑢 = (𝑟𝐴)))
16 xpeq1 4563 . . . . . . . . . . . 12 (𝑢 = (𝑟𝐴) → (𝑢 × 𝑣) = ((𝑟𝐴) × 𝑣))
1716eqeq2d 2152 . . . . . . . . . . 11 (𝑢 = (𝑟𝐴) → (𝑥 = (𝑢 × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × 𝑣)))
1817rexbidv 2440 . . . . . . . . . 10 (𝑢 = (𝑟𝐴) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑣 ∈ (𝑆t 𝐵)𝑥 = ((𝑟𝐴) × 𝑣)))
19 vex 2693 . . . . . . . . . . . . 13 𝑠 ∈ V
2019inex1 4071 . . . . . . . . . . . 12 (𝑠𝐵) ∈ V
2120a1i 9 . . . . . . . . . . 11 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑠𝑆) → (𝑠𝐵) ∈ V)
22 elrest 12189 . . . . . . . . . . . 12 ((𝑆𝑊𝐵𝑌) → (𝑣 ∈ (𝑆t 𝐵) ↔ ∃𝑠𝑆 𝑣 = (𝑠𝐵)))
2322ad2ant2l 500 . . . . . . . . . . 11 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑣 ∈ (𝑆t 𝐵) ↔ ∃𝑠𝑆 𝑣 = (𝑠𝐵)))
24 xpeq2 4564 . . . . . . . . . . . . 13 (𝑣 = (𝑠𝐵) → ((𝑟𝐴) × 𝑣) = ((𝑟𝐴) × (𝑠𝐵)))
2524eqeq2d 2152 . . . . . . . . . . . 12 (𝑣 = (𝑠𝐵) → (𝑥 = ((𝑟𝐴) × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2625adantl 275 . . . . . . . . . . 11 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑣 = (𝑠𝐵)) → (𝑥 = ((𝑟𝐴) × 𝑣) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2721, 23, 26rexxfr2d 4395 . . . . . . . . . 10 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = ((𝑟𝐴) × 𝑣) ↔ ∃𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2818, 27sylan9bbr 459 . . . . . . . . 9 ((((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) ∧ 𝑢 = (𝑟𝐴)) → (∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
2913, 15, 28rexxfr2d 4395 . . . . . . . 8 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3011, 19xpex 4664 . . . . . . . . . 10 (𝑟 × 𝑠) ∈ V
3130rgen2w 2492 . . . . . . . . 9 𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V
32 eqid 2140 . . . . . . . . . 10 (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) = (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))
33 ineq1 3276 . . . . . . . . . . . 12 (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)))
34 inxp 4683 . . . . . . . . . . . 12 ((𝑟 × 𝑠) ∩ (𝐴 × 𝐵)) = ((𝑟𝐴) × (𝑠𝐵))
3533, 34eqtrdi 2189 . . . . . . . . . . 11 (𝑤 = (𝑟 × 𝑠) → (𝑤 ∩ (𝐴 × 𝐵)) = ((𝑟𝐴) × (𝑠𝐵)))
3635eqeq2d 2152 . . . . . . . . . 10 (𝑤 = (𝑟 × 𝑠) → (𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3732, 36rexrnmpo 5896 . . . . . . . . 9 (∀𝑟𝑅𝑠𝑆 (𝑟 × 𝑠) ∈ V → (∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵))))
3831, 37ax-mp 5 . . . . . . . 8 (∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵)) ↔ ∃𝑟𝑅𝑠𝑆 𝑥 = ((𝑟𝐴) × (𝑠𝐵)))
3929, 38bitr4di 197 . . . . . . 7 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣) ↔ ∃𝑤 ∈ ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠))𝑥 = (𝑤 ∩ (𝐴 × 𝐵))))
4010, 39bitr4d 190 . . . . . 6 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑥 ∈ (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) ↔ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)))
4140abbi2dv 2259 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)})
42 eqid 2140 . . . . . 6 (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))
4342rnmpo 5891 . . . . 5 ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = {𝑥 ∣ ∃𝑢 ∈ (𝑅t 𝐴)∃𝑣 ∈ (𝑆t 𝐵)𝑥 = (𝑢 × 𝑣)}
4441, 43eqtr4di 2191 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵)) = ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)))
4544fveq2d 5435 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (topGen‘(ran (𝑟𝑅, 𝑠𝑆 ↦ (𝑟 × 𝑠)) ↾t (𝐴 × 𝐵))) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
464, 8, 453eqtr2d 2179 . 2 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
47 restfn 12186 . . . 4 t Fn (V × V)
48 simpll 519 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝑅𝑉)
4948elexd 2703 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝑅 ∈ V)
50 simprl 521 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝐴𝑋)
5150elexd 2703 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝐴 ∈ V)
52 fnovex 5814 . . . 4 (( ↾t Fn (V × V) ∧ 𝑅 ∈ V ∧ 𝐴 ∈ V) → (𝑅t 𝐴) ∈ V)
5347, 49, 51, 52mp3an2i 1321 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑅t 𝐴) ∈ V)
54 simplr 520 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝑆𝑊)
5554elexd 2703 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝑆 ∈ V)
56 simprr 522 . . . . 5 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝐵𝑌)
5756elexd 2703 . . . 4 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → 𝐵 ∈ V)
58 fnovex 5814 . . . 4 (( ↾t Fn (V × V) ∧ 𝑆 ∈ V ∧ 𝐵 ∈ V) → (𝑆t 𝐵) ∈ V)
5947, 55, 57, 58mp3an2i 1321 . . 3 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → (𝑆t 𝐵) ∈ V)
60 eqid 2140 . . . 4 ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣)) = ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))
6160txval 12486 . . 3 (((𝑅t 𝐴) ∈ V ∧ (𝑆t 𝐵) ∈ V) → ((𝑅t 𝐴) ×t (𝑆t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
6253, 59, 61syl2anc 409 . 2 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅t 𝐴) ×t (𝑆t 𝐵)) = (topGen‘ran (𝑢 ∈ (𝑅t 𝐴), 𝑣 ∈ (𝑆t 𝐵) ↦ (𝑢 × 𝑣))))
6346, 62eqtr4d 2176 1 (((𝑅𝑉𝑆𝑊) ∧ (𝐴𝑋𝐵𝑌)) → ((𝑅 ×t 𝑆) ↾t (𝐴 × 𝐵)) = ((𝑅t 𝐴) ×t (𝑆t 𝐵)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1332   ∈ wcel 1481  {cab 2126  ∀wral 2417  ∃wrex 2418  Vcvv 2690   ∩ cin 3076   × cxp 4547  ran crn 4550   Fn wfn 5128  ‘cfv 5133  (class class class)co 5784   ∈ cmpo 5786   ↾t crest 12182  topGenctg 12197   ×t ctx 12483 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4052  ax-sep 4055  ax-pow 4107  ax-pr 4140  ax-un 4364  ax-setind 4461 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2692  df-sbc 2915  df-csb 3009  df-dif 3079  df-un 3081  df-in 3083  df-ss 3090  df-pw 3518  df-sn 3539  df-pr 3540  df-op 3542  df-uni 3746  df-iun 3824  df-br 3939  df-opab 3999  df-mpt 4000  df-id 4224  df-xp 4555  df-rel 4556  df-cnv 4557  df-co 4558  df-dm 4559  df-rn 4560  df-res 4561  df-ima 4562  df-iota 5098  df-fun 5135  df-fn 5136  df-f 5137  df-f1 5138  df-fo 5139  df-f1o 5140  df-fv 5141  df-ov 5787  df-oprab 5788  df-mpo 5789  df-1st 6048  df-2nd 6049  df-rest 12184  df-topgen 12203  df-tx 12484 This theorem is referenced by:  cnmpt2res  12528  limccnp2cntop  12877
 Copyright terms: Public domain W3C validator