Theorem neiin 36315

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

Step	Hyp	Ref	Expression
1		simpr 484	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 ∈ ((nei‘𝐽)‘𝐴))
2		simpl 482	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐽 ∈ Top)
3		eqid 2735	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ 𝐽
4	3	neiss2 23125	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ∪ 𝐽)
5	3	neii1 23130	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 ⊆ ∪ 𝐽)
6	3	neiint 23128	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ ∪ 𝐽 ∧ 𝑀 ⊆ ∪ 𝐽) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
7	2, 4, 5, 6	syl3anc 1370	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
8	1, 7	mpbid 232	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝑀))
9		ssinss1 4254	. . . . . 6 ⊢ (𝐴 ⊆ ((int‘𝐽)‘𝑀) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
10	8, 9	syl 17	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
11	10	3adant3 1131	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
12		inss2 4246	. . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
13		simpr 484	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ∈ ((nei‘𝐽)‘𝐵))
14		simpl 482	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
15	3	neiss2 23125	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ∪ 𝐽)
16	3	neii1 23130	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ⊆ ∪ 𝐽)
17	3	neiint 23128	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
18	14, 15, 16, 17	syl3anc 1370	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
19	13, 18	mpbid 232	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
20	19	3adant2 1130	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
21	12, 20	sstrid 4007	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑁))
22	11, 21	ssind 4249	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
23		simp1 1135	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
24	5	3adant3 1131	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑀 ⊆ ∪ 𝐽)
25	16	3adant2 1130	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ⊆ ∪ 𝐽)
26	3	ntrin 23085	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → ((int‘𝐽)‘(𝑀 ∩ 𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
27	23, 24, 25, 26	syl3anc 1370	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((int‘𝐽)‘(𝑀 ∩ 𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
28	22, 27	sseqtrrd 4037	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁)))
29		ssinss1 4254	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝐽 → (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽)
30	4, 29	syl 17	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽)
31		ssinss1 4254	. . . . 5 ⊢ (𝑀 ⊆ ∪ 𝐽 → (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽)
32	5, 31	syl 17	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽)
33	3	neiint 23128	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽 ∧ (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
34	2, 30, 32, 33	syl3anc 1370	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
35	34	3adant3 1131	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
36	28, 35	mpbird 257	1 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106   ∩ cin 3962   ⊆ wss 3963  ∪ cuni 4912  ‘cfv 6563  Topctop 22915  intcnt 23041  neicnei 23121

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-iin 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-top 22916  df-cld 23043  df-ntr 23044  df-cls 23045  df-nei 23122

This theorem is referenced by: (None)