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

Theorem ntrin 14976
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 3440 . . . . 5 (𝐴𝐵) ⊆ 𝐴
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32ntrss 14971 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋 ∧ (𝐴𝐵) ⊆ 𝐴) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
41, 3mp3an3 1363 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
543adant3 1044 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
6 inss2 3441 . . . . 5 (𝐴𝐵) ⊆ 𝐵
72ntrss 14971 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋 ∧ (𝐴𝐵) ⊆ 𝐵) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
86, 7mp3an3 1363 . . . 4 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
983adant2 1043 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
105, 9ssind 3444 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
11 simp1 1024 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → 𝐽 ∈ Top)
12 ssinss1 3449 . . . 4 (𝐴𝑋 → (𝐴𝐵) ⊆ 𝑋)
13123ad2ant2 1046 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐵) ⊆ 𝑋)
142ntropn 14969 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
15143adant3 1044 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
162ntropn 14969 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
17163adant2 1043 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
18 inopn 14855 . . . 4 ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ ((int‘𝐽)‘𝐵) ∈ 𝐽) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
1911, 15, 17, 18syl3anc 1274 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
20 inss1 3440 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐴)
212ntrss2 14973 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
22213adant3 1044 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
2320, 22sstrid 3248 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐴)
24 inss2 3441 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐵)
252ntrss2 14973 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
26253adant2 1043 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
2724, 26sstrid 3248 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐵)
2823, 27ssind 3444 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))
292ssntr 14974 . . 3 (((𝐽 ∈ Top ∧ (𝐴𝐵) ⊆ 𝑋) ∧ ((((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽 ∧ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3011, 13, 19, 28, 29syl22anc 1275 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3110, 30eqssd 3254 1 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) = (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1005   = wceq 1398  wcel 2203  cin 3209  wss 3210   cuni 3913  cfv 5351  Topctop 14849  intcnt 14945
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 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553
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 2814  df-sbc 3042  df-csb 3138  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-top 14850  df-ntr 14948
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator