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

Theorem fincmp 23704
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 4147 . 2 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Top)
2 elinel2 4148 . . 3 (𝐽 ∈ (Top ∩ Fin) → 𝐽 ∈ Fin)
3 vex 3455 . . . . . 6 𝑦 ∈ V
43pwid 4580 . . . . 5 𝑦 ∈ 𝒫 𝑦
5 velpw 4562 . . . . . 6 (𝑦 ∈ 𝒫 𝐽 ↔ 𝑦 ⊆ 𝐽)
6 ssfi 9181 . . . . . 6 ((𝐽 ∈ Fin ∧ 𝑦 ⊆ 𝐽) → 𝑦 ∈ Fin)
75, 6sylan2b 606 . . . . 5 ((𝐽 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝐽) → 𝑦 ∈ Fin)
8 elin 3915 . . . . . 6 (𝑦 ∈ (𝒫 𝑦 ∩ Fin) ↔ (𝑦 ∈ 𝒫 𝑦 ∧ 𝑦 ∈ Fin))
9 unieq 4878 . . . . . . . 8 (𝑧 = 𝑦 → ∪ 𝑧 = ∪ 𝑦)
109rspceeqv 3599 . . . . . . 7 ((𝑦 ∈ (𝒫 𝑦 ∩ Fin) ∧ ∪ 𝐽 = ∪ 𝑦) → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧)
1110ex 418 . . . . . 6 (𝑦 ∈ (𝒫 𝑦 ∩ Fin) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
128, 11sylbir 238 . . . . 5 ((𝑦 ∈ 𝒫 𝑦 ∧ 𝑦 ∈ Fin) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
134, 7, 12sylancr 599 . . . 4 ((𝐽 ∈ Fin ∧ 𝑦 ∈ 𝒫 𝐽) → (∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
1413ralrimiva 3155 . . 3 (𝐽 ∈ Fin → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
152, 14syl 18 . 2 (𝐽 ∈ (Top ∩ Fin) → ∀𝑦 ∈ 𝒫 𝐽(∪ 𝐽 = ∪ 𝑦 → ∃𝑧 ∈ (𝒫 𝑦 ∩ Fin)∪ 𝐽 = ∪ 𝑧))
16 eqid 2761 . . 3 ∪ 𝐽 = ∪ 𝐽
1716iscmp 23699 . 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 2145  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  Fincfn 8966  Topctop 23204  Compccmp 23697
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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  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 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-om 7876  df-1o 8469  df-en 8967  df-fin 8970  df-cmp 23698
This theorem is used by:  0cmp  23705  discmp  23709  1stckgenlem  23865  ptcmpfi  24125  kelac2lem  44050
  Copyright terms: Public domain W3C validator