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

Theorem ntrin 12075
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 3243 . . . . 5 (𝐴𝐵) ⊆ 𝐴
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32ntrss 12070 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋 ∧ (𝐴𝐵) ⊆ 𝐴) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
41, 3mp3an3 1272 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
543adant3 969 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
6 inss2 3244 . . . . 5 (𝐴𝐵) ⊆ 𝐵
72ntrss 12070 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋 ∧ (𝐴𝐵) ⊆ 𝐵) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
86, 7mp3an3 1272 . . . 4 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
983adant2 968 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
105, 9ssind 3247 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
11 simp1 949 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → 𝐽 ∈ Top)
12 ssinss1 3252 . . . 4 (𝐴𝑋 → (𝐴𝐵) ⊆ 𝑋)
13123ad2ant2 971 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐵) ⊆ 𝑋)
142ntropn 12068 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
15143adant3 969 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
162ntropn 12068 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
17163adant2 968 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
18 inopn 11952 . . . 4 ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ ((int‘𝐽)‘𝐵) ∈ 𝐽) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
1911, 15, 17, 18syl3anc 1184 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
20 inss1 3243 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐴)
212ntrss2 12072 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
22213adant3 969 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
2320, 22syl5ss 3058 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐴)
24 inss2 3244 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐵)
252ntrss2 12072 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
26253adant2 968 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
2724, 26syl5ss 3058 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐵)
2823, 27ssind 3247 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))
292ssntr 12073 . . 3 (((𝐽 ∈ Top ∧ (𝐴𝐵) ⊆ 𝑋) ∧ ((((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽 ∧ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3011, 13, 19, 28, 29syl22anc 1185 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3110, 30eqssd 3064 1 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) = (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 930   = wceq 1299  wcel 1448  cin 3020  wss 3021   cuni 3683  cfv 5059  Topctop 11946  intcnt 12044
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-13 1459  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-coll 3983  ax-sep 3986  ax-pow 4038  ax-pr 4069  ax-un 4293
This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-reu 2382  df-rab 2384  df-v 2643  df-sbc 2863  df-csb 2956  df-un 3025  df-in 3027  df-ss 3034  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-iun 3762  df-br 3876  df-opab 3930  df-mpt 3931  df-id 4153  df-xp 4483  df-rel 4484  df-cnv 4485  df-co 4486  df-dm 4487  df-rn 4488  df-res 4489  df-ima 4490  df-iota 5024  df-fun 5061  df-fn 5062  df-f 5063  df-f1 5064  df-fo 5065  df-f1o 5066  df-fv 5067  df-top 11947  df-ntr 12047
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator