Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  neiin Structured version   Visualization version   GIF version

Theorem neiin 36334
Description: Two neighborhoods intersect to form a neighborhood of the intersection. (Contributed by Jeff Hankins, 31-Aug-2009.)
Assertion
Ref Expression
neiin ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑀𝑁) ∈ ((nei‘𝐽)‘(𝐴𝐵)))

Proof of Theorem neiin
StepHypRef Expression
1 simpr 484 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 ∈ ((nei‘𝐽)‘𝐴))
2 simpl 482 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐽 ∈ Top)
3 eqid 2736 . . . . . . . . 9 𝐽 = 𝐽
43neiss2 23110 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 𝐽)
53neii1 23115 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 𝐽)
63neiint 23113 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝐴 𝐽𝑀 𝐽) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
72, 4, 5, 6syl3anc 1372 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
81, 7mpbid 232 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝑀))
9 ssinss1 4245 . . . . . 6 (𝐴 ⊆ ((int‘𝐽)‘𝑀) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑀))
108, 9syl 17 . . . . 5 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑀))
11103adant3 1132 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑀))
12 inss2 4237 . . . . 5 (𝐴𝐵) ⊆ 𝐵
13 simpr 484 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ∈ ((nei‘𝐽)‘𝐵))
14 simpl 482 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
153neiss2 23110 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 𝐽)
163neii1 23115 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 𝐽)
173neiint 23113 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝐵 𝐽𝑁 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
1814, 15, 16, 17syl3anc 1372 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
1913, 18mpbid 232 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
20193adant2 1131 . . . . 5 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
2112, 20sstrid 3994 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑁))
2211, 21ssind 4240 . . 3 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
23 simp1 1136 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
2453adant3 1132 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑀 𝐽)
25163adant2 1131 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 𝐽)
263ntrin 23070 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 𝐽𝑁 𝐽) → ((int‘𝐽)‘(𝑀𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
2723, 24, 25, 26syl3anc 1372 . . 3 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((int‘𝐽)‘(𝑀𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
2822, 27sseqtrrd 4020 . 2 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘(𝑀𝑁)))
29 ssinss1 4245 . . . . 5 (𝐴 𝐽 → (𝐴𝐵) ⊆ 𝐽)
304, 29syl 17 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴𝐵) ⊆ 𝐽)
31 ssinss1 4245 . . . . 5 (𝑀 𝐽 → (𝑀𝑁) ⊆ 𝐽)
325, 31syl 17 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀𝑁) ⊆ 𝐽)
333neiint 23113 . . . 4 ((𝐽 ∈ Top ∧ (𝐴𝐵) ⊆ 𝐽 ∧ (𝑀𝑁) ⊆ 𝐽) → ((𝑀𝑁) ∈ ((nei‘𝐽)‘(𝐴𝐵)) ↔ (𝐴𝐵) ⊆ ((int‘𝐽)‘(𝑀𝑁))))
342, 30, 32, 33syl3anc 1372 . . 3 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → ((𝑀𝑁) ∈ ((nei‘𝐽)‘(𝐴𝐵)) ↔ (𝐴𝐵) ⊆ ((int‘𝐽)‘(𝑀𝑁))))
35343adant3 1132 . 2 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((𝑀𝑁) ∈ ((nei‘𝐽)‘(𝐴𝐵)) ↔ (𝐴𝐵) ⊆ ((int‘𝐽)‘(𝑀𝑁))))
3628, 35mpbird 257 1 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑀𝑁) ∈ ((nei‘𝐽)‘(𝐴𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1539  wcel 2107  cin 3949  wss 3950   cuni 4906  cfv 6560  Topctop 22900  intcnt 23026  neicnei 23106
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-iin 4993  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-top 22901  df-cld 23028  df-ntr 23029  df-cls 23030  df-nei 23107
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator