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

Theorem ntrin 14806
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 𝑋 = 𝐽
Assertion
Ref Expression
ntrin ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) = (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))

Proof of Theorem ntrin
StepHypRef Expression
1 inss1 3424 . . . . 5 (𝐴𝐵) ⊆ 𝐴
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32ntrss 14801 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋 ∧ (𝐴𝐵) ⊆ 𝐴) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
41, 3mp3an3 1360 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
543adant3 1041 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
6 inss2 3425 . . . . 5 (𝐴𝐵) ⊆ 𝐵
72ntrss 14801 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋 ∧ (𝐴𝐵) ⊆ 𝐵) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
86, 7mp3an3 1360 . . . 4 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
983adant2 1040 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
105, 9ssind 3428 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
11 simp1 1021 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → 𝐽 ∈ Top)
12 ssinss1 3433 . . . 4 (𝐴𝑋 → (𝐴𝐵) ⊆ 𝑋)
13123ad2ant2 1043 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐵) ⊆ 𝑋)
142ntropn 14799 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
15143adant3 1041 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
162ntropn 14799 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
17163adant2 1040 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
18 inopn 14685 . . . 4 ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ ((int‘𝐽)‘𝐵) ∈ 𝐽) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
1911, 15, 17, 18syl3anc 1271 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
20 inss1 3424 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐴)
212ntrss2 14803 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
22213adant3 1041 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
2320, 22sstrid 3235 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐴)
24 inss2 3425 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐵)
252ntrss2 14803 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
26253adant2 1040 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
2724, 26sstrid 3235 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐵)
2823, 27ssind 3428 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))
292ssntr 14804 . . 3 (((𝐽 ∈ Top ∧ (𝐴𝐵) ⊆ 𝑋) ∧ ((((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽 ∧ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3011, 13, 19, 28, 29syl22anc 1272 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3110, 30eqssd 3241 1 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) = (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1002   = wceq 1395  wcel 2200  cin 3196  wss 3197   cuni 3888  cfv 5318  Topctop 14679  intcnt 14775
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-top 14680  df-ntr 14778
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator