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

Theorem fclsopn 23922
Description: Write the cluster point condition in terms of open sets. (Contributed by Jeff Hankins, 10-Nov-2009.) (Revised by Mario Carneiro, 26-Aug-2015.)
Assertion
Ref Expression
fclsopn ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
Distinct variable groups:   𝑜,𝑠,𝐴   𝑜,𝐹,𝑠   𝑜,𝐽,𝑠   𝑜,𝑋,𝑠

Proof of Theorem fclsopn
StepHypRef Expression
1 isfcls2 23921 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ ∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
2 filn0 23770 . . . . . 6 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ≠ ∅)
32adantl 481 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → 𝐹 ≠ ∅)
4 r19.2z 4443 . . . . . 6 ((𝐹 ≠ ∅ ∧ ∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)) → ∃𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))
54ex 412 . . . . 5 (𝐹 ≠ ∅ → (∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → ∃𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
63, 5syl 17 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → ∃𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)))
7 topontop 22821 . . . . . . . . 9 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
87ad2antrr 726 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → 𝐽 ∈ Top)
9 filelss 23760 . . . . . . . . . 10 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠𝐹) → 𝑠𝑋)
109adantll 714 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → 𝑠𝑋)
11 toponuni 22822 . . . . . . . . . 10 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = 𝐽)
1211ad2antrr 726 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → 𝑋 = 𝐽)
1310, 12sseqtrd 3969 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → 𝑠 𝐽)
14 eqid 2730 . . . . . . . . 9 𝐽 = 𝐽
1514clsss3 22967 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑠 𝐽) → ((cls‘𝐽)‘𝑠) ⊆ 𝐽)
168, 13, 15syl2anc 584 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → ((cls‘𝐽)‘𝑠) ⊆ 𝐽)
1716, 12sseqtrrd 3970 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → ((cls‘𝐽)‘𝑠) ⊆ 𝑋)
1817sseld 3931 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝑠𝐹) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴𝑋))
1918rexlimdva 3131 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∃𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴𝑋))
206, 19syld 47 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) → 𝐴𝑋))
2120pm4.71rd 562 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ (𝐴𝑋 ∧ ∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠))))
227ad3antrrr 730 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑠𝐹) → 𝐽 ∈ Top)
2313adantlr 715 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑠𝐹) → 𝑠 𝐽)
24 simplr 768 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑠𝐹) → 𝐴𝑋)
2511ad3antrrr 730 . . . . . . 7 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑠𝐹) → 𝑋 = 𝐽)
2624, 25eleqtrd 2831 . . . . . 6 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑠𝐹) → 𝐴 𝐽)
2714elcls 22981 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑠 𝐽𝐴 𝐽) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜𝐽 (𝐴𝑜 → (𝑜𝑠) ≠ ∅)))
2822, 23, 26, 27syl3anc 1373 . . . . 5 ((((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) ∧ 𝑠𝐹) → (𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜𝐽 (𝐴𝑜 → (𝑜𝑠) ≠ ∅)))
2928ralbidva 3151 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) → (∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑠𝐹𝑜𝐽 (𝐴𝑜 → (𝑜𝑠) ≠ ∅)))
30 ralcom 3258 . . . . 5 (∀𝑠𝐹𝑜𝐽 (𝐴𝑜 → (𝑜𝑠) ≠ ∅) ↔ ∀𝑜𝐽𝑠𝐹 (𝐴𝑜 → (𝑜𝑠) ≠ ∅))
31 r19.21v 3155 . . . . . 6 (∀𝑠𝐹 (𝐴𝑜 → (𝑜𝑠) ≠ ∅) ↔ (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
3231ralbii 3076 . . . . 5 (∀𝑜𝐽𝑠𝐹 (𝐴𝑜 → (𝑜𝑠) ≠ ∅) ↔ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
3330, 32bitri 275 . . . 4 (∀𝑠𝐹𝑜𝐽 (𝐴𝑜 → (𝑜𝑠) ≠ ∅) ↔ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))
3429, 33bitrdi 287 . . 3 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) ∧ 𝐴𝑋) → (∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠) ↔ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅)))
3534pm5.32da 579 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → ((𝐴𝑋 ∧ ∀𝑠𝐹 𝐴 ∈ ((cls‘𝐽)‘𝑠)) ↔ (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
361, 21, 353bitrd 305 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝐴 ∈ (𝐽 fClus 𝐹) ↔ (𝐴𝑋 ∧ ∀𝑜𝐽 (𝐴𝑜 → ∀𝑠𝐹 (𝑜𝑠) ≠ ∅))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2110  wne 2926  wral 3045  wrex 3054  cin 3899  wss 3900  c0 4281   cuni 4857  cfv 6477  (class class class)co 7341  Topctop 22801  TopOnctopon 22818  clsccl 22926  Filcfil 23753   fClus cfcls 23844
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 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663
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 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-nel 3031  df-ral 3046  df-rex 3055  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-int 4896  df-iun 4941  df-iin 4942  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-ov 7344  df-oprab 7345  df-mpo 7346  df-fbas 21281  df-top 22802  df-topon 22819  df-cld 22927  df-ntr 22928  df-cls 22929  df-fil 23754  df-fcls 23849
This theorem is referenced by:  fclsopni  23923  fclselbas  23924  fclsnei  23927  fclsbas  23929  fclsss1  23930  fclsrest  23932  fclscf  23933  isfcf  23942
  Copyright terms: Public domain W3C validator