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

Theorem discmp 22902
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 22498 . . . 4 (𝐴 ∈ Fin β†’ 𝒫 𝐴 ∈ Top)
2 pwfi 9178 . . . . 5 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
32biimpi 215 . . . 4 (𝐴 ∈ Fin β†’ 𝒫 𝐴 ∈ Fin)
41, 3elind 4195 . . 3 (𝐴 ∈ Fin β†’ 𝒫 𝐴 ∈ (Top ∩ Fin))
5 fincmp 22897 . . 3 (𝒫 𝐴 ∈ (Top ∩ Fin) β†’ 𝒫 𝐴 ∈ Comp)
64, 5syl 17 . 2 (𝐴 ∈ Fin β†’ 𝒫 𝐴 ∈ Comp)
7 simpr 486 . . . . . . . 8 ((𝒫 𝐴 ∈ Comp ∧ π‘₯ ∈ 𝐴) β†’ π‘₯ ∈ 𝐴)
87snssd 4813 . . . . . . 7 ((𝒫 𝐴 ∈ Comp ∧ π‘₯ ∈ 𝐴) β†’ {π‘₯} βŠ† 𝐴)
9 vsnex 5430 . . . . . . . 8 {π‘₯} ∈ V
109elpw 4607 . . . . . . 7 ({π‘₯} ∈ 𝒫 𝐴 ↔ {π‘₯} βŠ† 𝐴)
118, 10sylibr 233 . . . . . 6 ((𝒫 𝐴 ∈ Comp ∧ π‘₯ ∈ 𝐴) β†’ {π‘₯} ∈ 𝒫 𝐴)
1211fmpttd 7115 . . . . 5 (𝒫 𝐴 ∈ Comp β†’ (π‘₯ ∈ 𝐴 ↦ {π‘₯}):π΄βŸΆπ’« 𝐴)
1312frnd 6726 . . . 4 (𝒫 𝐴 ∈ Comp β†’ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) βŠ† 𝒫 𝐴)
14 eqid 2733 . . . . . . . 8 (π‘₯ ∈ 𝐴 ↦ {π‘₯}) = (π‘₯ ∈ 𝐴 ↦ {π‘₯})
1514rnmpt 5955 . . . . . . 7 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) = {𝑦 ∣ βˆƒπ‘₯ ∈ 𝐴 𝑦 = {π‘₯}}
1615unieqi 4922 . . . . . 6 βˆͺ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) = βˆͺ {𝑦 ∣ βˆƒπ‘₯ ∈ 𝐴 𝑦 = {π‘₯}}
179dfiun2 5037 . . . . . 6 βˆͺ π‘₯ ∈ 𝐴 {π‘₯} = βˆͺ {𝑦 ∣ βˆƒπ‘₯ ∈ 𝐴 𝑦 = {π‘₯}}
18 iunid 5064 . . . . . 6 βˆͺ π‘₯ ∈ 𝐴 {π‘₯} = 𝐴
1916, 17, 183eqtr2ri 2768 . . . . 5 𝐴 = βˆͺ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯})
2019a1i 11 . . . 4 (𝒫 𝐴 ∈ Comp β†’ 𝐴 = βˆͺ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}))
21 unipw 5451 . . . . . 6 βˆͺ 𝒫 𝐴 = 𝐴
2221eqcomi 2742 . . . . 5 𝐴 = βˆͺ 𝒫 𝐴
2322cmpcov 22893 . . . 4 ((𝒫 𝐴 ∈ Comp ∧ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) βŠ† 𝒫 𝐴 ∧ 𝐴 = βˆͺ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯})) β†’ βˆƒπ‘¦ ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin)𝐴 = βˆͺ 𝑦)
2413, 20, 23mpd3an23 1464 . . 3 (𝒫 𝐴 ∈ Comp β†’ βˆƒπ‘¦ ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin)𝐴 = βˆͺ 𝑦)
25 elinel2 4197 . . . . . 6 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ 𝑦 ∈ Fin)
26 elinel1 4196 . . . . . . . 8 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ 𝑦 ∈ 𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}))
2726elpwid 4612 . . . . . . 7 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ 𝑦 βŠ† ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}))
28 snfi 9044 . . . . . . . . . 10 {π‘₯} ∈ Fin
2928rgenw 3066 . . . . . . . . 9 βˆ€π‘₯ ∈ 𝐴 {π‘₯} ∈ Fin
3014fmpt 7110 . . . . . . . . 9 (βˆ€π‘₯ ∈ 𝐴 {π‘₯} ∈ Fin ↔ (π‘₯ ∈ 𝐴 ↦ {π‘₯}):𝐴⟢Fin)
3129, 30mpbi 229 . . . . . . . 8 (π‘₯ ∈ 𝐴 ↦ {π‘₯}):𝐴⟢Fin
32 frn 6725 . . . . . . . 8 ((π‘₯ ∈ 𝐴 ↦ {π‘₯}):𝐴⟢Fin β†’ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) βŠ† Fin)
3331, 32mp1i 13 . . . . . . 7 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) βŠ† Fin)
3427, 33sstrd 3993 . . . . . 6 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ 𝑦 βŠ† Fin)
35 unifi 9341 . . . . . 6 ((𝑦 ∈ Fin ∧ 𝑦 βŠ† Fin) β†’ βˆͺ 𝑦 ∈ Fin)
3625, 34, 35syl2anc 585 . . . . 5 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ βˆͺ 𝑦 ∈ Fin)
37 eleq1 2822 . . . . 5 (𝐴 = βˆͺ 𝑦 β†’ (𝐴 ∈ Fin ↔ βˆͺ 𝑦 ∈ Fin))
3836, 37syl5ibrcom 246 . . . 4 (𝑦 ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin) β†’ (𝐴 = βˆͺ 𝑦 β†’ 𝐴 ∈ Fin))
3938rexlimiv 3149 . . 3 (βˆƒπ‘¦ ∈ (𝒫 ran (π‘₯ ∈ 𝐴 ↦ {π‘₯}) ∩ Fin)𝐴 = βˆͺ 𝑦 β†’ 𝐴 ∈ Fin)
4024, 39syl 17 . 2 (𝒫 𝐴 ∈ Comp β†’ 𝐴 ∈ Fin)
416, 40impbii 208 1 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Comp)
Colors of variables: wff setvar class
Syntax hints:   ↔ wb 205   ∧ wa 397   = wceq 1542   ∈ wcel 2107  {cab 2710  βˆ€wral 3062  βˆƒwrex 3071   ∩ cin 3948   βŠ† wss 3949  π’« cpw 4603  {csn 4629  βˆͺ cuni 4909  βˆͺ ciun 4998   ↦ cmpt 5232  ran crn 5678  βŸΆwf 6540  Fincfn 8939  Topctop 22395  Compccmp 22890
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-om 7856  df-1o 8466  df-en 8940  df-fin 8943  df-top 22396  df-cmp 22891
This theorem is referenced by:  disllycmp  23002  xkohaus  23157  xkoptsub  23158  xkopt  23159
  Copyright terms: Public domain W3C validator