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

Theorem restcld 22304
Description: A closed set of a subspace topology is a closed set of the original topology intersected with the subset. (Contributed by FL, 11-Jul-2009.) (Proof shortened by Mario Carneiro, 15-Dec-2013.)
Hypothesis
Ref Expression
restcld.1 𝑋 = 𝐽
Assertion
Ref Expression
restcld ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐴 ∈ (Clsd‘(𝐽t 𝑆)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐽   𝑥,𝑆   𝑥,𝑋

Proof of Theorem restcld
Dummy variable 𝑜 is distinct from all other variables.
StepHypRef Expression
1 id 22 . . . . 5 (𝑆𝑋𝑆𝑋)
2 restcld.1 . . . . . 6 𝑋 = 𝐽
32topopn 22036 . . . . 5 (𝐽 ∈ Top → 𝑋𝐽)
4 ssexg 5250 . . . . 5 ((𝑆𝑋𝑋𝐽) → 𝑆 ∈ V)
51, 3, 4syl2anr 596 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ∈ V)
6 resttop 22292 . . . 4 ((𝐽 ∈ Top ∧ 𝑆 ∈ V) → (𝐽t 𝑆) ∈ Top)
75, 6syldan 590 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐽t 𝑆) ∈ Top)
8 eqid 2739 . . . 4 (𝐽t 𝑆) = (𝐽t 𝑆)
98iscld 22159 . . 3 ((𝐽t 𝑆) ∈ Top → (𝐴 ∈ (Clsd‘(𝐽t 𝑆)) ↔ (𝐴 (𝐽t 𝑆) ∧ ( (𝐽t 𝑆) ∖ 𝐴) ∈ (𝐽t 𝑆))))
107, 9syl 17 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐴 ∈ (Clsd‘(𝐽t 𝑆)) ↔ (𝐴 (𝐽t 𝑆) ∧ ( (𝐽t 𝑆) ∖ 𝐴) ∈ (𝐽t 𝑆))))
112restuni 22294 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 = (𝐽t 𝑆))
1211sseq2d 3957 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐴𝑆𝐴 (𝐽t 𝑆)))
1311difeq1d 4060 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑆𝐴) = ( (𝐽t 𝑆) ∖ 𝐴))
1413eleq1d 2824 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑆𝐴) ∈ (𝐽t 𝑆) ↔ ( (𝐽t 𝑆) ∖ 𝐴) ∈ (𝐽t 𝑆)))
1512, 14anbi12d 630 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆)) ↔ (𝐴 (𝐽t 𝑆) ∧ ( (𝐽t 𝑆) ∖ 𝐴) ∈ (𝐽t 𝑆))))
16 elrest 17119 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆 ∈ V) → ((𝑆𝐴) ∈ (𝐽t 𝑆) ↔ ∃𝑜𝐽 (𝑆𝐴) = (𝑜𝑆)))
175, 16syldan 590 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑆𝐴) ∈ (𝐽t 𝑆) ↔ ∃𝑜𝐽 (𝑆𝐴) = (𝑜𝑆)))
1817anbi2d 628 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆)) ↔ (𝐴𝑆 ∧ ∃𝑜𝐽 (𝑆𝐴) = (𝑜𝑆))))
192opncld 22165 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑜𝐽) → (𝑋𝑜) ∈ (Clsd‘𝐽))
2019ad5ant14 754 . . . . . . 7 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → (𝑋𝑜) ∈ (Clsd‘𝐽))
21 incom 4139 . . . . . . . . . . . 12 (𝑋𝑆) = (𝑆𝑋)
22 df-ss 3908 . . . . . . . . . . . . 13 (𝑆𝑋 ↔ (𝑆𝑋) = 𝑆)
2322biimpi 215 . . . . . . . . . . . 12 (𝑆𝑋 → (𝑆𝑋) = 𝑆)
2421, 23eqtrid 2791 . . . . . . . . . . 11 (𝑆𝑋 → (𝑋𝑆) = 𝑆)
2524ad4antlr 729 . . . . . . . . . 10 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → (𝑋𝑆) = 𝑆)
2625difeq1d 4060 . . . . . . . . 9 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → ((𝑋𝑆) ∖ 𝑜) = (𝑆𝑜))
27 difeq2 4055 . . . . . . . . . . 11 ((𝑆𝐴) = (𝑜𝑆) → (𝑆 ∖ (𝑆𝐴)) = (𝑆 ∖ (𝑜𝑆)))
28 difindi 4220 . . . . . . . . . . . 12 (𝑆 ∖ (𝑜𝑆)) = ((𝑆𝑜) ∪ (𝑆𝑆))
29 difid 4309 . . . . . . . . . . . . 13 (𝑆𝑆) = ∅
3029uneq2i 4098 . . . . . . . . . . . 12 ((𝑆𝑜) ∪ (𝑆𝑆)) = ((𝑆𝑜) ∪ ∅)
31 un0 4329 . . . . . . . . . . . 12 ((𝑆𝑜) ∪ ∅) = (𝑆𝑜)
3228, 30, 313eqtri 2771 . . . . . . . . . . 11 (𝑆 ∖ (𝑜𝑆)) = (𝑆𝑜)
3327, 32eqtrdi 2795 . . . . . . . . . 10 ((𝑆𝐴) = (𝑜𝑆) → (𝑆 ∖ (𝑆𝐴)) = (𝑆𝑜))
3433adantl 481 . . . . . . . . 9 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → (𝑆 ∖ (𝑆𝐴)) = (𝑆𝑜))
35 dfss4 4197 . . . . . . . . . . 11 (𝐴𝑆 ↔ (𝑆 ∖ (𝑆𝐴)) = 𝐴)
3635biimpi 215 . . . . . . . . . 10 (𝐴𝑆 → (𝑆 ∖ (𝑆𝐴)) = 𝐴)
3736ad3antlr 727 . . . . . . . . 9 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → (𝑆 ∖ (𝑆𝐴)) = 𝐴)
3826, 34, 373eqtr2rd 2786 . . . . . . . 8 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → 𝐴 = ((𝑋𝑆) ∖ 𝑜))
3921difeq1i 4057 . . . . . . . . 9 ((𝑋𝑆) ∖ 𝑜) = ((𝑆𝑋) ∖ 𝑜)
40 indif2 4209 . . . . . . . . 9 (𝑆 ∩ (𝑋𝑜)) = ((𝑆𝑋) ∖ 𝑜)
41 incom 4139 . . . . . . . . 9 (𝑆 ∩ (𝑋𝑜)) = ((𝑋𝑜) ∩ 𝑆)
4239, 40, 413eqtr2i 2773 . . . . . . . 8 ((𝑋𝑆) ∖ 𝑜) = ((𝑋𝑜) ∩ 𝑆)
4338, 42eqtrdi 2795 . . . . . . 7 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → 𝐴 = ((𝑋𝑜) ∩ 𝑆))
44 ineq1 4144 . . . . . . . 8 (𝑥 = (𝑋𝑜) → (𝑥𝑆) = ((𝑋𝑜) ∩ 𝑆))
4544rspceeqv 3575 . . . . . . 7 (((𝑋𝑜) ∈ (Clsd‘𝐽) ∧ 𝐴 = ((𝑋𝑜) ∩ 𝑆)) → ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆))
4620, 43, 45syl2anc 583 . . . . . 6 (((((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) ∧ 𝑜𝐽) ∧ (𝑆𝐴) = (𝑜𝑆)) → ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆))
4746rexlimdva2 3217 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝐴𝑆) → (∃𝑜𝐽 (𝑆𝐴) = (𝑜𝑆) → ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆)))
4847expimpd 453 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐴𝑆 ∧ ∃𝑜𝐽 (𝑆𝐴) = (𝑜𝑆)) → ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆)))
4918, 48sylbid 239 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆)) → ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆)))
50 difindi 4220 . . . . . . . . . 10 (𝑆 ∖ (𝑥𝑆)) = ((𝑆𝑥) ∪ (𝑆𝑆))
5129uneq2i 4098 . . . . . . . . . 10 ((𝑆𝑥) ∪ (𝑆𝑆)) = ((𝑆𝑥) ∪ ∅)
52 un0 4329 . . . . . . . . . 10 ((𝑆𝑥) ∪ ∅) = (𝑆𝑥)
5350, 51, 523eqtri 2771 . . . . . . . . 9 (𝑆 ∖ (𝑥𝑆)) = (𝑆𝑥)
54 difin2 4230 . . . . . . . . . 10 (𝑆𝑋 → (𝑆𝑥) = ((𝑋𝑥) ∩ 𝑆))
5554adantl 481 . . . . . . . . 9 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑆𝑥) = ((𝑋𝑥) ∩ 𝑆))
5653, 55eqtrid 2791 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑆 ∖ (𝑥𝑆)) = ((𝑋𝑥) ∩ 𝑆))
5756adantr 480 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑆 ∖ (𝑥𝑆)) = ((𝑋𝑥) ∩ 𝑆))
58 simpll 763 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝐽 ∈ Top)
595adantr 480 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑆 ∈ V)
602cldopn 22163 . . . . . . . . 9 (𝑥 ∈ (Clsd‘𝐽) → (𝑋𝑥) ∈ 𝐽)
6160adantl 481 . . . . . . . 8 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑋𝑥) ∈ 𝐽)
62 elrestr 17120 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆 ∈ V ∧ (𝑋𝑥) ∈ 𝐽) → ((𝑋𝑥) ∩ 𝑆) ∈ (𝐽t 𝑆))
6358, 59, 61, 62syl3anc 1369 . . . . . . 7 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → ((𝑋𝑥) ∩ 𝑆) ∈ (𝐽t 𝑆))
6457, 63eqeltrd 2840 . . . . . 6 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝑆 ∖ (𝑥𝑆)) ∈ (𝐽t 𝑆))
65 inss2 4168 . . . . . 6 (𝑥𝑆) ⊆ 𝑆
6664, 65jctil 519 . . . . 5 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → ((𝑥𝑆) ⊆ 𝑆 ∧ (𝑆 ∖ (𝑥𝑆)) ∈ (𝐽t 𝑆)))
67 sseq1 3950 . . . . . 6 (𝐴 = (𝑥𝑆) → (𝐴𝑆 ↔ (𝑥𝑆) ⊆ 𝑆))
68 difeq2 4055 . . . . . . 7 (𝐴 = (𝑥𝑆) → (𝑆𝐴) = (𝑆 ∖ (𝑥𝑆)))
6968eleq1d 2824 . . . . . 6 (𝐴 = (𝑥𝑆) → ((𝑆𝐴) ∈ (𝐽t 𝑆) ↔ (𝑆 ∖ (𝑥𝑆)) ∈ (𝐽t 𝑆)))
7067, 69anbi12d 630 . . . . 5 (𝐴 = (𝑥𝑆) → ((𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆)) ↔ ((𝑥𝑆) ⊆ 𝑆 ∧ (𝑆 ∖ (𝑥𝑆)) ∈ (𝐽t 𝑆))))
7166, 70syl5ibrcom 246 . . . 4 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (Clsd‘𝐽)) → (𝐴 = (𝑥𝑆) → (𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆))))
7271rexlimdva 3214 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆) → (𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆))))
7349, 72impbid 211 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝐴𝑆 ∧ (𝑆𝐴) ∈ (𝐽t 𝑆)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆)))
7410, 15, 733bitr2d 306 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐴 ∈ (Clsd‘(𝐽t 𝑆)) ↔ ∃𝑥 ∈ (Clsd‘𝐽)𝐴 = (𝑥𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1541  wcel 2109  wrex 3066  Vcvv 3430  cdif 3888  cun 3889  cin 3890  wss 3891  c0 4261   cuni 4844  cfv 6430  (class class class)co 7268  t crest 17112  Topctop 22023  Clsdccld 22148
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-rep 5213  ax-sep 5226  ax-nul 5233  ax-pow 5291  ax-pr 5355  ax-un 7579
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ne 2945  df-ral 3070  df-rex 3071  df-reu 3072  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-pss 3910  df-nul 4262  df-if 4465  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4845  df-int 4885  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-tr 5196  df-id 5488  df-eprel 5494  df-po 5502  df-so 5503  df-fr 5543  df-we 5545  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-res 5600  df-ima 5601  df-ord 6266  df-on 6267  df-lim 6268  df-suc 6269  df-iota 6388  df-fun 6432  df-fn 6433  df-f 6434  df-f1 6435  df-fo 6436  df-f1o 6437  df-fv 6438  df-ov 7271  df-oprab 7272  df-mpo 7273  df-om 7701  df-1st 7817  df-2nd 7818  df-en 8708  df-fin 8711  df-fi 9131  df-rest 17114  df-topgen 17135  df-top 22024  df-topon 22041  df-bases 22077  df-cld 22151
This theorem is referenced by:  restcldi  22305  restcldr  22306  restcls  22313  connsubclo  22556  cldllycmp  22627  iscnrm3rlem2  46187
  Copyright terms: Public domain W3C validator