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

Theorem cmpcov 23668
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 4877 . . . . 5 (𝑟 = 𝑆 → ∪ 𝑟 = ∪ 𝑆)
21eqeq2d 2771 . . . 4 (𝑟 = 𝑆 → (𝑋 = ∪ 𝑟 ↔ 𝑋 = ∪ 𝑆))
3 pweq 4570 . . . . . 6 (𝑟 = 𝑆 → 𝒫 𝑟 = 𝒫 𝑆)
43ineq1d 4164 . . . . 5 (𝑟 = 𝑆 → (𝒫 𝑟 ∩ Fin) = (𝒫 𝑆 ∩ Fin))
54rexeqdv 3320 . . . 4 (𝑟 = 𝑆 → (∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = ∪ 𝑠 ↔ ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = ∪ 𝑠))
62, 5imbi12d 347 . . 3 (𝑟 = 𝑆 → ((𝑋 = ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = ∪ 𝑠) ↔ (𝑋 = ∪ 𝑆 → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = ∪ 𝑠)))
7 iscmp.1 . . . . . 6 𝑋 = ∪ 𝐽
87iscmp 23667 . . . . 5 (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑟 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = ∪ 𝑠)))
98simprbi 503 . . . 4 (𝐽 ∈ Comp → ∀𝑟 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = ∪ 𝑠))
109adantr 486 . . 3 ((𝐽 ∈ Comp ∧ 𝑆 ⊆ 𝐽) → ∀𝑟 ∈ 𝒫 𝐽(𝑋 = ∪ 𝑟 → ∃𝑠 ∈ (𝒫 𝑟 ∩ Fin)𝑋 = ∪ 𝑠))
11 ssexg 5280 . . . . 5 ((𝑆 ⊆ 𝐽 ∧ 𝐽 ∈ Comp) → 𝑆 ∈ V)
1211ancoms 464 . . . 4 ((𝐽 ∈ Comp ∧ 𝑆 ⊆ 𝐽) → 𝑆 ∈ V)
13 simpr 490 . . . 4 ((𝐽 ∈ Comp ∧ 𝑆 ⊆ 𝐽) → 𝑆 ⊆ 𝐽)
1412, 13elpwd 4562 . . 3 ((𝐽 ∈ Comp ∧ 𝑆 ⊆ 𝐽) → 𝑆 ∈ 𝒫 𝐽)
156, 10, 14rspcdva 3577 . 2 ((𝐽 ∈ Comp ∧ 𝑆 ⊆ 𝐽) → (𝑋 = ∪ 𝑆 → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = ∪ 𝑠))
16153impia 1135 1 ((𝐽 ∈ Comp ∧ 𝑆 ⊆ 𝐽 ∧ 𝑋 = ∪ 𝑆) → ∃𝑠 ∈ (𝒫 𝑆 ∩ Fin)𝑋 = ∪ 𝑠)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∩ cin 3897   ⊆ wss 3898  𝒫 cpw 4556  ∪ cuni 4866  Fincfn 8951  Topctop 23172  Compccmp 23665
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-ext 2732  ax-sep 5248
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-in 3905  df-ss 3915  df-pw 4558  df-uni 4867  df-cmp 23666
This theorem is used by:  cmpcov2  23669  cncmp  23671  discmp  23677  cmpcld  23681  sscmp  23684  comppfsc  23812  alexsubALTlem1  24327  ptcmplem3  24334  lebnum  25246  heibor1  38664  tmachlem-extpcover  47877
  Copyright terms: Public domain W3C validator