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

Theorem fincmp 23720
Description: A finite topology is compact. (Contributed by FL, 22-Dec-2008.)
Assertion
Ref Expression
fincmp (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Comp)

Proof of Theorem fincmp
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elinel1 4097 . 2 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Top)
2 elinel2 4098 . . 3 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Fin)
3 vex 3454 . . . . . 6 𝑦 ∈ V
43pwid 4580 . . . . 5 𝑦 ∈ 𝒫 𝑦
5 velpw 4561 . . . . . 6 (𝑦 ∈ 𝒫 𝐽 ↔ 𝑦 ⊆ 𝐽)
6 ssfi 9195 . . . . . 6 ((𝐽 ∈ Fin ∧ 𝑦 ⊆ 𝐽) → 𝑦 ∈ Fin)
75, 6sylan2b 606 . . . . 5 ((𝐽 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝐽) → 𝑦 ∈ Fin)
8 elin 4092 . . . . . 6 (𝑦 ∈ (𝒫 𝑦 ∩ Fin) ↔ (𝑦 ∈ 𝒫 𝑦 ∧ 𝑦 ∈ Fin))
9 unieq 4877 . . . . . . . 8 (𝑧 = 𝑦 → ∪ 𝑧 = ∪ 𝑦)
109rspceeqv 3598 . . . . . . 7 ((𝑦 ∈ (𝒫 𝑦 ∩ Fin) ∧ ∪ 𝐽 = ∪ 𝑦) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧)
1110ex 418 . . . . . 6 (𝑦 ∈ (𝒫 𝑦 ∩ Fin) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
128, 11sylbir 238 . . . . 5 ((𝑦 ∈ 𝒫 𝑦 ∧ 𝑦 ∈ Fin) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
134, 7, 12sylancr 599 . . . 4 ((𝐽 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝐽) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
1413ralrimiva 3154 . . 3 (𝐽 ∈ Fin → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
152, 14syl 18 . 2 (𝐽 ∈ (Top ∩ Fin) → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
16 eqid 2760 . . 3 ∪ 𝐽 = ∪ 𝐽
1716iscmp 23715 . 2 (𝐽 ∈ Comp ↔ (𝐽 ∈ Top ∧ ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧)))
181, 15, 17sylanbrc 595 1 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Comp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3896   ∩ cin 4088  𝒫 cpw 4556  ∪ cuni 4866  Fincfn 8980  Topctop 23220  Compccmp 23713
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-om 7882  df-1o 8483  df-en 8981  df-fin 8984  df-cmp 23714
This theorem is used by:  0cmp  23721  discmp  23725  1stckgenlem  23881  ptcmpfi  24141  kelac2lem  44175
  Copyright terms: Public domain W3C validator