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

Theorem clsss 20668
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 3575 . . . . . 6 (𝑇𝑆 → (𝑆𝑥𝑇𝑥))
21adantr 480 . . . . 5 ((𝑇𝑆𝑥 ∈ (Clsd‘𝐽)) → (𝑆𝑥𝑇𝑥))
32ss2rabdv 3646 . . . 4 (𝑇𝑆 → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥})
4 intss 4433 . . . 4 ({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
53, 4syl 17 . . 3 (𝑇𝑆 {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
653ad2ant3 1077 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
7 simp1 1054 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → 𝐽 ∈ Top)
8 sstr2 3575 . . . . 5 (𝑇𝑆 → (𝑆𝑋𝑇𝑋))
98impcom 445 . . . 4 ((𝑆𝑋𝑇𝑆) → 𝑇𝑋)
1093adant1 1072 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → 𝑇𝑋)
11 clscld.1 . . . 4 𝑋 = 𝐽
1211clsval 20651 . . 3 ((𝐽 ∈ Top ∧ 𝑇𝑋) → ((cls‘𝐽)‘𝑇) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥})
137, 10, 12syl2anc 691 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑇) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇𝑥})
1411clsval 20651 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
15143adant3 1074 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑆) = {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆𝑥})
166, 13, 153sstr4d 3611 1 ((𝐽 ∈ Top ∧ 𝑆𝑋𝑇𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1031   = wceq 1475  wcel 1977  {crab 2900  wss 3540   cuni 4372   cint 4410  cfv 5804  Topctop 20517  Clsdccld 20630  clsccl 20632
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-top 20521  df-cld 20633  df-cls 20635
This theorem is referenced by:  ntrss  20669  clsss2  20686  lpsscls  20755  lpss3  20758  cnclsi  20886  cncls  20888  lpcls  20978  cnextcn  21681  clssubg  21722  clsnsg  21723  utopreg  21866  hauseqcn  29269  kur14lem6  30447  clsint2  31494  opnregcld  31495
  Copyright terms: Public domain W3C validator