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

Theorem discmp 23771
Description: A discrete topology is compact iff the base set is finite. (Contributed by Mario Carneiro, 19-Mar-2015.)
Assertion
Ref Expression
discmp (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Comp)

Proof of Theorem discmp
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 distop 23368 . . . 4 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ Top)
2 pwfi 9348 . . . . 5 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
32biimpi 219 . . . 4 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ Fin)
41, 3elind 4100 . . 3 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ (Top ∩ Fin))
5 fincmp 23766 . . 3 (𝒫 𝐴 ∈ (Top ∩ Fin) → 𝒫 𝐴 ∈ Comp)
64, 5syl 18 . 2 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ Comp)
7 simpr 490 . . . . . . . 8 ((𝒫 𝐴 ∈ Comp ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
87snssd 4749 . . . . . . 7 ((𝒫 𝐴 ∈ Comp ∧ 𝑥 ∈ 𝐴) → {𝑥} ⊆ 𝐴)
9 vsnex 5400 . . . . . . . 8 {𝑥} ∈ V
109elpw 4564 . . . . . . 7 ({𝑥} ∈ 𝒫 𝐴 ↔ {𝑥} ⊆ 𝐴)
118, 10sylibr 237 . . . . . 6 ((𝒫 𝐴 ∈ Comp ∧ 𝑥 ∈ 𝐴) → {𝑥} ∈ 𝒫 𝐴)
1211fmpttd 7147 . . . . 5 (𝒫 𝐴 ∈ Comp → (𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶𝒫 𝐴)
1312frnd 6748 . . . 4 (𝒫 𝐴 ∈ Comp → ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ 𝒫 𝐴)
14 eqid 2763 . . . . . . . 8 (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
1514rnmpt 5951 . . . . . . 7 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = {𝑥}}
1615unieqi 4884 . . . . . 6 ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥}) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = {𝑥}}
179dfiun2 4995 . . . . . 6 ∪ 𝑥 ∈ 𝐴 {𝑥} = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = {𝑥}}
18 iunid 5024 . . . . . 6 ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴
1916, 17, 183eqtr2ri 2793 . . . . 5 𝐴 = ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥})
2019a1i 11 . . . 4 (𝒫 𝐴 ∈ Comp → 𝐴 = ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥}))
21 unipw 5425 . . . . . 6 ∪ 𝒫 𝐴 = 𝐴
2221eqcomi 2772 . . . . 5 𝐴 = ∪ 𝒫 𝐴
2322cmpcov 23762 . . . 4 ((𝒫 𝐴 ∈ Comp ∧ ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ 𝒫 𝐴 ∧ 𝐴 = ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥})) → ∃𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin)𝐴 = ∪ 𝑦)
2413, 20, 23mpd3an23 1493 . . 3 (𝒫 𝐴 ∈ Comp → ∃𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin)𝐴 = ∪ 𝑦)
25 elinel2 4102 . . . . . 6 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ∈ Fin)
26 elinel1 4101 . . . . . . . 8 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ∈ 𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}))
2726elpwid 4569 . . . . . . 7 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ⊆ ran (𝑥 ∈ 𝐴 ↦ {𝑥}))
28 snfi 9109 . . . . . . . . . 10 {𝑥} ∈ Fin
2928rgenw 3084 . . . . . . . . 9 ∀𝑥 ∈ 𝐴 {𝑥} ∈ Fin
3014fmpt 7142 . . . . . . . . 9 (∀𝑥 ∈ 𝐴 {𝑥} ∈ Fin ↔ (𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶Fin)
3129, 30mpbi 233 . . . . . . . 8 (𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶Fin
32 frn 6747 . . . . . . . 8 ((𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶Fin → ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ Fin)
3331, 32mp1i 14 . . . . . . 7 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ Fin)
3427, 33sstrd 3923 . . . . . 6 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ⊆ Fin)
35 unifi 9371 . . . . . 6 ((𝑦 ∈ Fin ∧ 𝑦 ⊆ Fin) → ∪ 𝑦 ∈ Fin)
3625, 34, 35syl2anc 596 . . . . 5 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → ∪ 𝑦 ∈ Fin)
37 eleq1 2852 . . . . 5 (𝐴 = ∪ 𝑦 → (𝐴 ∈ Fin ↔ ∪ 𝑦 ∈ Fin))
3836, 37syl5ibrcom 250 . . . 4 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → (𝐴 = ∪ 𝑦 → 𝐴 ∈ Fin))
3938rexlimiv 3160 . . 3 (∃𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin)𝐴 = ∪ 𝑦 → 𝐴 ∈ Fin)
4024, 39syl 18 . 2 (𝒫 𝐴 ∈ Comp → 𝐴 ∈ Fin)
416, 40impbii 212 1 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Comp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872  ∪ ciun 4956   ↦ cmpt 5192  ran crn 5659  ⟶wf 6562  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-pow 5334  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-csb 3852  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-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  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-dom 9013  df-fin 9015  df-top 23267  df-cmp 23760
This theorem is used by:  disllycmp  23872  xkohaus  24027  xkoptsub  24028  xkopt  24029  tmachlem-tpcomp  48282
  Copyright terms: Public domain W3C validator