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

Theorem fclsnei 23932
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 2731 . . . . 5 𝐽 = 𝐽
21fclselbas 23929 . . . 4 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴 𝐽)
3 toponuni 22827 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
43adantr 480 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = 𝐽)
54eleq2d 2817 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴𝑋𝐴 𝐽))
62, 5imbitrrid 246 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴𝑋))
7 fclsneii 23930 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹) → (𝑛𝑠) ≠ ∅)
873expb 1120 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹)) → (𝑛𝑠) ≠ ∅)
98ralrimivva 3175 . . 3 (𝐴 ∈ (𝐽 fClus 𝐹) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)
106, 9jca2 513 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
11 topontop 22826 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1211ad3antrrr 730 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐽 ∈ Top)
13 simprl 770 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜𝐽)
14 simprr 772 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐴𝑜)
15 opnneip 23032 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑜𝐽𝐴𝑜) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
1612, 13, 14, 15syl3anc 1373 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
17 ineq1 4163 . . . . . . . . . . 11 (𝑛 = 𝑜 → (𝑛𝑠) = (𝑜𝑠))
1817neeq1d 2987 . . . . . . . . . 10 (𝑛 = 𝑜 → ((𝑛𝑠) ≠ ∅ ↔ (𝑜𝑠) ≠ ∅))
1918ralbidv 3155 . . . . . . . . 9 (𝑛 = 𝑜 → (∀𝑠𝐹 (𝑛𝑠) ≠ ∅ ↔ ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2019rspcv 3573 . . . . . . . 8 (𝑜 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2116, 20syl 17 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2221expr 456 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (𝐴𝑜 → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2322com23 86 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2423ralrimdva 3132 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2524imdistanda 571 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
26 fclsopn 23927 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
2725, 26sylibrd 259 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → 𝐴 ∈ (𝐽 fClus 𝐹)))
2810, 27impbid 212 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2111  wne 2928  wral 3047  cin 3901  c0 4283  {csn 4576   cuni 4859  cfv 6481  (class class class)co 7346  Topctop 22806  TopOnctopon 22823  neicnei 23010  Filcfil 23758   fClus cfcls 23849
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-iin 4944  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-fbas 21286  df-top 22807  df-topon 22824  df-cld 22932  df-ntr 22933  df-cls 22934  df-nei 23011  df-fil 23759  df-fcls 23854
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator