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

Theorem locfindis 23424
Description: The locally finite covers of a discrete space are precisely the point-finite covers. (Contributed by Jeff Hankins, 22-Jan-2010.) (Proof shortened by Mario Carneiro, 11-Sep-2015.)
Hypothesis
Ref Expression
locfindis.1 𝑌 = 𝐶
Assertion
Ref Expression
locfindis (𝐶 ∈ (LocFin‘𝒫 𝑋) ↔ (𝐶 ∈ PtFin ∧ 𝑋 = 𝑌))

Proof of Theorem locfindis
Dummy variables 𝑥 𝑠 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lfinpfin 23418 . . 3 (𝐶 ∈ (LocFin‘𝒫 𝑋) → 𝐶 ∈ PtFin)
2 unipw 5413 . . . . 5 𝒫 𝑋 = 𝑋
32eqcomi 2739 . . . 4 𝑋 = 𝒫 𝑋
4 locfindis.1 . . . 4 𝑌 = 𝐶
53, 4locfinbas 23416 . . 3 (𝐶 ∈ (LocFin‘𝒫 𝑋) → 𝑋 = 𝑌)
61, 5jca 511 . 2 (𝐶 ∈ (LocFin‘𝒫 𝑋) → (𝐶 ∈ PtFin ∧ 𝑋 = 𝑌))
7 simpr 484 . . . . 5 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
8 uniexg 7719 . . . . . . 7 (𝐶 ∈ PtFin → 𝐶 ∈ V)
94, 8eqeltrid 2833 . . . . . 6 (𝐶 ∈ PtFin → 𝑌 ∈ V)
109adantr 480 . . . . 5 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝑌 ∈ V)
117, 10eqeltrd 2829 . . . 4 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝑋 ∈ V)
12 distop 22889 . . . 4 (𝑋 ∈ V → 𝒫 𝑋 ∈ Top)
1311, 12syl 17 . . 3 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝒫 𝑋 ∈ Top)
14 snelpwi 5406 . . . . . 6 (𝑥𝑋 → {𝑥} ∈ 𝒫 𝑋)
1514adantl 481 . . . . 5 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → {𝑥} ∈ 𝒫 𝑋)
16 snidg 4627 . . . . . 6 (𝑥𝑋𝑥 ∈ {𝑥})
1716adantl 481 . . . . 5 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → 𝑥 ∈ {𝑥})
18 simpll 766 . . . . . 6 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → 𝐶 ∈ PtFin)
197eleq2d 2815 . . . . . . 7 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → (𝑥𝑋𝑥𝑌))
2019biimpa 476 . . . . . 6 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → 𝑥𝑌)
214ptfinfin 23413 . . . . . 6 ((𝐶 ∈ PtFin ∧ 𝑥𝑌) → {𝑠𝐶𝑥𝑠} ∈ Fin)
2218, 20, 21syl2anc 584 . . . . 5 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → {𝑠𝐶𝑥𝑠} ∈ Fin)
23 eleq2 2818 . . . . . . 7 (𝑦 = {𝑥} → (𝑥𝑦𝑥 ∈ {𝑥}))
24 ineq2 4180 . . . . . . . . . . 11 (𝑦 = {𝑥} → (𝑠𝑦) = (𝑠 ∩ {𝑥}))
2524neeq1d 2985 . . . . . . . . . 10 (𝑦 = {𝑥} → ((𝑠𝑦) ≠ ∅ ↔ (𝑠 ∩ {𝑥}) ≠ ∅))
26 disjsn 4678 . . . . . . . . . . 11 ((𝑠 ∩ {𝑥}) = ∅ ↔ ¬ 𝑥𝑠)
2726necon2abii 2976 . . . . . . . . . 10 (𝑥𝑠 ↔ (𝑠 ∩ {𝑥}) ≠ ∅)
2825, 27bitr4di 289 . . . . . . . . 9 (𝑦 = {𝑥} → ((𝑠𝑦) ≠ ∅ ↔ 𝑥𝑠))
2928rabbidv 3416 . . . . . . . 8 (𝑦 = {𝑥} → {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} = {𝑠𝐶𝑥𝑠})
3029eleq1d 2814 . . . . . . 7 (𝑦 = {𝑥} → ({𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin ↔ {𝑠𝐶𝑥𝑠} ∈ Fin))
3123, 30anbi12d 632 . . . . . 6 (𝑦 = {𝑥} → ((𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin) ↔ (𝑥 ∈ {𝑥} ∧ {𝑠𝐶𝑥𝑠} ∈ Fin)))
3231rspcev 3591 . . . . 5 (({𝑥} ∈ 𝒫 𝑋 ∧ (𝑥 ∈ {𝑥} ∧ {𝑠𝐶𝑥𝑠} ∈ Fin)) → ∃𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin))
3315, 17, 22, 32syl12anc 836 . . . 4 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → ∃𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin))
3433ralrimiva 3126 . . 3 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → ∀𝑥𝑋𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin))
353, 4islocfin 23411 . . 3 (𝐶 ∈ (LocFin‘𝒫 𝑋) ↔ (𝒫 𝑋 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin)))
3613, 7, 34, 35syl3anbrc 1344 . 2 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝐶 ∈ (LocFin‘𝒫 𝑋))
376, 36impbii 209 1 (𝐶 ∈ (LocFin‘𝒫 𝑋) ↔ (𝐶 ∈ PtFin ∧ 𝑋 = 𝑌))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wcel 2109  wne 2926  wral 3045  wrex 3054  {crab 3408  Vcvv 3450  cin 3916  c0 4299  𝒫 cpw 4566  {csn 4592   cuni 4874  cfv 6514  Fincfn 8921  Topctop 22787  PtFincptfin 23397  LocFinclocfin 23398
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-om 7846  df-1o 8437  df-en 8922  df-fin 8925  df-top 22788  df-ptfin 23400  df-locfin 23401
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator