Theorem ntrin 15225

Description: A pairwise intersection of interiors is the interior of the intersection. This does not always hold for arbitrary intersections. (Contributed by Jeff Hankins, 31-Aug-2009.)

Hypothesis

Ref	Expression
clscld.1	|- X = U. J

Assertion

Ref	Expression
ntrin	|- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) = ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) )

Proof of Theorem ntrin

Step	Hyp	Ref	Expression
1		inss1 3451	. . . . 5 |- ( A i^i B ) C_ A
2		clscld.1	. . . . . 6 |- X = U. J
3	2	ntrss 15220	. . . . 5 |- ( ( J e. Top /\ A C_ X /\ ( A i^i B ) C_ A ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( int ` J ) ` A ) )
4	1, 3	mp3an3 1367	. . . 4 |- ( ( J e. Top /\ A C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( int ` J ) ` A ) )
5	4	3adant3 1048	. . 3 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( int ` J ) ` A ) )
6		inss2 3452	. . . . 5 |- ( A i^i B ) C_ B
7	2	ntrss 15220	. . . . 5 |- ( ( J e. Top /\ B C_ X /\ ( A i^i B ) C_ B ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( int ` J ) ` B ) )
8	6, 7	mp3an3 1367	. . . 4 |- ( ( J e. Top /\ B C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( int ` J ) ` B ) )
9	8	3adant2 1047	. . 3 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( int ` J ) ` B ) )
10	5, 9	ssind 3455	. 2 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) C_ ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) )
11		simp1 1028	. . 3 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> J e. Top )
12		ssinss1 3460	. . . 4 |- ( A C_ X -> ( A i^i B ) C_ X )
13	12	3ad2ant2 1050	. . 3 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( A i^i B ) C_ X )
14	2	ntropn 15218	. . . . 5 |- ( ( J e. Top /\ A C_ X ) -> ( ( int ` J ) ` A ) e. J )
15	14	3adant3 1048	. . . 4 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` A ) e. J )
16	2	ntropn 15218	. . . . 5 |- ( ( J e. Top /\ B C_ X ) -> ( ( int ` J ) ` B ) e. J )
17	16	3adant2 1047	. . . 4 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` B ) e. J )
18		inopn 15104	. . . 4 |- ( ( J e. Top /\ ( ( int ` J ) ` A ) e. J /\ ( ( int ` J ) ` B ) e. J ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) e. J )
19	11, 15, 17, 18	syl3anc 1278	. . 3 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) e. J )
20		inss1 3451	. . . . 5 |- ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ ( ( int ` J ) ` A )
21	2	ntrss2 15222	. . . . . 6 |- ( ( J e. Top /\ A C_ X ) -> ( ( int ` J ) ` A ) C_ A )
22	21	3adant3 1048	. . . . 5 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` A ) C_ A )
23	20, 22	sstrid 3259	. . . 4 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ A )
24		inss2 3452	. . . . 5 |- ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ ( ( int ` J ) ` B )
25	2	ntrss2 15222	. . . . . 6 |- ( ( J e. Top /\ B C_ X ) -> ( ( int ` J ) ` B ) C_ B )
26	25	3adant2 1047	. . . . 5 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` B ) C_ B )
27	24, 26	sstrid 3259	. . . 4 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ B )
28	23, 27	ssind 3455	. . 3 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ ( A i^i B ) )
29	2	ssntr 15223	. . 3 |- ( ( ( J e. Top /\ ( A i^i B ) C_ X ) /\ ( ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) e. J /\ ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ ( A i^i B ) ) ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ ( ( int ` J ) ` ( A i^i B ) ) )
30	11, 13, 19, 28, 29	syl22anc 1279	. 2 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) C_ ( ( int ` J ) ` ( A i^i B ) ) )
31	10, 30	eqssd 3265	1 |- ( ( J e. Top /\ A C_ X /\ B C_ X ) -> ( ( int ` J ) ` ( A i^i B ) ) = ( ( ( int ` J ) ` A ) i^i ( ( int ` J ) ` B ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ w3a 1009   = wceq 1402   e. wcel 2209   i^i cin 3219   C_ wss 3220   U.cuni 3935   ` cfv 5377   Topctop 15098   intcnt 15194

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 15099  df-ntr 15197

This theorem is used by: (None)