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 36365
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 2731 . . . . . . . . 9 𝐽 = 𝐽
43neiss2 23014 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 𝐽)
53neii1 23019 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 𝐽)
63neiint 23017 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝐴 𝐽𝑀 𝐽) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
72, 4, 5, 6syl3anc 1373 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
81, 7mpbid 232 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝑀))
9 ssinss1 4196 . . . . . 6 (𝐴 ⊆ ((int‘𝐽)‘𝑀) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑀))
108, 9syl 17 . . . . 5 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑀))
11103adant3 1132 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑀))
12 inss2 4188 . . . . 5 (𝐴𝐵) ⊆ 𝐵
13 simpr 484 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ∈ ((nei‘𝐽)‘𝐵))
14 simpl 482 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
153neiss2 23014 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 𝐽)
163neii1 23019 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 𝐽)
173neiint 23017 . . . . . . . 8 ((𝐽 ∈ Top ∧ 𝐵 𝐽𝑁 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
1814, 15, 16, 17syl3anc 1373 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
1913, 18mpbid 232 . . . . . 6 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
20193adant2 1131 . . . . 5 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
2112, 20sstrid 3946 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘𝑁))
2211, 21ssind 4191 . . 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 22974 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 𝐽𝑁 𝐽) → ((int‘𝐽)‘(𝑀𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
2723, 24, 25, 26syl3anc 1373 . . 3 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((int‘𝐽)‘(𝑀𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
2822, 27sseqtrrd 3972 . 2 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴𝐵) ⊆ ((int‘𝐽)‘(𝑀𝑁)))
29 ssinss1 4196 . . . . 5 (𝐴 𝐽 → (𝐴𝐵) ⊆ 𝐽)
304, 29syl 17 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴𝐵) ⊆ 𝐽)
31 ssinss1 4196 . . . . 5 (𝑀 𝐽 → (𝑀𝑁) ⊆ 𝐽)
325, 31syl 17 . . . 4 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀𝑁) ⊆ 𝐽)
333neiint 23017 . . . 4 ((𝐽 ∈ Top ∧ (𝐴𝐵) ⊆ 𝐽 ∧ (𝑀𝑁) ⊆ 𝐽) → ((𝑀𝑁) ∈ ((nei‘𝐽)‘(𝐴𝐵)) ↔ (𝐴𝐵) ⊆ ((int‘𝐽)‘(𝑀𝑁))))
342, 30, 32, 33syl3anc 1373 . . 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 1541  wcel 2111  cin 3901  wss 3902   cuni 4859  cfv 6481  Topctop 22806  intcnt 22930  neicnei 23010
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-iin 4944  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-top 22807  df-cld 22932  df-ntr 22933  df-cls 22934  df-nei 23011
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator