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

Theorem locfinnei 23510
Description: A point covered by a locally finite cover has a neighborhood which intersects only finitely many elements of the cover. (Contributed by Jeff Hankins, 21-Jan-2010.)
Hypothesis
Ref Expression
locfinnei.1 𝑋 = 𝐽
Assertion
Ref Expression
locfinnei ((𝐴 ∈ (LocFin‘𝐽) ∧ 𝑃𝑋) → ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
Distinct variable groups:   𝑛,𝑠,𝐴   𝑛,𝐽   𝑃,𝑛
Allowed substitution hints:   𝑃(𝑠)   𝐽(𝑠)   𝑋(𝑛,𝑠)

Proof of Theorem locfinnei
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 locfinnei.1 . . . 4 𝑋 = 𝐽
2 eqid 2741 . . . 4 𝐴 = 𝐴
31, 2islocfin 23504 . . 3 (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝐴 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
43simp3bi 1154 . 2 (𝐴 ∈ (LocFin‘𝐽) → ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
5 eleq1 2829 . . . . 5 (𝑥 = 𝑃 → (𝑥𝑛𝑃𝑛))
65anbi1d 638 . . . 4 (𝑥 = 𝑃 → ((𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
76rexbidv 3165 . . 3 (𝑥 = 𝑃 → (∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
87rspccva 3561 . 2 ((∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ∧ 𝑃𝑋) → ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
94, 8sylan 587 1 ((𝐴 ∈ (LocFin‘𝐽) ∧ 𝑃𝑋) → ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1548  wcel 2121  wne 2936  wral 3055  wrex 3065  {crab 3393  cin 3884  c0 4264   cuni 4841  cfv 6489  Fincfn 8887  Topctop 22880  LocFinclocfin 23491
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fv 6497  df-top 22881  df-locfin 23494
This theorem is referenced by:  lfinpfin  23511  lfinun  23512  locfincmp  23513  locfincf  23518
  Copyright terms: Public domain W3C validator