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

Theorem txcmpb 23963
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 490 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
2 simplrr 790 . . . . . . 7 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑌 ≠ ∅)
3 fo1stres 8027 . . . . . . 7 (𝑌 ≠ ∅ → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋)
42, 3syl 18 . . . . . 6 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑋)
5 txcmpb.1 . . . . . . . . 9 𝑋 = ∪ 𝑅
6 txcmpb.2 . . . . . . . . 9 𝑌 = ∪ 𝑆
75, 6txuni 23911 . . . . . . . 8 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
87ad2antrr 739 . . . . . . 7 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑋 × 𝑌) = ∪ (𝑅 ×t 𝑆))
9 foeq2 6793 . . . . . . 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 23235 . . . . . . 7 (𝑅 ∈ Top ↔ 𝑅 ∈ (TopOn‘𝑋))
136toptopon 23235 . . . . . . 7 (𝑆 ∈ Top ↔ 𝑆 ∈ (TopOn‘𝑌))
14 tx1cn 23928 . . . . . . 7 ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
1512, 13, 14syl2anb 610 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
1615ad2antrr 739 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅))
175cncmp 23710 . . . . 5 (((𝑅 ×t 𝑆) ∈ Comp ∧ (1st ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑋 ∧ (1st ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑅)) → 𝑅 ∈ Comp)
181, 11, 16, 17syl3anc 1398 . . . 4 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑅 ∈ Comp)
19 simplrl 789 . . . . . . 7 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑋 ≠ ∅)
20 fo2ndres 8028 . . . . . . 7 (𝑋 ≠ ∅ → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌)
2119, 20syl 18 . . . . . 6 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)):(𝑋 × 𝑌)–onto→𝑌)
22 foeq2 6793 . . . . . . 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 23929 . . . . . . 7 ((𝑅 ∈ (TopOn‘𝑋) ∧ 𝑆 ∈ (TopOn‘𝑌)) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
2612, 13, 25syl2anb 610 . . . . . 6 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
2726ad2antrr 739 . . . . 5 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆))
286cncmp 23710 . . . . 5 (((𝑅 ×t 𝑆) ∈ Comp ∧ (2nd ↾ (𝑋 × 𝑌)):∪ (𝑅 ×t 𝑆)–onto→𝑌 ∧ (2nd ↾ (𝑋 × 𝑌)) ∈ ((𝑅 ×t 𝑆) Cn 𝑆)) → 𝑆 ∈ Comp)
291, 24, 27, 28syl3anc 1398 . . . 4 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → 𝑆 ∈ Comp)
3018, 29jca 521 . . 3 ((((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) ∧ (𝑅 ×t 𝑆) ∈ Comp) → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp))
3130ex 418 . 2 (((𝑅 ∈ Top ∧ 𝑆 ∈ Top) ∧ (𝑋 ≠ ∅ ∧ 𝑌 ≠ ∅)) → ((𝑅 ×t 𝑆) ∈ Comp → (𝑅 ∈ Comp ∧ 𝑆 ∈ Comp)))
32 txcmp 23962 . 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 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∅c0 4278  ∪ cuni 4866   × cxp 5648   ↾ cres 5652  –onto→wfo 6536  ‘cfv 6538  (class class class)co 7420  1st c1st 7999  2nd c2nd 8000  Topctop 23211  TopOnctopon 23228   Cn ccn 23542  Compccmp 23704   ×t ctx 23879
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-1o 8476  df-2o 8477  df-map 8849  df-en 8974  df-dom 8975  df-fin 8977  df-topgen 17614  df-top 23212  df-topon 23229  df-bases 23264  df-cn 23545  df-cmp 23705  df-tx 23881
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator