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

Theorem cmpcov 21992
 Description: An open cover of a compact topology has a finite subcover. (Contributed by Jeff Hankins, 29-Jun-2009.)
Hypothesis
Ref Expression
iscmp.1 𝑋 = 𝐽
Assertion
Ref Expression
cmpcov ((𝐽 ∈ Comp ∧ 𝑆𝐽𝑋 = 𝑆) → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = 𝑠)
Distinct variable groups:   𝐽,𝑠   𝑆,𝑠
Allowed substitution hint:   𝑋(𝑠)

Proof of Theorem cmpcov
Dummy variable 𝑟 is distinct from all other variables.
StepHypRef Expression
1 unieq 4824 . . . . 5 (𝑟 = 𝑆 𝑟 = 𝑆)
21eqeq2d 2833 . . . 4 (𝑟 = 𝑆 → (𝑋 = 𝑟𝑋 = 𝑆))
3 pweq 4527 . . . . . 6 (𝑟 = 𝑆 → 𝒫 𝑟 = 𝒫 𝑆)
43ineq1d 4162 . . . . 5 (𝑟 = 𝑆 → (𝒫 𝑟 ∩ Fin) = (𝒫 𝑆 ∩ Fin))
54rexeqdv 3393 . . . 4 (𝑟 = 𝑆 → (∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = 𝑠 ↔ ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = 𝑠))
62, 5imbi12d 348 . . 3 (𝑟 = 𝑆 → ((𝑋 = 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = 𝑠) ↔ (𝑋 = 𝑆 → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = 𝑠)))
7 iscmp.1 . . . . . 6 𝑋 = 𝐽
87iscmp 21991 . . . . 5 (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑟 ∈ 𝒫 𝐽(𝑋 = 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = 𝑠)))
98simprbi 500 . . . 4 (𝐽 ∈ Comp → ∀𝑟 ∈ 𝒫 𝐽(𝑋 = 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = 𝑠))
109adantr 484 . . 3 ((𝐽 ∈ Comp ∧ 𝑆𝐽) → ∀𝑟 ∈ 𝒫 𝐽(𝑋 = 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = 𝑠))
11 ssexg 5203 . . . . 5 ((𝑆𝐽𝐽 ∈ Comp) → 𝑆 ∈ V)
1211ancoms 462 . . . 4 ((𝐽 ∈ Comp ∧ 𝑆𝐽) → 𝑆 ∈ V)
13 simpr 488 . . . 4 ((𝐽 ∈ Comp ∧ 𝑆𝐽) → 𝑆𝐽)
1412, 13elpwd 4519 . . 3 ((𝐽 ∈ Comp ∧ 𝑆𝐽) → 𝑆 ∈ 𝒫 𝐽)
156, 10, 14rspcdva 3600 . 2 ((𝐽 ∈ Comp ∧ 𝑆𝐽) → (𝑋 = 𝑆 → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = 𝑠))
16153impia 1114 1 ((𝐽 ∈ Comp ∧ 𝑆𝐽𝑋 = 𝑆) → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = 𝑠)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2114  ∀wral 3130  ∃wrex 3131  Vcvv 3469   ∩ cin 3907   ⊆ wss 3908  𝒫 cpw 4511  ∪ cuni 4813  Fincfn 8496  Topctop 21496  Compccmp 21989 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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-in 3915  df-ss 3925  df-pw 4513  df-uni 4814  df-cmp 21990 This theorem is referenced by:  cmpcov2  21993  cncmp  21995  discmp  22001  cmpcld  22005  sscmp  22008  comppfsc  22135  alexsubALTlem1  22650  ptcmplem3  22657  lebnum  23567  heibor1  35206
 Copyright terms: Public domain W3C validator