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

Theorem fclsnei 22627
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 2821 . . . . 5 𝐽 = 𝐽
21fclselbas 22624 . . . 4 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴 𝐽)
3 toponuni 21522 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
43adantr 483 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝑋 = 𝐽)
54eleq2d 2898 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴𝑋𝐴 𝐽))
62, 5syl5ibr 248 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴𝑋))
7 fclsneii 22625 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹) → (𝑛𝑠) ≠ ∅)
873expb 1116 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ (𝑛 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑠𝐹)) → (𝑛𝑠) ≠ ∅)
98ralrimivva 3191 . . 3 (𝐴 ∈ (𝐽 fClus 𝐹) → ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)
106, 9jca2 516 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) → (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
11 topontop 21521 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
1211ad3antrrr 728 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐽 ∈ Top)
13 simprl 769 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜𝐽)
14 simprr 771 . . . . . . . . 9 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝐴𝑜)
15 opnneip 21727 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑜𝐽𝐴𝑜) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
1612, 13, 14, 15syl3anc 1367 . . . . . . . 8 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → 𝑜 ∈ ((nei‘𝐽)‘{𝐴}))
17 ineq1 4181 . . . . . . . . . . 11 (𝑛 = 𝑜 → (𝑛𝑠) = (𝑜𝑠))
1817neeq1d 3075 . . . . . . . . . 10 (𝑛 = 𝑜 → ((𝑛𝑠) ≠ ∅ ↔ (𝑜𝑠) ≠ ∅))
1918ralbidv 3197 . . . . . . . . 9 (𝑛 = 𝑜 → (∀𝑠𝐹 (𝑛𝑠) ≠ ∅ ↔ ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2019rspcv 3618 . . . . . . . 8 (𝑜 ∈ ((nei‘𝐽)‘{𝐴}) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2116, 20syl 17 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ (𝑜𝐽𝐴𝑜)) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
2221expr 459 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (𝐴𝑜 → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2322com23 86 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑜𝐽) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2423ralrimdva 3189 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) → (∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅ → ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
2524imdistanda 574 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
26 fclsopn 22622 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
2725, 26sylibrd 261 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅) → 𝐴 ∈ (𝐽 fClus 𝐹)))
2810, 27impbid 214 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑛 ∈ ((nei‘𝐽)‘{𝐴})∀𝑠𝐹 (𝑛𝑠) ≠ ∅)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wne 3016  wral 3138  cin 3935  c0 4291  {csn 4567   cuni 4838  cfv 6355  (class class class)co 7156  Topctop 21501  TopOnctopon 21518  neicnei 21705  Filcfil 22453   fClus cfcls 22544
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-iin 4922  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-fbas 20542  df-top 21502  df-topon 21519  df-cld 21627  df-ntr 21628  df-cls 21629  df-nei 21706  df-fil 22454  df-fcls 22549
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator