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

Theorem fclsss2 22723
 Description: A finer filter has fewer cluster points. (Contributed by Jeff Hankins, 11-Nov-2009.) (Revised by Mario Carneiro, 26-Aug-2015.)
Assertion
Ref Expression
fclsss2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) → (𝐽 fClus 𝐺) ⊆ (𝐽 fClus 𝐹))

Proof of Theorem fclsss2
Dummy variables 𝑠 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl3 1190 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → 𝐹𝐺)
2 ssralv 3958 . . . . . 6 (𝐹𝐺 → (∀𝑠𝐺 𝑥 ∈ ((cls‘𝐽)‘𝑠) → ∀𝑠𝐹 𝑥 ∈ ((cls‘𝐽)‘𝑠)))
31, 2syl 17 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → (∀𝑠𝐺 𝑥 ∈ ((cls‘𝐽)‘𝑠) → ∀𝑠𝐹 𝑥 ∈ ((cls‘𝐽)‘𝑠)))
4 simpl1 1188 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → 𝐽 ∈ (TopOn‘𝑋))
5 fclstopon 22712 . . . . . . . 8 (𝑥 ∈ (𝐽 fClus 𝐺) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐺 ∈ (Fil‘𝑋)))
65adantl 485 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → (𝐽 ∈ (TopOn‘𝑋) ↔ 𝐺 ∈ (Fil‘𝑋)))
74, 6mpbid 235 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → 𝐺 ∈ (Fil‘𝑋))
8 isfcls2 22713 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐺 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fClus 𝐺) ↔ ∀𝑠𝐺 𝑥 ∈ ((cls‘𝐽)‘𝑠)))
94, 7, 8syl2anc 587 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → (𝑥 ∈ (𝐽 fClus 𝐺) ↔ ∀𝑠𝐺 𝑥 ∈ ((cls‘𝐽)‘𝑠)))
10 simpl2 1189 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → 𝐹 ∈ (Fil‘𝑋))
11 isfcls2 22713 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋)) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∀𝑠𝐹 𝑥 ∈ ((cls‘𝐽)‘𝑠)))
124, 10, 11syl2anc 587 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → (𝑥 ∈ (𝐽 fClus 𝐹) ↔ ∀𝑠𝐹 𝑥 ∈ ((cls‘𝐽)‘𝑠)))
133, 9, 123imtr4d 297 . . . 4 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) ∧ 𝑥 ∈ (𝐽 fClus 𝐺)) → (𝑥 ∈ (𝐽 fClus 𝐺) → 𝑥 ∈ (𝐽 fClus 𝐹)))
1413ex 416 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) → (𝑥 ∈ (𝐽 fClus 𝐺) → (𝑥 ∈ (𝐽 fClus 𝐺) → 𝑥 ∈ (𝐽 fClus 𝐹))))
1514pm2.43d 53 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) → (𝑥 ∈ (𝐽 fClus 𝐺) → 𝑥 ∈ (𝐽 fClus 𝐹)))
1615ssrdv 3898 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 ∈ (Fil‘𝑋) ∧ 𝐹𝐺) → (𝐽 fClus 𝐺) ⊆ (𝐽 fClus 𝐹))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   ∈ wcel 2111  ∀wral 3070   ⊆ wss 3858  ‘cfv 6335  (class class class)co 7150  TopOnctopon 21610  clsccl 21718  Filcfil 22545   fClus cfcls 22636 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2729  ax-sep 5169  ax-nul 5176  ax-pow 5234  ax-pr 5298  ax-un 7459 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2557  df-eu 2588  df-clab 2736  df-cleq 2750  df-clel 2830  df-nfc 2901  df-ne 2952  df-nel 3056  df-ral 3075  df-rex 3076  df-rab 3079  df-v 3411  df-sbc 3697  df-csb 3806  df-dif 3861  df-un 3863  df-in 3865  df-ss 3875  df-nul 4226  df-if 4421  df-pw 4496  df-sn 4523  df-pr 4525  df-op 4529  df-uni 4799  df-int 4839  df-iin 4886  df-br 5033  df-opab 5095  df-mpt 5113  df-id 5430  df-xp 5530  df-rel 5531  df-cnv 5532  df-co 5533  df-dm 5534  df-rn 5535  df-res 5536  df-ima 5537  df-iota 6294  df-fun 6337  df-fn 6338  df-fv 6343  df-ov 7153  df-oprab 7154  df-mpo 7155  df-fbas 20163  df-topon 21611  df-fil 22546  df-fcls 22641 This theorem is referenced by:  fclsfnflim  22727  ufilcmp  22732  cnpfcfi  22740
 Copyright terms: Public domain W3C validator