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

Theorem ntrin 14877
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 3426 . . . . 5 (𝐴𝐵) ⊆ 𝐴
2 clscld.1 . . . . . 6 𝑋 = 𝐽
32ntrss 14872 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋 ∧ (𝐴𝐵) ⊆ 𝐴) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
41, 3mp3an3 1362 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
543adant3 1043 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐴))
6 inss2 3427 . . . . 5 (𝐴𝐵) ⊆ 𝐵
72ntrss 14872 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋 ∧ (𝐴𝐵) ⊆ 𝐵) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
86, 7mp3an3 1362 . . . 4 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
983adant2 1042 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ ((int‘𝐽)‘𝐵))
105, 9ssind 3430 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) ⊆ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
11 simp1 1023 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → 𝐽 ∈ Top)
12 ssinss1 3435 . . . 4 (𝐴𝑋 → (𝐴𝐵) ⊆ 𝑋)
13123ad2ant2 1045 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (𝐴𝐵) ⊆ 𝑋)
142ntropn 14870 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
15143adant3 1043 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ∈ 𝐽)
162ntropn 14870 . . . . 5 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
17163adant2 1042 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ∈ 𝐽)
18 inopn 14756 . . . 4 ((𝐽 ∈ Top ∧ ((int‘𝐽)‘𝐴) ∈ 𝐽 ∧ ((int‘𝐽)‘𝐵) ∈ 𝐽) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
1911, 15, 17, 18syl3anc 1273 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽)
20 inss1 3426 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐴)
212ntrss2 14874 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐴𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
22213adant3 1043 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐴) ⊆ 𝐴)
2320, 22sstrid 3237 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐴)
24 inss2 3427 . . . . 5 (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘𝐵)
252ntrss2 14874 . . . . . 6 ((𝐽 ∈ Top ∧ 𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
26253adant2 1042 . . . . 5 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘𝐵) ⊆ 𝐵)
2724, 26sstrid 3237 . . . 4 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ 𝐵)
2823, 27ssind 3430 . . 3 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))
292ssntr 14875 . . 3 (((𝐽 ∈ Top ∧ (𝐴𝐵) ⊆ 𝑋) ∧ ((((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ∈ 𝐽 ∧ (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ (𝐴𝐵))) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3011, 13, 19, 28, 29syl22anc 1274 . 2 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)) ⊆ ((int‘𝐽)‘(𝐴𝐵)))
3110, 30eqssd 3243 1 ((𝐽 ∈ Top ∧ 𝐴𝑋𝐵𝑋) → ((int‘𝐽)‘(𝐴𝐵)) = (((int‘𝐽)‘𝐴) ∩ ((int‘𝐽)‘𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  w3a 1004   = wceq 1397  wcel 2201  cin 3198  wss 3199   cuni 3894  cfv 5328  Topctop 14750  intcnt 14846
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-pow 4266  ax-pr 4301  ax-un 4532
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-un 3203  df-in 3205  df-ss 3212  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-id 4392  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-top 14751  df-ntr 14849
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator