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

Theorem fincmp 23766
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 4101 . 2 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Top)
2 elinel2 4102 . . 3 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Fin)
3 vex 3458 . . . . . 6 𝑦 ∈ V
43pwid 4584 . . . . 5 𝑦 ∈ 𝒫 𝑦
5 velpw 4565 . . . . . 6 (𝑦 ∈ 𝒫 𝐽 ↔ 𝑦 ⊆ 𝐽)
6 ssfi 9226 . . . . . 6 ((𝐽 ∈ Fin ∧ 𝑦 ⊆ 𝐽) → 𝑦 ∈ Fin)
75, 6sylan2b 606 . . . . 5 ((𝐽 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝐽) → 𝑦 ∈ Fin)
8 elin 4096 . . . . . 6 (𝑦 ∈ (𝒫 𝑦 ∩ Fin) ↔ (𝑦 ∈ 𝒫 𝑦 ∧ 𝑦 ∈ Fin))
9 unieq 4883 . . . . . . . 8 (𝑧 = 𝑦 → ∪ 𝑧 = ∪ 𝑦)
109rspceeqv 3602 . . . . . . 7 ((𝑦 ∈ (𝒫 𝑦 ∩ Fin) ∧ ∪ 𝐽 = ∪ 𝑦) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧)
1110ex 418 . . . . . 6 (𝑦 ∈ (𝒫 𝑦 ∩ Fin) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
128, 11sylbir 238 . . . . 5 ((𝑦 ∈ 𝒫 𝑦 ∧ 𝑦 ∈ Fin) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
134, 7, 12sylancr 599 . . . 4 ((𝐽 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝐽) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
1413ralrimiva 3158 . . 3 (𝐽 ∈ Fin → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
152, 14syl 18 . 2 (𝐽 ∈ (Top ∩ Fin) → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
16 eqid 2763 . . 3 ∪ 𝐽 = ∪ 𝐽
1716iscmp 23761 . 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 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4872  Fincfn 9011  Topctop 23266  Compccmp 23759
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-om 7912  df-1o 8514  df-en 9012  df-fin 9015  df-cmp 23760
This theorem is used by:  0cmp  23767  discmp  23771  1stckgenlem  23927  ptcmpfi  24187  kelac2lem  44332
  Copyright terms: Public domain W3C validator