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

Theorem clsval2 23090
Description: Express closure in terms of interior. (Contributed by NM, 10-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
clscld.1 𝑋 = 𝐽
Assertion
Ref Expression
clsval2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑋 ∖ ((int‘𝐽)‘(𝑋𝑆))))

Proof of Theorem clsval2
Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-rab 3414 . . . . . 6 {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = {𝑧 ∣ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)}
2 clscld.1 . . . . . . . . . . . . 13 𝑋 = 𝐽
32cldopn 23071 . . . . . . . . . . . 12 (𝑧 ∈ (Clsd‘𝐽) → (𝑋𝑧) ∈ 𝐽)
43ad2antrl 738 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ∈ 𝐽)
5 sscon 4096 . . . . . . . . . . . . 13 (𝑆𝑧 → (𝑋𝑧) ⊆ (𝑋𝑆))
65ad2antll 739 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ⊆ (𝑋𝑆))
72topopn 22946 . . . . . . . . . . . . . 14 (𝐽 ∈ Top → 𝑋𝐽)
8 difexg 5284 . . . . . . . . . . . . . 14 (𝑋𝐽 → (𝑋𝑧) ∈ V)
9 elpwg 4557 . . . . . . . . . . . . . 14 ((𝑋𝑧) ∈ V → ((𝑋𝑧) ∈ 𝒫 (𝑋𝑆) ↔ (𝑋𝑧) ⊆ (𝑋𝑆)))
107, 8, 93syl 18 . . . . . . . . . . . . 13 (𝐽 ∈ Top → ((𝑋𝑧) ∈ 𝒫 (𝑋𝑆) ↔ (𝑋𝑧) ⊆ (𝑋𝑆)))
1110ad2antrr 736 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → ((𝑋𝑧) ∈ 𝒫 (𝑋𝑆) ↔ (𝑋𝑧) ⊆ (𝑋𝑆)))
126, 11mpbird 259 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ∈ 𝒫 (𝑋𝑆))
134, 12elind 4152 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)))
142cldss 23069 . . . . . . . . . . . . 13 (𝑧 ∈ (Clsd‘𝐽) → 𝑧𝑋)
1514ad2antrl 738 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → 𝑧𝑋)
16 dfss4 4221 . . . . . . . . . . . 12 (𝑧𝑋 ↔ (𝑋 ∖ (𝑋𝑧)) = 𝑧)
1715, 16sylib 220 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋 ∖ (𝑋𝑧)) = 𝑧)
1817eqcomd 2767 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → 𝑧 = (𝑋 ∖ (𝑋𝑧)))
19 difeq2 4074 . . . . . . . . . . 11 (𝑥 = (𝑋𝑧) → (𝑋𝑥) = (𝑋 ∖ (𝑋𝑧)))
2019rspceeqv 3604 . . . . . . . . . 10 (((𝑋𝑧) ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) ∧ 𝑧 = (𝑋 ∖ (𝑋𝑧))) → ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥))
2113, 18, 20syl2anc 593 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥))
2221ex 416 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧) → ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)))
23 simpl 486 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝐽 ∈ Top)
24 elinel1 4153 . . . . . . . . . . . 12 (𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) → 𝑥𝐽)
252opncld 23073 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑥𝐽) → (𝑋𝑥) ∈ (Clsd‘𝐽))
2623, 24, 25syl2an 605 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → (𝑋𝑥) ∈ (Clsd‘𝐽))
27 elinel2 4154 . . . . . . . . . . . . . 14 (𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) → 𝑥 ∈ 𝒫 (𝑋𝑆))
2827adantl 485 . . . . . . . . . . . . 13 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑥 ∈ 𝒫 (𝑋𝑆))
2928elpwid 4563 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑥 ⊆ (𝑋𝑆))
3029difss2d 4092 . . . . . . . . . . . . 13 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑥𝑋)
31 simplr 778 . . . . . . . . . . . . 13 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑆𝑋)
32 ssconb 4095 . . . . . . . . . . . . 13 ((𝑥𝑋𝑆𝑋) → (𝑥 ⊆ (𝑋𝑆) ↔ 𝑆 ⊆ (𝑋𝑥)))
3330, 31, 32syl2anc 593 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → (𝑥 ⊆ (𝑋𝑆) ↔ 𝑆 ⊆ (𝑋𝑥)))
3429, 33mpbid 234 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑆 ⊆ (𝑋𝑥))
3526, 34jca 519 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → ((𝑋𝑥) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ (𝑋𝑥)))
36 eleq1 2849 . . . . . . . . . . 11 (𝑧 = (𝑋𝑥) → (𝑧 ∈ (Clsd‘𝐽) ↔ (𝑋𝑥) ∈ (Clsd‘𝐽)))
37 sseq2 3962 . . . . . . . . . . 11 (𝑧 = (𝑋𝑥) → (𝑆𝑧𝑆 ⊆ (𝑋𝑥)))
3836, 37anbi12d 641 . . . . . . . . . 10 (𝑧 = (𝑋𝑥) → ((𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧) ↔ ((𝑋𝑥) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ (𝑋𝑥))))
3935, 38syl5ibrcom 249 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → (𝑧 = (𝑋𝑥) → (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)))
4039rexlimdva 3162 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥) → (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)))
4122, 40impbid 214 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧) ↔ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)))
4241abbidv 2827 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∣ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)} = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
431, 42eqtrid 2808 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
4443inteqd 4909 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
45 difexg 5284 . . . . . . 7 (𝑋𝐽 → (𝑋𝑥) ∈ V)
4645ralrimivw 3157 . . . . . 6 (𝑋𝐽 → ∀𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) ∈ V)
47 dfiin2g 4987 . . . . . 6 (∀𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) ∈ V → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
487, 46, 473syl 18 . . . . 5 (𝐽 ∈ Top → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
4948adantr 484 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
5044, 49eqtr4d 2799 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥))
512clsval 23077 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧})
52 uniiun 5015 . . . . . 6 (𝐽 ∩ 𝒫 (𝑋𝑆)) = 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥
5352difeq2i 4077 . . . . 5 (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥)
5453a1i 11 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥))
55 0opn 22944 . . . . . . 7 (𝐽 ∈ Top → ∅ ∈ 𝐽)
5655adantr 484 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∅ ∈ 𝐽)
57 0elpw 5311 . . . . . . 7 ∅ ∈ 𝒫 (𝑋𝑆)
5857a1i 11 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∅ ∈ 𝒫 (𝑋𝑆))
5956, 58elind 4152 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∅ ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)))
60 ne0i 4293 . . . . 5 (∅ ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) → (𝐽 ∩ 𝒫 (𝑋𝑆)) ≠ ∅)
61 iindif2 5033 . . . . 5 ((𝐽 ∩ 𝒫 (𝑋𝑆)) ≠ ∅ → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥))
6259, 60, 613syl 18 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥))
6354, 62eqtr4d 2799 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))) = 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥))
6450, 51, 633eqtr4d 2806 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))))
65 difssd 4090 . . . 4 (𝑆𝑋 → (𝑋𝑆) ⊆ 𝑋)
662ntrval 23076 . . . 4 ((𝐽 ∈ Top ∧ (𝑋𝑆) ⊆ 𝑋) → ((int‘𝐽)‘(𝑋𝑆)) = (𝐽 ∩ 𝒫 (𝑋𝑆)))
6765, 66sylan2 602 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘(𝑋𝑆)) = (𝐽 ∩ 𝒫 (𝑋𝑆)))
6867difeq2d 4080 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 ∖ ((int‘𝐽)‘(𝑋𝑆))) = (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))))
6964, 68eqtr4d 2799 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑋 ∖ ((int‘𝐽)‘(𝑋𝑆))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  {cab 2739  wne 2956  wral 3075  wrex 3085  {crab 3413  Vcvv 3453  cdif 3901  cin 3903  wss 3904  c0 4285  𝒫 cpw 4554   cuni 4864   cint 4904   ciun 4948   ciin 4949  cfv 6517  Topctop 22933  Clsdccld 23056  intcnt 23057  clsccl 23058
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-iun 4950  df-iin 4951  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-top 22934  df-cld 23059  df-ntr 23060  df-cls 23061
This theorem is referenced by:  ntrval2  23091  clsdif  23093  cmclsopn  23102  bcth3  25373
  Copyright terms: Public domain W3C validator