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

Theorem ntrin 12332
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
StepHypRef Expression
1 inss1 3301 . . . . 5  |-  ( A  i^i  B )  C_  A
2 clscld.1 . . . . . 6  |-  X  = 
U. J
32ntrss 12327 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X  /\  ( A  i^i  B )  C_  A )  ->  (
( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  A )
)
41, 3mp3an3 1305 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  A )
)
543adant3 1002 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  A )
)
6 inss2 3302 . . . . 5  |-  ( A  i^i  B )  C_  B
72ntrss 12327 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  X  /\  ( A  i^i  B )  C_  B )  ->  (
( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  B )
)
86, 7mp3an3 1305 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  X )  -> 
( ( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  B )
)
983adant2 1001 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  B )
)
105, 9ssind 3305 . 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 982 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  J  e.  Top )
12 ssinss1 3310 . . . 4  |-  ( A 
C_  X  ->  ( A  i^i  B )  C_  X )
13123ad2ant2 1004 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  ( A  i^i  B )  C_  X )
142ntropn 12325 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( int `  J
) `  A )  e.  J )
15143adant3 1002 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  A )  e.  J )
162ntropn 12325 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  X )  -> 
( ( int `  J
) `  B )  e.  J )
17163adant2 1001 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  B )  e.  J )
18 inopn 12209 . . . 4  |-  ( ( J  e.  Top  /\  ( ( int `  J
) `  A )  e.  J  /\  (
( int `  J
) `  B )  e.  J )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  e.  J )
1911, 15, 17, 18syl3anc 1217 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  e.  J )
20 inss1 3301 . . . . 5  |-  ( ( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  ( ( int `  J ) `  A )
212ntrss2 12329 . . . . . 6  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( int `  J
) `  A )  C_  A )
22213adant3 1002 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  A )  C_  A )
2320, 22sstrid 3113 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  A )
24 inss2 3302 . . . . 5  |-  ( ( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  ( ( int `  J ) `  B )
252ntrss2 12329 . . . . . 6  |-  ( ( J  e.  Top  /\  B  C_  X )  -> 
( ( int `  J
) `  B )  C_  B )
26253adant2 1001 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  B )  C_  B )
2724, 26sstrid 3113 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  B )
2823, 27ssind 3305 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  ( A  i^i  B ) )
292ssntr 12330 . . 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 ) ) )
3011, 13, 19, 28, 29syl22anc 1218 . 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 ) ) )
3110, 30eqssd 3119 1  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  ( A  i^i  B ) )  =  ( ( ( int `  J ) `  A
)  i^i  ( ( int `  J ) `  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 963    = wceq 1332    e. wcel 1481    i^i cin 3075    C_ wss 3076   U.cuni 3744   ` cfv 5131   Topctop 12203   intcnt 12301
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-top 12204  df-ntr 12304
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator