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

Theorem clsval2 20664
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 2905 . . . . . 6 {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = {𝑧 ∣ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)}
2 clscld.1 . . . . . . . . . . . . 13 𝑋 = 𝐽
32cldopn 20645 . . . . . . . . . . . 12 (𝑧 ∈ (Clsd‘𝐽) → (𝑋𝑧) ∈ 𝐽)
43ad2antrl 760 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ∈ 𝐽)
5 sscon 3706 . . . . . . . . . . . . 13 (𝑆𝑧 → (𝑋𝑧) ⊆ (𝑋𝑆))
65ad2antll 761 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ⊆ (𝑋𝑆))
72topopn 20536 . . . . . . . . . . . . . 14 (𝐽 ∈ Top → 𝑋𝐽)
8 difexg 4735 . . . . . . . . . . . . . 14 (𝑋𝐽 → (𝑋𝑧) ∈ V)
9 elpwg 4116 . . . . . . . . . . . . . 14 ((𝑋𝑧) ∈ V → ((𝑋𝑧) ∈ 𝒫 (𝑋𝑆) ↔ (𝑋𝑧) ⊆ (𝑋𝑆)))
107, 8, 93syl 18 . . . . . . . . . . . . 13 (𝐽 ∈ Top → ((𝑋𝑧) ∈ 𝒫 (𝑋𝑆) ↔ (𝑋𝑧) ⊆ (𝑋𝑆)))
1110ad2antrr 758 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → ((𝑋𝑧) ∈ 𝒫 (𝑋𝑆) ↔ (𝑋𝑧) ⊆ (𝑋𝑆)))
126, 11mpbird 246 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ∈ 𝒫 (𝑋𝑆))
134, 12elind 3760 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋𝑧) ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)))
142cldss 20643 . . . . . . . . . . . . 13 (𝑧 ∈ (Clsd‘𝐽) → 𝑧𝑋)
1514ad2antrl 760 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → 𝑧𝑋)
16 dfss4 3820 . . . . . . . . . . . 12 (𝑧𝑋 ↔ (𝑋 ∖ (𝑋𝑧)) = 𝑧)
1715, 16sylib 207 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → (𝑋 ∖ (𝑋𝑧)) = 𝑧)
1817eqcomd 2616 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → 𝑧 = (𝑋 ∖ (𝑋𝑧)))
19 difeq2 3684 . . . . . . . . . . . 12 (𝑥 = (𝑋𝑧) → (𝑋𝑥) = (𝑋 ∖ (𝑋𝑧)))
2019eqeq2d 2620 . . . . . . . . . . 11 (𝑥 = (𝑋𝑧) → (𝑧 = (𝑋𝑥) ↔ 𝑧 = (𝑋 ∖ (𝑋𝑧))))
2120rspcev 3282 . . . . . . . . . 10 (((𝑋𝑧) ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) ∧ 𝑧 = (𝑋 ∖ (𝑋𝑧))) → ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥))
2213, 18, 21syl2anc 691 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)) → ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥))
2322ex 449 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧) → ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)))
24 simpl 472 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝐽 ∈ Top)
25 elin 3758 . . . . . . . . . . . . 13 (𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) ↔ (𝑥𝐽𝑥 ∈ 𝒫 (𝑋𝑆)))
2625simplbi 475 . . . . . . . . . . . 12 (𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) → 𝑥𝐽)
272opncld 20647 . . . . . . . . . . . 12 ((𝐽 ∈ Top ∧ 𝑥𝐽) → (𝑋𝑥) ∈ (Clsd‘𝐽))
2824, 26, 27syl2an 493 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → (𝑋𝑥) ∈ (Clsd‘𝐽))
2925simprbi 479 . . . . . . . . . . . . . 14 (𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) → 𝑥 ∈ 𝒫 (𝑋𝑆))
3029adantl 481 . . . . . . . . . . . . 13 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑥 ∈ 𝒫 (𝑋𝑆))
3130elpwid 4118 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑥 ⊆ (𝑋𝑆))
3231difss2d 3702 . . . . . . . . . . . . 13 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑥𝑋)
33 simplr 788 . . . . . . . . . . . . 13 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑆𝑋)
34 ssconb 3705 . . . . . . . . . . . . 13 ((𝑥𝑋𝑆𝑋) → (𝑥 ⊆ (𝑋𝑆) ↔ 𝑆 ⊆ (𝑋𝑥)))
3532, 33, 34syl2anc 691 . . . . . . . . . . . 12 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → (𝑥 ⊆ (𝑋𝑆) ↔ 𝑆 ⊆ (𝑋𝑥)))
3631, 35mpbid 221 . . . . . . . . . . 11 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → 𝑆 ⊆ (𝑋𝑥))
3728, 36jca 553 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → ((𝑋𝑥) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ (𝑋𝑥)))
38 eleq1 2676 . . . . . . . . . . 11 (𝑧 = (𝑋𝑥) → (𝑧 ∈ (Clsd‘𝐽) ↔ (𝑋𝑥) ∈ (Clsd‘𝐽)))
39 sseq2 3590 . . . . . . . . . . 11 (𝑧 = (𝑋𝑥) → (𝑆𝑧𝑆 ⊆ (𝑋𝑥)))
4038, 39anbi12d 743 . . . . . . . . . 10 (𝑧 = (𝑋𝑥) → ((𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧) ↔ ((𝑋𝑥) ∈ (Clsd‘𝐽) ∧ 𝑆 ⊆ (𝑋𝑥))))
4137, 40syl5ibrcom 236 . . . . . . . . 9 (((𝐽 ∈ Top ∧ 𝑆𝑋) ∧ 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))) → (𝑧 = (𝑋𝑥) → (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)))
4241rexlimdva 3013 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥) → (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)))
4323, 42impbid 201 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧) ↔ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)))
4443abbidv 2728 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∣ (𝑧 ∈ (Clsd‘𝐽) ∧ 𝑆𝑧)} = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
451, 44syl5eq 2656 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
4645inteqd 4415 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
47 difexg 4735 . . . . . . 7 (𝑋𝐽 → (𝑋𝑥) ∈ V)
4847ralrimivw 2950 . . . . . 6 (𝑋𝐽 → ∀𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) ∈ V)
49 dfiin2g 4489 . . . . . 6 (∀𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) ∈ V → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
507, 48, 493syl 18 . . . . 5 (𝐽 ∈ Top → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
5150adantr 480 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = {𝑧 ∣ ∃𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑧 = (𝑋𝑥)})
5246, 51eqtr4d 2647 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧} = 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥))
532clsval 20651 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = {𝑧 ∈ (Clsd‘𝐽) ∣ 𝑆𝑧})
54 uniiun 4509 . . . . . 6 (𝐽 ∩ 𝒫 (𝑋𝑆)) = 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥
5554difeq2i 3687 . . . . 5 (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥)
5655a1i 11 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥))
57 0opn 20534 . . . . . . 7 (𝐽 ∈ Top → ∅ ∈ 𝐽)
5857adantr 480 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∅ ∈ 𝐽)
59 0elpw 4760 . . . . . . 7 ∅ ∈ 𝒫 (𝑋𝑆)
6059a1i 11 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∅ ∈ 𝒫 (𝑋𝑆))
6158, 60elind 3760 . . . . 5 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ∅ ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)))
62 ne0i 3880 . . . . 5 (∅ ∈ (𝐽 ∩ 𝒫 (𝑋𝑆)) → (𝐽 ∩ 𝒫 (𝑋𝑆)) ≠ ∅)
63 iindif2 4525 . . . . 5 ((𝐽 ∩ 𝒫 (𝑋𝑆)) ≠ ∅ → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥))
6461, 62, 633syl 18 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥) = (𝑋 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))𝑥))
6556, 64eqtr4d 2647 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))) = 𝑥 ∈ (𝐽 ∩ 𝒫 (𝑋𝑆))(𝑋𝑥))
6652, 53, 653eqtr4d 2654 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))))
67 difssd 3700 . . . 4 (𝑆𝑋 → (𝑋𝑆) ⊆ 𝑋)
682ntrval 20650 . . . 4 ((𝐽 ∈ Top ∧ (𝑋𝑆) ⊆ 𝑋) → ((int‘𝐽)‘(𝑋𝑆)) = (𝐽 ∩ 𝒫 (𝑋𝑆)))
6967, 68sylan2 490 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘(𝑋𝑆)) = (𝐽 ∩ 𝒫 (𝑋𝑆)))
7069difeq2d 3690 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝑋 ∖ ((int‘𝐽)‘(𝑋𝑆))) = (𝑋 (𝐽 ∩ 𝒫 (𝑋𝑆))))
7166, 70eqtr4d 2647 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((cls‘𝐽)‘𝑆) = (𝑋 ∖ ((int‘𝐽)‘(𝑋𝑆))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  {cab 2596  wne 2780  wral 2896  wrex 2897  {crab 2900  Vcvv 3173  cdif 3537  cin 3539  wss 3540  c0 3874  𝒫 cpw 4108   cuni 4372   cint 4410   ciun 4455   ciin 4456  cfv 5804  Topctop 20517  Clsdccld 20630  intcnt 20631  clsccl 20632
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-iin 4458  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-top 20521  df-cld 20633  df-ntr 20634  df-cls 20635
This theorem is referenced by:  ntrval2  20665  clsdif  20667  cmclsopn  20676  bcth3  22936
  Copyright terms: Public domain W3C validator