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

Theorem ntrval 15213
Description: The interior of a subset of a topology's base set is the union of all the open sets it includes. Definition of interior of [Munkres] p. 94. (Contributed by NM, 10-Sep-2006.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
iscld.1 𝑋 = 𝐽
Assertion
Ref Expression
ntrval ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) = (𝐽 ∩ 𝒫 𝑆))

Proof of Theorem ntrval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 iscld.1 . . . . 5 𝑋 = 𝐽
21ntrfval 15203 . . . 4 (𝐽 ∈ Top → (int‘𝐽) = (𝑥 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑥)))
32fveq1d 5697 . . 3 (𝐽 ∈ Top → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑥))‘𝑆))
43adantr 276 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) = ((𝑥 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑥))‘𝑆))
5 eqid 2238 . . 3 (𝑥 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑥)) = (𝑥 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑥))
6 pweq 3691 . . . . 5 (𝑥 = 𝑆 → 𝒫 𝑥 = 𝒫 𝑆)
76ineq2d 3432 . . . 4 (𝑥 = 𝑆 → (𝐽 ∩ 𝒫 𝑥) = (𝐽 ∩ 𝒫 𝑆))
87unieqd 3946 . . 3 (𝑥 = 𝑆 (𝐽 ∩ 𝒫 𝑥) = (𝐽 ∩ 𝒫 𝑆))
91topopn 15111 . . . . 5 (𝐽 ∈ Top → 𝑋𝐽)
10 elpw2g 4292 . . . . 5 (𝑋𝐽 → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
119, 10syl 14 . . . 4 (𝐽 ∈ Top → (𝑆 ∈ 𝒫 𝑋𝑆𝑋))
1211biimpar 297 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → 𝑆 ∈ 𝒫 𝑋)
13 inex1g 4269 . . . . 5 (𝐽 ∈ Top → (𝐽 ∩ 𝒫 𝑆) ∈ V)
1413adantr 276 . . . 4 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐽 ∩ 𝒫 𝑆) ∈ V)
15 uniexg 4585 . . . 4 ((𝐽 ∩ 𝒫 𝑆) ∈ V → (𝐽 ∩ 𝒫 𝑆) ∈ V)
1614, 15syl 14 . . 3 ((𝐽 ∈ Top ∧ 𝑆𝑋) → (𝐽 ∩ 𝒫 𝑆) ∈ V)
175, 8, 12, 16fvmptd3 5799 . 2 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((𝑥 ∈ 𝒫 𝑋 (𝐽 ∩ 𝒫 𝑥))‘𝑆) = (𝐽 ∩ 𝒫 𝑆))
184, 17eqtrd 2271 1 ((𝐽 ∈ Top ∧ 𝑆𝑋) → ((int‘𝐽)‘𝑆) = (𝐽 ∩ 𝒫 𝑆))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  Vcvv 2821  cin 3219  wss 3220  𝒫 cpw 3688   cuni 3935  cmpt 4192  cfv 5377  Topctop 15100  intcnt 15196
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-top 15101  df-ntr 15199
This theorem is used by:  ntropn  15220  ntrss  15222  ntrss2  15224  ssntr  15225  isopn3  15228  ntreq0  15235
  Copyright terms: Public domain W3C validator