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

Theorem discmp 23721
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 23318 . . . 4 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ Top)
2 pwfi 9313 . . . . 5 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
32biimpi 219 . . . 4 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ Fin)
41, 3elind 4097 . . 3 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ (Top ∩ Fin))
5 fincmp 23716 . . 3 (𝒫 𝐴 ∈ (Top ∩ Fin) → 𝒫 𝐴 ∈ Comp)
64, 5syl 18 . 2 (𝐴 ∈ Fin → 𝒫 𝐴 ∈ Comp)
7 simpr 490 . . . . . . . 8 ((𝒫 𝐴 ∈ Comp ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
87snssd 4743 . . . . . . 7 ((𝒫 𝐴 ∈ Comp ∧ 𝑥 ∈ 𝐴) → {𝑥} ⊆ 𝐴)
9 vsnex 5392 . . . . . . . 8 {𝑥} ∈ V
109elpw 4560 . . . . . . 7 ({𝑥} ∈ 𝒫 𝐴 ↔ {𝑥} ⊆ 𝐴)
118, 10sylibr 237 . . . . . 6 ((𝒫 𝐴 ∈ Comp ∧ 𝑥 ∈ 𝐴) → {𝑥} ∈ 𝒫 𝐴)
1211fmpttd 7115 . . . . 5 (𝒫 𝐴 ∈ Comp → (𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶𝒫 𝐴)
1312frnd 6718 . . . 4 (𝒫 𝐴 ∈ Comp → ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ 𝒫 𝐴)
14 eqid 2760 . . . . . . . 8 (𝑥 ∈ 𝐴 ↦ {𝑥}) = (𝑥 ∈ 𝐴 ↦ {𝑥})
1514rnmpt 5938 . . . . . . 7 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = {𝑥}}
1615unieqi 4878 . . . . . 6 ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥}) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = {𝑥}}
179dfiun2 4989 . . . . . 6 ∪ 𝑥 ∈ 𝐴 {𝑥} = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = {𝑥}}
18 iunid 5018 . . . . . 6 ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴
1916, 17, 183eqtr2ri 2790 . . . . 5 𝐴 = ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥})
2019a1i 11 . . . 4 (𝒫 𝐴 ∈ Comp → 𝐴 = ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥}))
21 unipw 5417 . . . . . 6 ∪ 𝒫 𝐴 = 𝐴
2221eqcomi 2769 . . . . 5 𝐴 = ∪ 𝒫 𝐴
2322cmpcov 23712 . . . 4 ((𝒫 𝐴 ∈ Comp ∧ ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ 𝒫 𝐴 ∧ 𝐴 = ∪ ran (𝑥 ∈ 𝐴 ↦ {𝑥})) → ∃𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin)𝐴 = ∪ 𝑦)
2413, 20, 23mpd3an23 1492 . . 3 (𝒫 𝐴 ∈ Comp → ∃𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin)𝐴 = ∪ 𝑦)
25 elinel2 4099 . . . . . 6 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ∈ Fin)
26 elinel1 4098 . . . . . . . 8 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ∈ 𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}))
2726elpwid 4565 . . . . . . 7 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ⊆ ran (𝑥 ∈ 𝐴 ↦ {𝑥}))
28 snfi 9074 . . . . . . . . . 10 {𝑥} ∈ Fin
2928rgenw 3080 . . . . . . . . 9 ∀𝑥 ∈ 𝐴 {𝑥} ∈ Fin
3014fmpt 7110 . . . . . . . . 9 (∀𝑥 ∈ 𝐴 {𝑥} ∈ Fin ↔ (𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶Fin)
3129, 30mpbi 233 . . . . . . . 8 (𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶Fin
32 frn 6717 . . . . . . . 8 ((𝑥 ∈ 𝐴 ↦ {𝑥}):𝐴⟶Fin → ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ Fin)
3331, 32mp1i 14 . . . . . . 7 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ⊆ Fin)
3427, 33sstrd 3918 . . . . . 6 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → 𝑦 ⊆ Fin)
35 unifi 9336 . . . . . 6 ((𝑦 ∈ Fin ∧ 𝑦 ⊆ Fin) → ∪ 𝑦 ∈ Fin)
3625, 34, 35syl2anc 596 . . . . 5 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → ∪ 𝑦 ∈ Fin)
37 eleq1 2848 . . . . 5 (𝐴 = ∪ 𝑦 → (𝐴 ∈ Fin ↔ ∪ 𝑦 ∈ Fin))
3836, 37syl5ibrcom 250 . . . 4 (𝑦 ∈ (𝒫 ran (𝑥 ∈ 𝐴 ↦ {𝑥}) ∩ Fin) → (𝐴 = ∪ 𝑦 → 𝐴 ∈ Fin))
3938rexlimiv 3156 . . 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 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895   ∩ cin 4089  𝒫 cpw 4556  {csn 4584  ∪ cuni 4866  ∪ ciun 4950   ↦ cmpt 5185  ran crn 5651  ⟶wf 6534  Fincfn 8976  Topctop 23216  Compccmp 23709
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-pow 5326  ax-pr 5390  ax-un 7751
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-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-om 7878  df-1o 8479  df-en 8977  df-dom 8978  df-fin 8980  df-top 23217  df-cmp 23710
This theorem is used by:  disllycmp  23822  xkohaus  23977  xkoptsub  23978  xkopt  23979  tmachlem-tpcomp  48041
  Copyright terms: Public domain W3C validator