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

Theorem fclsnei 23984
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 2736 . . . . 5 𝐽 = 𝐽
21fclselbas 23981 . . . 4 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴 𝐽)
3 toponuni 22879 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
43adantr 480 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = 𝐽)
54eleq2d 2822 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴𝑋𝐴 𝐽))
62, 5imbitrrid 246 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴𝑋))
7 fclsneii 23982 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹) → (𝑛𝑠) ≠ ∅)
873expb 1121 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹)) → (𝑛𝑠) ≠ ∅)
98ralrimivva 3180 . . 3 (𝐴 ∈ (𝐽 fClus 𝐹) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)
106, 9jca2 513 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
11 topontop 22878 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1211ad3antrrr 731 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐽 ∈ Top)
13 simprl 771 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜𝐽)
14 simprr 773 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐴𝑜)
15 opnneip 23084 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑜𝐽𝐴𝑜) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
1612, 13, 14, 15syl3anc 1374 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
17 ineq1 4153 . . . . . . . . . . 11 (𝑛 = 𝑜 → (𝑛𝑠) = (𝑜𝑠))
1817neeq1d 2991 . . . . . . . . . 10 (𝑛 = 𝑜 → ((𝑛𝑠) ≠ ∅ ↔ (𝑜𝑠) ≠ ∅))
1918ralbidv 3160 . . . . . . . . 9 (𝑛 = 𝑜 → (∀𝑠𝐹 (𝑛𝑠) ≠ ∅ ↔ ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2019rspcv 3560 . . . . . . . 8 (𝑜 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2116, 20syl 17 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2221expr 456 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (𝐴𝑜 → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2322com23 86 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2423ralrimdva 3137 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2524imdistanda 571 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
26 fclsopn 23979 . . 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 1542  wcel 2114  wne 2932  wral 3051  cin 3888  c0 4273  {csn 4567   cuni 4850  cfv 6498  (class class class)co 7367  Topctop 22858  TopOnctopon 22875  neicnei 23062  Filcfil 23810   fClus cfcls 23901
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-iin 4936  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-fbas 21349  df-top 22859  df-topon 22876  df-cld 22984  df-ntr 22985  df-cls 22986  df-nei 23063  df-fil 23811  df-fcls 23906
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator