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

Theorem fclsneii 24369
Description: A neighborhood of a cluster point of a filter intersects any element of that filter. (Contributed by Jeff Hankins, 11-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)
Assertion
Ref Expression
fclsneii ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → (𝑁 ∩ 𝑆) ≠ ∅)

Proof of Theorem fclsneii
StepHypRef Expression
1 simp1 1154 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝐴 ∈ (𝐽 fClus 𝐹))
2 fclstop 24363 . . . . 5 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐽 ∈ Top)
31, 2syl 18 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝐽 ∈ Top)
4 simp2 1155 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝑁 ∈ ((nei‘𝐽)‘{𝐴}))
5 eqid 2763 . . . . . 6 ∪ 𝐽 = ∪ 𝐽
65neii1 23457 . . . . 5 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴})) → 𝑁 ⊆ ∪ 𝐽)
73, 4, 6syl2anc 596 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝑁 ⊆ ∪ 𝐽)
85ntrss2 23408 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑁) ⊆ 𝑁)
93, 7, 8syl2anc 596 . . 3 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → ((int‘𝐽)‘𝑁) ⊆ 𝑁)
109ssrind 4143 . 2 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → (((int‘𝐽)‘𝑁) ∩ 𝑆) ⊆ (𝑁 ∩ 𝑆))
115ntropn 23400 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ⊆ ∪ 𝐽) → ((int‘𝐽)‘𝑁) ∈ 𝐽)
123, 7, 11syl2anc 596 . . 3 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → ((int‘𝐽)‘𝑁) ∈ 𝐽)
135fclselbas 24368 . . . . . . . 8 (𝐴 ∈ (𝐽 fClus 𝐹) → 𝐴 ∈ ∪ 𝐽)
141, 13syl 18 . . . . . . 7 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝐴 ∈ ∪ 𝐽)
1514snssd 4747 . . . . . 6 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → {𝐴} ⊆ ∪ 𝐽)
165neiint 23455 . . . . . 6 ((𝐽 ∈ Top ∧ {𝐴} ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑁)))
173, 15, 7, 16syl3anc 1399 . . . . 5 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → (𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑁)))
184, 17mpbid 235 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → {𝐴} ⊆ ((int‘𝐽)‘𝑁))
19 snssg 4744 . . . . 5 (𝐴 ∈ ∪ 𝐽 → (𝐴 ∈ ((int‘𝐽)‘𝑁) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑁)))
2014, 19syl 18 . . . 4 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → (𝐴 ∈ ((int‘𝐽)‘𝑁) ↔ {𝐴} ⊆ ((int‘𝐽)‘𝑁)))
2118, 20mpbird 260 . . 3 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝐴 ∈ ((int‘𝐽)‘𝑁))
22 simp3 1156 . . 3 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → 𝑆 ∈ 𝐹)
23 fclsopni 24367 . . 3 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ (((int‘𝐽)‘𝑁) ∈ 𝐽 ∧ 𝐴 ∈ ((int‘𝐽)‘𝑁) ∧ 𝑆 ∈ 𝐹)) → (((int‘𝐽)‘𝑁) ∩ 𝑆) ≠ ∅)
241, 12, 21, 22, 23syl13anc 1400 . 2 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → (((int‘𝐽)‘𝑁) ∩ 𝑆) ≠ ∅)
25 ssn0 4358 . 2 (((((int‘𝐽)‘𝑁) ∩ 𝑆) ⊆ (𝑁 ∩ 𝑆) ∧ (((int‘𝐽)‘𝑁) ∩ 𝑆) ≠ ∅) → (𝑁 ∩ 𝑆) ≠ ∅)
2610, 24, 25syl2anc 596 1 ((𝐴 ∈ (𝐽 fClus 𝐹) ∧ 𝑁 ∈ ((nei‘𝐽)‘{𝐴}) ∧ 𝑆 ∈ 𝐹) → (𝑁 ∩ 𝑆) ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   ∈ wcel 2147   ≠ wne 2959   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  {csn 4588  ∪ cuni 4870  ‘cfv 6561  (class class class)co 7446  Topctop 23244  intcnt 23368  neicnei 23448   fClus cfcls 24288
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-fbas 21708  df-top 23245  df-topon 23262  df-cld 23370  df-ntr 23371  df-cls 23372  df-nei 23449  df-fil 24198  df-fcls 24293
This theorem is used by:  fclsnei  24371  fclsfnflim  24379
  Copyright terms: Public domain W3C validator