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

Theorem txcmp 23870
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 23621 . . 3 (𝑅 ∈ Comp → 𝑅 ∈ Top)
2 cmptop 23621 . . 3 (𝑆 ∈ Comp → 𝑆 ∈ Top)
3 txtop 23796 . . 3 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → (𝑅 ×t 𝑆) ∈ Top)
41, 2, 3syl2an 608 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Top)
5 eqid 2762 . . . . . 6 𝑅 = 𝑅
6 eqid 2762 . . . . . 6 𝑆 = 𝑆
7 simpll 779 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑅 ∈ Comp)
8 simplr 781 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑆 ∈ Comp)
9 elpwi 4567 . . . . . . 7 (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) → 𝑤 ⊆ (𝑅 ×t 𝑆))
109ad2antrl 741 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → 𝑤 ⊆ (𝑅 ×t 𝑆))
115, 6txuni 23819 . . . . . . . . 9 ((𝑅 ∈ Top ∧ 𝑆 ∈ Top) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
121, 2, 11syl2an 608 . . . . . . . 8 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
1312adantr 486 . . . . . . 7 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ( 𝑅 × 𝑆) = (𝑅 ×t 𝑆))
14 simprr 785 . . . . . . 7 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (𝑅 ×t 𝑆) = 𝑤)
1513, 14eqtrd 2797 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ( 𝑅 × 𝑆) = 𝑤)
165, 6, 7, 8, 10, 15txcmplem2 23869 . . . . 5 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin)( 𝑅 × 𝑆) = 𝑣)
1713eqeq1d 2764 . . . . . 6 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (( 𝑅 × 𝑆) = 𝑣 (𝑅 ×t 𝑆) = 𝑣))
1817rexbidv 3188 . . . . 5 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → (∃𝑣 ∈ (𝒫 𝑤 ∩ Fin)( 𝑅 × 𝑆) = 𝑣 ↔ ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
1916, 18mpbid 235 . . . 4 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ (𝑤 ∈ 𝒫 (𝑅 ×t 𝑆) ∧ (𝑅 ×t 𝑆) = 𝑤)) → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣)
2019expr 462 . . 3 (((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) ∧ 𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)) → ( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
2120ralrimiva 3156 . 2 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → ∀𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣))
22 eqid 2762 . . 3 (𝑅 ×t 𝑆) = (𝑅 ×t 𝑆)
2322iscmp 23614 . 2 ((𝑅 ×t 𝑆) ∈ Comp ↔ ((𝑅 ×t 𝑆) ∈ Top ∧ ∀𝑤 ∈ 𝒫 (𝑅 ×t 𝑆)( (𝑅 ×t 𝑆) = 𝑤 → ∃𝑣 ∈ (𝒫 𝑤 ∩ Fin) (𝑅 ×t 𝑆) = 𝑣)))
244, 21, 23sylanbrc 595 1 ((𝑅 ∈ Comp ∧ 𝑆 ∈ Comp) → (𝑅 ×t 𝑆) ∈ Comp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3078  wrex 3088  cin 3901  wss 3902  𝒫 cpw 4560   cuni 4870   × cxp 5657  (class class class)co 7416  Fincfn 8955  Topctop 23119  Compccmp 23612   ×t ctx 23787
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-1o 8458  df-2o 8459  df-en 8956  df-dom 8957  df-fin 8959  df-topgen 17532  df-top 23120  df-topon 23137  df-bases 23172  df-cmp 23613  df-tx 23789
This theorem is used by:  txcmpb  23871  txkgen  23879  ptcmpfi  24040  xkohmeo  24042  cnheiborlem  25183
  Copyright terms: Public domain W3C validator