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

Theorem locfinnei 22134
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 2824 . . . 4 𝐴 = 𝐴
31, 2islocfin 22128 . . 3 (𝐴 ∈ (LocFin‘𝐽) ↔ (𝐽 ∈ Top ∧ 𝑋 = 𝐴 ∧ ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
43simp3bi 1143 . 2 (𝐴 ∈ (LocFin‘𝐽) → ∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
5 eleq1 2903 . . . . 5 (𝑥 = 𝑃 → (𝑥𝑛𝑃𝑛))
65anbi1d 631 . . . 4 (𝑥 = 𝑃 → ((𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
76rexbidv 3300 . . 3 (𝑥 = 𝑃 → (∃𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ↔ ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin)))
87rspccva 3625 . 2 ((∀𝑥𝑋𝑛𝐽 (𝑥𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin) ∧ 𝑃𝑋) → ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
94, 8sylan 582 1 ((𝐴 ∈ (LocFin‘𝐽) ∧ 𝑃𝑋) → ∃𝑛𝐽 (𝑃𝑛 ∧ {𝑠𝐴 ∣ (𝑠𝑛) ≠ ∅} ∈ Fin))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1536  wcel 2113  wne 3019  wral 3141  wrex 3142  {crab 3145  cin 3938  c0 4294   cuni 4841  cfv 6358  Fincfn 8512  Topctop 21504  LocFinclocfin 22115
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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fv 6366  df-top 21505  df-locfin 22118
This theorem is referenced by:  lfinpfin  22135  lfinun  22136  locfincmp  22137  locfincf  22142
  Copyright terms: Public domain W3C validator