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

Theorem fclsnei 24187
Description: Cluster points in terms of neighborhoods. (Contributed by Jeff Hankins, 11-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)
Assertion
Ref Expression
fclsnei ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
Distinct variable groups:   𝑛,𝑠,𝐴   𝑛,𝐹,𝑠   𝑛,𝐽,𝑠   𝑋,𝑠
Allowed substitution hint:   𝑋(𝑛)

Proof of Theorem fclsnei
Dummy variable 𝑜 is distinct from all other variables.
StepHypRef Expression
1 eqid 2762 . . . . 5 𝐽 = 𝐽
21fclselbas 24184 . . . 4 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴 𝐽)
3 toponuni 23082 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
43adantr 485 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = 𝐽)
54eleq2d 2848 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴𝑋𝐴 𝐽))
62, 5imbitrrid 249 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴𝑋))
7 fclsneii 24185 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹) → (𝑛𝑠) ≠ ∅)
873expb 1137 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹)) → (𝑛𝑠) ≠ ∅)
98ralrimivva 3207 . . 3 (𝐴 ∈ (𝐽 fClus 𝐹) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)
106, 9jca2 522 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
11 topontop 23081 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1211ad3antrrr 742 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐽 ∈ Top)
13 simprl 782 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜𝐽)
14 simprr 784 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐴𝑜)
15 opnneip 23287 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑜𝐽𝐴𝑜) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
1612, 13, 14, 15syl3anc 1397 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
17 ineq1 4165 . . . . . . . . . . 11 (𝑛 = 𝑜 → (𝑛𝑠) = (𝑜𝑠))
1817neeq1d 3016 . . . . . . . . . 10 (𝑛 = 𝑜 → ((𝑛𝑠) ≠ ∅ ↔ (𝑜𝑠) ≠ ∅))
1918ralbidv 3187 . . . . . . . . 9 (𝑛 = 𝑜 → (∀𝑠𝐹 (𝑛𝑠) ≠ ∅ ↔ ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2019rspcv 3576 . . . . . . . 8 (𝑜 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2116, 20syl 18 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2221expr 461 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (𝐴𝑜 → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2322com23 87 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2423ralrimdva 3164 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2524imdistanda 581 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
26 fclsopn 24182 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
2725, 26sylibrd 262 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → 𝐴 ∈ (𝐽 fClus 𝐹)))
2810, 27impbid 215 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400   = wceq 1569  wcel 2142  wne 2957  wral 3078  cin 3903  c0 4285  {csn 4588   cuni 4871  cfv 6536  (class class class)co 7412  Topctop 23061  TopOnctopon 23078  neicnei 23265  Filcfil 24013   fClus cfcls 24104
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-fbas 21530  df-top 23062  df-topon 23079  df-cld 23187  df-ntr 23188  df-cls 23189  df-nei 23266  df-fil 24014  df-fcls 24109
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator