Theorem cldss 14828

Description: A closed set is a subset of the underlying set of a topology. (Contributed by NM, 5-Oct-2006.) (Revised by Stefan O'Rear, 22-Feb-2015.)

Hypothesis

Ref	Expression
iscld.1	⊢ 𝑋 = ∪ 𝐽

Assertion

Ref	Expression
cldss	⊢ (𝑆 ∈ (Clsd‘𝐽) → 𝑆 ⊆ 𝑋)

Proof of Theorem cldss

Step	Hyp	Ref	Expression
1		cldrcl 14825	. 2 ⊢ (𝑆 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
2		iscld.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
3	2	iscld 14826	. . 3 ⊢ (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ (𝑆 ⊆ 𝑋 ∧ (𝑋 ∖ 𝑆) ∈ 𝐽)))
4	3	simprbda 383	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ∈ (Clsd‘𝐽)) → 𝑆 ⊆ 𝑋)
5	1, 4	mpancom 422	1 ⊢ (𝑆 ∈ (Clsd‘𝐽) → 𝑆 ⊆ 𝑋)

Syntax hints:   → wi 4   = wceq 1397   ∈ wcel 2202   ∖ cdif 3197   ⊆ wss 3200  ∪ cuni 3893  ‘cfv 5326  Topctop 14720  Clsdccld 14815

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-top 14721  df-cld 14818

This theorem is referenced by:  cldss2  14829  uncld  14836  cldcls  14837  clsss2  14852