Theorem clsss 23192

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.

Step	Hyp	Ref	Expression
1		sstr2 3945	. . . . . 6 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑥 → 𝑇 ⊆ 𝑥))
2	1	adantr 485	. . . . 5 ⊢ ((𝑇 ⊆ 𝑆 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑆 ⊆ 𝑥 → 𝑇 ⊆ 𝑥))
3	2	ss2rabdv 4030	. . . 4 ⊢ (𝑇 ⊆ 𝑆 → {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥})
4		intss 4935	. . . 4 ⊢ ({𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥} ⊆ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
5	3, 4	syl 18	. . 3 ⊢ (𝑇 ⊆ 𝑆 → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
6	5	3ad2ant3 1153	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥} ⊆ ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
7		simp1 1154	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝐽 ∈ Top)
8		sstr2 3945	. . . . 5 ⊢ (𝑇 ⊆ 𝑆 → (𝑆 ⊆ 𝑋 → 𝑇 ⊆ 𝑋))
9	8	impcom 412	. . . 4 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋)
10	9	3adant1 1148	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → 𝑇 ⊆ 𝑋)
11		clscld.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
12	11	clsval 23175	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑇 ⊆ 𝑋) → ((cls‘𝐽)‘𝑇) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥})
13	7, 10, 12	syl2anc 595	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑇 ⊆ 𝑥})
14	11	clsval 23175	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
15	14	3adant3 1150	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑆) = ∩ {𝑥 ∈ (Clsd‘𝐽) ∣ 𝑆 ⊆ 𝑥})
16	6, 13, 15	3sstr4d 3993	1 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋 ∧ 𝑇 ⊆ 𝑆) → ((cls‘𝐽)‘𝑇) ⊆ ((cls‘𝐽)‘𝑆))

Syntax hints:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  {crab 3416   ⊆ wss 3906  ∪ cuni 4873  ∩ cint 4913  ‘cfv 6538  Topctop 23031  Clsdccld 23154  clsccl 23156

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-top 23032  df-cld 23157  df-cls 23159

This theorem is referenced by:  ntrss  23193  clsss2  23210  lpsscls  23279  lpss3  23282  cnclsi  23410  cncls  23412  lpcls  23502  cnextcn  24205  clssubg  24247  clsnsg  24248  utopreg  24390  hauseqcn  34269  kur14lem6  35684  clsint2  36821  opnregcld  36822