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

Theorem locfindis 21535
 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 21529 . . 3 (𝐶 ∈ (LocFin‘𝒫 𝑋) → 𝐶 ∈ PtFin)
2 unipw 5067 . . . . 5 𝒫 𝑋 = 𝑋
32eqcomi 2769 . . . 4 𝑋 = 𝒫 𝑋
4 locfindis.1 . . . 4 𝑌 = 𝐶
53, 4locfinbas 21527 . . 3 (𝐶 ∈ (LocFin‘𝒫 𝑋) → 𝑋 = 𝑌)
61, 5jca 555 . 2 (𝐶 ∈ (LocFin‘𝒫 𝑋) → (𝐶 ∈ PtFin ∧ 𝑋 = 𝑌))
7 simpr 479 . . . . 5 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝑋 = 𝑌)
8 uniexg 7120 . . . . . . 7 (𝐶 ∈ PtFin → 𝐶 ∈ V)
94, 8syl5eqel 2843 . . . . . 6 (𝐶 ∈ PtFin → 𝑌 ∈ V)
109adantr 472 . . . . 5 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝑌 ∈ V)
117, 10eqeltrd 2839 . . . 4 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝑋 ∈ V)
12 distop 21001 . . . 4 (𝑋 ∈ V → 𝒫 𝑋 ∈ Top)
1311, 12syl 17 . . 3 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝒫 𝑋 ∈ Top)
14 snelpwi 5061 . . . . . 6 (𝑥𝑋 → {𝑥} ∈ 𝒫 𝑋)
1514adantl 473 . . . . 5 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → {𝑥} ∈ 𝒫 𝑋)
16 snidg 4351 . . . . . 6 (𝑥𝑋𝑥 ∈ {𝑥})
1716adantl 473 . . . . 5 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → 𝑥 ∈ {𝑥})
18 simpll 807 . . . . . 6 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → 𝐶 ∈ PtFin)
197eleq2d 2825 . . . . . . 7 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → (𝑥𝑋𝑥𝑌))
2019biimpa 502 . . . . . 6 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → 𝑥𝑌)
214ptfinfin 21524 . . . . . 6 ((𝐶 ∈ PtFin ∧ 𝑥𝑌) → {𝑠𝐶𝑥𝑠} ∈ Fin)
2218, 20, 21syl2anc 696 . . . . 5 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → {𝑠𝐶𝑥𝑠} ∈ Fin)
23 eleq2 2828 . . . . . . 7 (𝑦 = {𝑥} → (𝑥𝑦𝑥 ∈ {𝑥}))
24 ineq2 3951 . . . . . . . . . . 11 (𝑦 = {𝑥} → (𝑠𝑦) = (𝑠 ∩ {𝑥}))
2524neeq1d 2991 . . . . . . . . . 10 (𝑦 = {𝑥} → ((𝑠𝑦) ≠ ∅ ↔ (𝑠 ∩ {𝑥}) ≠ ∅))
26 disjsn 4390 . . . . . . . . . . 11 ((𝑠 ∩ {𝑥}) = ∅ ↔ ¬ 𝑥𝑠)
2726necon2abii 2982 . . . . . . . . . 10 (𝑥𝑠 ↔ (𝑠 ∩ {𝑥}) ≠ ∅)
2825, 27syl6bbr 278 . . . . . . . . 9 (𝑦 = {𝑥} → ((𝑠𝑦) ≠ ∅ ↔ 𝑥𝑠))
2928rabbidv 3329 . . . . . . . 8 (𝑦 = {𝑥} → {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} = {𝑠𝐶𝑥𝑠})
3029eleq1d 2824 . . . . . . 7 (𝑦 = {𝑥} → ({𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin ↔ {𝑠𝐶𝑥𝑠} ∈ Fin))
3123, 30anbi12d 749 . . . . . 6 (𝑦 = {𝑥} → ((𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin) ↔ (𝑥 ∈ {𝑥} ∧ {𝑠𝐶𝑥𝑠} ∈ Fin)))
3231rspcev 3449 . . . . 5 (({𝑥} ∈ 𝒫 𝑋 ∧ (𝑥 ∈ {𝑥} ∧ {𝑠𝐶𝑥𝑠} ∈ Fin)) → ∃𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin))
3315, 17, 22, 32syl12anc 1475 . . . 4 (((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) ∧ 𝑥𝑋) → ∃𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin))
3433ralrimiva 3104 . . 3 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → ∀𝑥𝑋𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin))
353, 4islocfin 21522 . . 3 (𝐶 ∈ (LocFin‘𝒫 𝑋) ↔ (𝒫 𝑋 ∈ Top ∧ 𝑋 = 𝑌 ∧ ∀𝑥𝑋𝑦 ∈ 𝒫 𝑋(𝑥𝑦 ∧ {𝑠𝐶 ∣ (𝑠𝑦) ≠ ∅} ∈ Fin)))
3613, 7, 34, 35syl3anbrc 1429 . 2 ((𝐶 ∈ PtFin ∧ 𝑋 = 𝑌) → 𝐶 ∈ (LocFin‘𝒫 𝑋))
376, 36impbii 199 1 (𝐶 ∈ (LocFin‘𝒫 𝑋) ↔ (𝐶 ∈ PtFin ∧ 𝑋 = 𝑌))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   = wceq 1632   ∈ wcel 2139   ≠ wne 2932  ∀wral 3050  ∃wrex 3051  {crab 3054  Vcvv 3340   ∩ cin 3714  ∅c0 4058  𝒫 cpw 4302  {csn 4321  ∪ cuni 4588  ‘cfv 6049  Fincfn 8121  Topctop 20900  PtFincptfin 21508  LocFinclocfin 21509 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-om 7231  df-er 7911  df-en 8122  df-fin 8125  df-top 20901  df-ptfin 21511  df-locfin 21512 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator