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

Theorem txcmp 23558
Description: The topological product of two compact spaces is compact. (Contributed by Mario Carneiro, 14-Sep-2014.) (Proof shortened 21-Mar-2015.)
Assertion
Ref Expression
txcmp ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)

Proof of Theorem txcmp
Dummy variables 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cmptop 23310 . . 3 (𝑅 ∈ Comp → 𝑅 ∈ Top)
2 cmptop 23310 . . 3 (𝑆 ∈ Comp → 𝑆 ∈ Top)
3 txtop 23484 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) ∈ Top)
41, 2, 3syl2an 596 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Top)
5 eqid 2731 . . . . . 6 𝑅 = 𝑅
6 eqid 2731 . . . . . 6 𝑆 = 𝑆
7 simpll 766 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑅 ∈ Comp)
8 simplr 768 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑆 ∈ Comp)
9 elpwi 4554 . . . . . . 7 (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) → 𝑤 ⊆ (𝑅 ×t 𝑆))
109ad2antrl 728 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑤 ⊆ (𝑅 ×t 𝑆))
115, 6txuni 23507 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
121, 2, 11syl2an 596 . . . . . . . 8 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
1312adantr 480 . . . . . . 7 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
14 simprr 772 . . . . . . 7 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (𝑅 ×t 𝑆) = 𝑤)
1513, 14eqtrd 2766 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ( 𝑅 × 𝑆) = 𝑤)
165, 6, 7, 8, 10, 15txcmplem2 23557 . . . . 5 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin)( 𝑅 × 𝑆) = 𝑣)
1713eqeq1d 2733 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (( 𝑅 × 𝑆) = 𝑣 (𝑅 ×t 𝑆) = 𝑣))
1817rexbidv 3156 . . . . 5 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (∃𝑣 ∈ (𝒫 𝑤 ∩ Fin)( 𝑅 × 𝑆) = 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
1916, 18mpbid 232 . . . 4 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣)
2019expr 456 . . 3 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ 𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)) → ( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
2120ralrimiva 3124 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → ∀𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
22 eqid 2731 . . 3 (𝑅 ×t 𝑆) = (𝑅 ×t 𝑆)
2322iscmp 23303 . 2 ((𝑅 ×t 𝑆) ∈ Comp ↔ ((𝑅 ×t 𝑆) ∈ Top ∧ ∀𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣)))
244, 21, 23sylanbrc 583 1 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  wral 3047  wrex 3056  cin 3896  wss 3897  𝒫 cpw 4547   cuni 4856   × cxp 5612  (class class class)co 7346  Fincfn 8869  Topctop 22808  Compccmp 23301   ×t ctx 23475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-int 4896  df-iun 4941  df-iin 4942  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-om 7797  df-1st 7921  df-2nd 7922  df-1o 8385  df-2o 8386  df-en 8870  df-dom 8871  df-fin 8873  df-topgen 17347  df-top 22809  df-topon 22826  df-bases 22861  df-cmp 23302  df-tx 23477
This theorem is referenced by:  txcmpb  23559  txkgen  23567  ptcmpfi  23728  xkohmeo  23730  cnheiborlem  24880
  Copyright terms: Public domain W3C validator