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

Theorem clsss 23427
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 3920 . . . . . 6 (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑥 → 𝑇 ⊆ 𝑥))
21adantr 486 . . . . 5 ((𝑇 ⊆ 𝑆 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑆 ⊆ 𝑥 → 𝑇 ⊆ 𝑥))
32ss2rabdv 4003 . . . 4 (𝑇 ⊆ 𝑆 → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥})
4 intss 4934 . . . 4 ({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
53, 4syl 18 . . 3 (𝑇 ⊆ 𝑆 → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
653ad2ant3 1153 . 2 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
7 simp1 1154 . . 3 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝐽 ∈ Top)
8 sstr2 3920 . . . . 5 (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋))
98impcom 413 . . . 4 ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋)
1093adant1 1148 . . 3 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋)
11 clscld.1 . . . 4 𝑋 = ∪ 𝐽
1211clsval 23410 . . 3 ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((cls‘𝐽)‘𝑇) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥})
137, 10, 12syl2anc 596 . 2 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥})
1411clsval 23410 . . 3 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
15143adant3 1150 . 2 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
166, 13, 153sstr4d 3968 1 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  ∪ cuni 4872  ∩ cint 4912  ‘cfv 6566  Topctop 23266  Clsdccld 23389  clsccl 23391
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 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
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-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 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-top 23267  df-cld 23392  df-cls 23394
This theorem is used by:  ntrss  23428  clsss2  23445  lpsscls  23514  lpss3  23517  cnclsi  23645  cncls  23647  lpcls  23737  cnextcn  24441  clssubg  24483  clsnsg  24484  utopreg  24626  hauseqcn  34641  kur14lem6  36184  clsint2  37332  opnregcld  37333
  Copyright terms: Public domain W3C validator