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

Theorem txcmp 23592
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 23344 . . 3 (𝑅 ∈ Comp → 𝑅 ∈ Top)
2 cmptop 23344 . . 3 (𝑆 ∈ Comp → 𝑆 ∈ Top)
3 txtop 23518 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) ∈ Top)
41, 2, 3syl2an 597 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Top)
5 eqid 2737 . . . . . 6 𝑅 = 𝑅
6 eqid 2737 . . . . . 6 𝑆 = 𝑆
7 simpll 767 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑅 ∈ Comp)
8 simplr 769 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑆 ∈ Comp)
9 elpwi 4562 . . . . . . 7 (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) → 𝑤 ⊆ (𝑅 ×t 𝑆))
109ad2antrl 729 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑤 ⊆ (𝑅 ×t 𝑆))
115, 6txuni 23541 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
121, 2, 11syl2an 597 . . . . . . . 8 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
1312adantr 480 . . . . . . 7 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
14 simprr 773 . . . . . . 7 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (𝑅 ×t 𝑆) = 𝑤)
1513, 14eqtrd 2772 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ( 𝑅 × 𝑆) = 𝑤)
165, 6, 7, 8, 10, 15txcmplem2 23591 . . . . 5 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin)( 𝑅 × 𝑆) = 𝑣)
1713eqeq1d 2739 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (( 𝑅 × 𝑆) = 𝑣 (𝑅 ×t 𝑆) = 𝑣))
1817rexbidv 3161 . . . . 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 3129 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → ∀𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
22 eqid 2737 . . 3 (𝑅 ×t 𝑆) = (𝑅 ×t 𝑆)
2322iscmp 23337 . 2 ((𝑅 ×t 𝑆) ∈ Comp ↔ ((𝑅 ×t 𝑆) ∈ Top ∧ ∀𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣)))
244, 21, 23sylanbrc 584 1 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3061  cin 3901  wss 3902  𝒫 cpw 4555   cuni 4864   × cxp 5623  (class class class)co 7361  Fincfn 8888  Topctop 22842  Compccmp 23335   ×t ctx 23509
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7683
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-iin 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-1st 7936  df-2nd 7937  df-1o 8400  df-2o 8401  df-en 8889  df-dom 8890  df-fin 8892  df-topgen 17368  df-top 22843  df-topon 22860  df-bases 22895  df-cmp 23336  df-tx 23511
This theorem is referenced by:  txcmpb  23593  txkgen  23601  ptcmpfi  23762  xkohmeo  23764  cnheiborlem  24914
  Copyright terms: Public domain W3C validator