ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cldss GIF version

Theorem cldss 12311
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
StepHypRef Expression
1 cldrcl 12308 . 2 (𝑆 ∈ (Clsd‘𝐽) → 𝐽 ∈ Top)
2 iscld.1 . . . 4 𝑋 = 𝐽
32iscld 12309 . . 3 (𝐽 ∈ Top → (𝑆 ∈ (Clsd‘𝐽) ↔ (𝑆𝑋 ∧ (𝑋𝑆) ∈ 𝐽)))
43simprbda 381 . 2 ((𝐽 ∈ Top ∧ 𝑆 ∈ (Clsd‘𝐽)) → 𝑆𝑋)
51, 4mpancom 419 1 (𝑆 ∈ (Clsd‘𝐽) → 𝑆𝑋)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1332  wcel 1481  cdif 3072  wss 3075   cuni 3743  cfv 5130  Topctop 12201  Clsdccld 12298
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4053  ax-pow 4105  ax-pr 4138  ax-un 4362
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2913  df-dif 3077  df-un 3079  df-in 3081  df-ss 3088  df-pw 3516  df-sn 3537  df-pr 3538  df-op 3540  df-uni 3744  df-br 3937  df-opab 3997  df-mpt 3998  df-id 4222  df-xp 4552  df-rel 4553  df-cnv 4554  df-co 4555  df-dm 4556  df-iota 5095  df-fun 5132  df-fn 5133  df-fv 5138  df-top 12202  df-cld 12301
This theorem is referenced by:  cldss2  12312  uncld  12319  cldcls  12320  clsss2  12335
  Copyright terms: Public domain W3C validator