Theorem ntrval 20840

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	|- X = U. J

Assertion

Ref	Expression
ntrval	|- ( ( J e. Top /\ S C_ X ) -> ( ( int ` J ) ` S ) = U. ( J i^i ~P S ) )

Proof of Theorem ntrval

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iscld.1	. . . . 5 |- X = U. J
2	1	ntrfval 20828	. . . 4 |- ( J e. Top -> ( int ` J ) = ( x e. ~P X |-> U. ( J i^i ~P x ) ) )
3	2	fveq1d 6193	. . 3 |- ( J e. Top -> ( ( int ` J ) ` S ) = ( ( x e. ~P X |-> U. ( J i^i ~P x ) ) ` S ) )
4	3	adantr 481	. 2 |- ( ( J e. Top /\ S C_ X ) -> ( ( int ` J ) ` S ) = ( ( x e. ~P X |-> U. ( J i^i ~P x ) ) ` S ) )
5	1	topopn 20711	. . . . 5 |- ( J e. Top -> X e. J )
6		elpw2g 4827	. . . . 5 |- ( X e. J -> ( S e. ~P X <-> S C_ X ) )
7	5, 6	syl 17	. . . 4 |- ( J e. Top -> ( S e. ~P X <-> S C_ X ) )
8	7	biimpar 502	. . 3 |- ( ( J e. Top /\ S C_ X ) -> S e. ~P X )
9		inex1g 4801	. . . . 5 |- ( J e. Top -> ( J i^i ~P S ) e. _V )
10	9	adantr 481	. . . 4 |- ( ( J e. Top /\ S C_ X ) -> ( J i^i ~P S ) e. _V )
11		uniexg 6955	. . . 4 |- ( ( J i^i ~P S ) e. _V -> U. ( J i^i ~P S ) e. _V )
12	10, 11	syl 17	. . 3 |- ( ( J e. Top /\ S C_ X ) -> U. ( J i^i ~P S ) e. _V )
13		pweq 4161	. . . . . 6 |- ( x = S -> ~P x = ~P S )
14	13	ineq2d 3814	. . . . 5 |- ( x = S -> ( J i^i ~P x ) = ( J i^i ~P S ) )
15	14	unieqd 4446	. . . 4 |- ( x = S -> U. ( J i^i ~P x ) = U. ( J i^i ~P S ) )
16		eqid 2622	. . . 4 |- ( x e. ~P X |-> U. ( J i^i ~P x ) ) = ( x e. ~P X |-> U. ( J i^i ~P x ) )
17	15, 16	fvmptg 6280	. . 3 |- ( ( S e. ~P X /\ U. ( J i^i ~P S ) e. _V ) -> ( ( x e. ~P X |-> U. ( J i^i ~P x ) ) ` S ) = U. ( J i^i ~P S ) )
18	8, 12, 17	syl2anc 693	. 2 |- ( ( J e. Top /\ S C_ X ) -> ( ( x e. ~P X |-> U. ( J i^i ~P x ) ) ` S ) = U. ( J i^i ~P S ) )
19	4, 18	eqtrd 2656	1 |- ( ( J e. Top /\ S C_ X ) -> ( ( int ` J ) ` S ) = U. ( J i^i ~P S ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   _Vcvv 3200   i^i cin 3573   C_ wss 3574   ~Pcpw 4158   U.cuni 4436   |-> cmpt 4729   ` cfv 5888   Topctop 20698   intcnt 20821

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-top 20699  df-ntr 20824

This theorem is referenced by:  ntropn  20853  clsval2  20854  ntrss2  20861  ssntr  20862  isopn3  20870  ntreq0  20881