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

Theorem txcmpb 23812
Description: The topological product of two nonempty topologies is compact iff the component topologies are both compact. (Contributed by Mario Carneiro, 14-Sep-2014.)
Hypotheses
Ref Expression
txcmpb.1 𝑋 = 𝑅
txcmpb.2 𝑌 = 𝑆
Assertion
Ref Expression
txcmpb (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp ↔ (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))

Proof of Theorem txcmpb
StepHypRef Expression
1 simpr 489 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
2 simplrr 789 . . . . . . 7 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑌 ≠ ∅)
3 fo1stres 8010 . . . . . . 7 (𝑌 ≠ ∅ → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑋)
42, 3syl 18 . . . . . 6 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑋)
5 txcmpb.1 . . . . . . . . 9 𝑋 = 𝑅
6 txcmpb.2 . . . . . . . . 9 𝑌 = 𝑆
75, 6txuni 23760 . . . . . . . 8 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑋 × 𝑌) = (𝑅 ×t 𝑆))
87ad2antrr 738 . . . . . . 7 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑋 × 𝑌) = (𝑅 ×t 𝑆))
9 foeq2 6789 . . . . . . 7 ((𝑋 × 𝑌) = (𝑅 ×t 𝑆) → ((1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑋 ↔ (1st ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑋))
108, 9syl 18 . . . . . 6 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → ((1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑋 ↔ (1st ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑋))
114, 10mpbid 235 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑋)
125toptopon 23085 . . . . . . 7 (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘𝑋))
136toptopon 23085 . . . . . . 7 (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘𝑌))
14 tx1cn 23777 . . . . . . 7 ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
1512, 13, 14syl2anb 609 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
1615ad2antrr 738 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
175cncmp 23560 . . . . 5 (((𝑅 ×t 𝑆) ∈ Comp ∧ (1st ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑋 ∧ (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → 𝑅 ∈ Comp)
181, 11, 16, 17syl3anc 1397 . . . 4 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑅 ∈ Comp)
19 simplrl 788 . . . . . . 7 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑋 ≠ ∅)
20 fo2ndres 8011 . . . . . . 7 (𝑋 ≠ ∅ → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑌)
2119, 20syl 18 . . . . . 6 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑌)
22 foeq2 6789 . . . . . . 7 ((𝑋 × 𝑌) = (𝑅 ×t 𝑆) → ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑌 ↔ (2nd ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑌))
238, 22syl 18 . . . . . 6 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → ((2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto𝑌 ↔ (2nd ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑌))
2421, 23mpbid 235 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑌)
25 tx2cn 23778 . . . . . . 7 ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
2612, 13, 25syl2anb 609 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
2726ad2antrr 738 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
286cncmp 23560 . . . . 5 (((𝑅 ×t 𝑆) ∈ Comp ∧ (2nd ↾ (𝑋 × 𝑌)): (𝑅 ×t 𝑆)–onto𝑌 ∧ (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → 𝑆 ∈ Comp)
291, 24, 27, 28syl3anc 1397 . . . 4 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑆 ∈ Comp)
3018, 29jca 520 . . 3 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp))
3130ex 417 . 2 (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))
32 txcmp 23811 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
3331, 32impbid1 228 1 (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp ↔ (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400   = wceq 1569  wcel 2142  wne 2957  c0 4285   cuni 4871   × cxp 5658  cres 5662  ontowfo 6534  cfv 6536  (class class class)co 7412  1st c1st 7982  2nd c2nd 7983  Topctop 23061  TopOnctopon 23078   Cn ccn 23392  Compccmp 23554   ×t ctx 23728
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-1o 8451  df-2o 8452  df-map 8824  df-en 8942  df-dom 8943  df-fin 8945  df-topgen 17502  df-top 23062  df-topon 23079  df-bases 23114  df-cn 23395  df-cmp 23555  df-tx 23730
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator