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

Theorem clsss 22957
Description: Subset relationship for closure. (Contributed by NM, 10-Feb-2007.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
clsss ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆))

Proof of Theorem clsss
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 sstr2 3944 . . . . . 6 (𝑇𝑆 → (𝑆𝑥𝑇𝑥))
21adantr 480 . . . . 5 ((𝑇𝑆𝑥 ∈ (Clsd‘𝐽)) → (𝑆𝑥𝑇𝑥))
32ss2rabdv 4029 . . . 4 (𝑇𝑆 → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥})
4 intss 4922 . . . 4 ({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
53, 4syl 17 . . 3 (𝑇𝑆 {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
653ad2ant3 1135 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
7 simp1 1136 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → 𝐽 ∈ Top)
8 sstr2 3944 . . . . 5 (𝑇𝑆 → (𝑆𝑋𝑇𝑋))
98impcom 407 . . . 4 ((𝑆𝑋𝑇𝑆) → 𝑇𝑋)
1093adant1 1130 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → 𝑇𝑋)
11 clscld.1 . . . 4 𝑋 = 𝐽
1211clsval 22940 . . 3 ((𝐽 ∈ Top ∧ 𝑇𝑋) → ((cls‘𝐽)‘𝑇) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥})
137, 10, 12syl2anc 584 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑇) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥})
1411clsval 22940 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
15143adant3 1132 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑆) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
166, 13, 153sstr4d 3993 1 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1540  wcel 2109  {crab 3396  wss 3905   cuni 4861   cint 4899  cfv 6486  Topctop 22796  Clsdccld 22919  clsccl 22921
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-top 22797  df-cld 22922  df-cls 22924
This theorem is referenced by:  ntrss  22958  clsss2  22975  lpsscls  23044  lpss3  23047  cnclsi  23175  cncls  23177  lpcls  23267  cnextcn  23970  clssubg  24012  clsnsg  24013  utopreg  24156  hauseqcn  33867  kur14lem6  35186  clsint2  36305  opnregcld  36306
  Copyright terms: Public domain W3C validator