Theorem neiin 37212

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 490	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 ∈ ((nei‘𝐽)‘𝐴))
2		simpl 488	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐽 ∈ Top)
3		eqid 2760	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ 𝐽
4	3	neiss2 23424	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ∪ 𝐽)
5	3	neii1 23429	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 ⊆ ∪ 𝐽)
6	3	neiint 23427	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ ∪ 𝐽 ∧ 𝑀 ⊆ ∪ 𝐽) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
7	2, 4, 5, 6	syl3anc 1398	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
8	1, 7	mpbid 235	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝑀))
9		ssinss1 4142	. . . . . 6 ⊢ (𝐴 ⊆ ((int‘𝐽)‘𝑀) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
10	8, 9	syl 18	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
11	10	3adant3 1150	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
12		inss2 4134	. . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
13		simpr 490	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ∈ ((nei‘𝐽)‘𝐵))
14		simpl 488	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
15	3	neiss2 23424	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ∪ 𝐽)
16	3	neii1 23429	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ⊆ ∪ 𝐽)
17	3	neiint 23427	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
18	14, 15, 16, 17	syl3anc 1398	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
19	13, 18	mpbid 235	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
20	19	3adant2 1149	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ((int‘𝐽)‘𝑁))
21	12, 20	sstrid 3919	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑁))
22	11, 21	ssind 4137	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
23		simp1 1154	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
24	5	3adant3 1150	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑀 ⊆ ∪ 𝐽)
25	16	3adant2 1149	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ⊆ ∪ 𝐽)
26	3	ntrin 23384	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → ((int‘𝐽)‘(𝑀 ∩ 𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
27	23, 24, 25, 26	syl3anc 1398	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((int‘𝐽)‘(𝑀 ∩ 𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
28	22, 27	sseqtrrd 3945	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁)))
29		ssinss1 4142	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝐽 → (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽)
30	4, 29	syl 18	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽)
31		ssinss1 4142	. . . . 5 ⊢ (𝑀 ⊆ ∪ 𝐽 → (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽)
32	5, 31	syl 18	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽)
33	3	neiint 23427	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽 ∧ (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
34	2, 30, 32, 33	syl3anc 1398	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
35	34	3adant3 1150	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
36	28, 35	mpbird 260	1 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895   ∩ cin 4089  ∪ cuni 4866  ‘cfv 6538  Topctop 23216  intcnt 23340  neicnei 23420

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-top 23217  df-cld 23342  df-ntr 23343  df-cls 23344  df-nei 23421

This theorem is used by: (None)