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

Theorem ntrin 14989
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 3441 . . . . 5  |-  ( A  i^i  B )  C_  A
2 clscld.1 . . . . . 6  |-  X  = 
U. J
32ntrss 14984 . . . . 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 1363 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  A )
)
543adant3 1044 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  A )
)
6 inss2 3442 . . . . 5  |-  ( A  i^i  B )  C_  B
72ntrss 14984 . . . . 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 1363 . . . 4  |-  ( ( J  e.  Top  /\  B  C_  X )  -> 
( ( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  B )
)
983adant2 1043 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  ( A  i^i  B ) )  C_  ( ( int `  J
) `  B )
)
105, 9ssind 3445 . 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 1024 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  J  e.  Top )
12 ssinss1 3450 . . . 4  |-  ( A 
C_  X  ->  ( A  i^i  B )  C_  X )
13123ad2ant2 1046 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  ( A  i^i  B )  C_  X )
142ntropn 14982 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( int `  J
) `  A )  e.  J )
15143adant3 1044 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  A )  e.  J )
162ntropn 14982 . . . . 5  |-  ( ( J  e.  Top  /\  B  C_  X )  -> 
( ( int `  J
) `  B )  e.  J )
17163adant2 1043 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  B )  e.  J )
18 inopn 14868 . . . 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 1274 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  e.  J )
20 inss1 3441 . . . . 5  |-  ( ( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  ( ( int `  J ) `  A )
212ntrss2 14986 . . . . . 6  |-  ( ( J  e.  Top  /\  A  C_  X )  -> 
( ( int `  J
) `  A )  C_  A )
22213adant3 1044 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  A )  C_  A )
2320, 22sstrid 3249 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  A )
24 inss2 3442 . . . . 5  |-  ( ( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  ( ( int `  J ) `  B )
252ntrss2 14986 . . . . . 6  |-  ( ( J  e.  Top  /\  B  C_  X )  -> 
( ( int `  J
) `  B )  C_  B )
26253adant2 1043 . . . . 5  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( int `  J
) `  B )  C_  B )
2724, 26sstrid 3249 . . . 4  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  B )
2823, 27ssind 3445 . . 3  |-  ( ( J  e.  Top  /\  A  C_  X  /\  B  C_  X )  ->  (
( ( int `  J
) `  A )  i^i  ( ( int `  J
) `  B )
)  C_  ( A  i^i  B ) )
292ssntr 14987 . . 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 1275 . 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 3255 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 1005    = wceq 1398    e. wcel 2203    i^i cin 3210    C_ wss 3211   U.cuni 3914   ` cfv 5352   Topctop 14862   intcnt 14958
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-top 14863  df-ntr 14961
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator