Theorem neiin 37298

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 2763	. . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ 𝐽
4	3	neiss2 23449	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ∪ 𝐽)
5	3	neii1 23454	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝑀 ⊆ ∪ 𝐽)
6	3	neiint 23452	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ⊆ ∪ 𝐽 ∧ 𝑀 ⊆ ∪ 𝐽) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
7	2, 4, 5, 6	syl3anc 1399	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∈ ((nei‘𝐽)‘𝐴) ↔ 𝐴 ⊆ ((int‘𝐽)‘𝑀)))
8	1, 7	mpbid 235	. . . . . 6 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → 𝐴 ⊆ ((int‘𝐽)‘𝑀))
9		ssinss1 4145	. . . . . 6 ⊢ (𝐴 ⊆ ((int‘𝐽)‘𝑀) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
10	8, 9	syl 18	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
11	10	3adant3 1150	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑀))
12		inss2 4137	. . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
13		simpr 490	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ∈ ((nei‘𝐽)‘𝐵))
14		simpl 488	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐽 ∈ Top)
15	3	neiss2 23449	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝐵 ⊆ ∪ 𝐽)
16	3	neii1 23454	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → 𝑁 ⊆ ∪ 𝐽)
17	3	neiint 23452	. . . . . . . 8 ⊢ ((𝐽 ∈ Top ∧ 𝐵 ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘𝐵) ↔ 𝐵 ⊆ ((int‘𝐽)‘𝑁)))
18	14, 15, 16, 17	syl3anc 1399	. . . . . . 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 3924	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘𝑁))
22	11, 21	ssind 4140	. . 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 23409	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ⊆ ∪ 𝐽 ∧ 𝑁 ⊆ ∪ 𝐽) → ((int‘𝐽)‘(𝑀 ∩ 𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
27	23, 24, 25, 26	syl3anc 1399	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → ((int‘𝐽)‘(𝑀 ∩ 𝑁)) = (((int‘𝐽)‘𝑀) ∩ ((int‘𝐽)‘𝑁)))
28	22, 27	sseqtrrd 3950	. 2 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴) ∧ 𝑁 ∈ ((nei‘𝐽)‘𝐵)) → (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁)))
29		ssinss1 4145	. . . . 5 ⊢ (𝐴 ⊆ ∪ 𝐽 → (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽)
30	4, 29	syl 18	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽)
31		ssinss1 4145	. . . . 5 ⊢ (𝑀 ⊆ ∪ 𝐽 → (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽)
32	5, 31	syl 18	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝐴)) → (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽)
33	3	neiint 23452	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝐴 ∩ 𝐵) ⊆ ∪ 𝐽 ∧ (𝑀 ∩ 𝑁) ⊆ ∪ 𝐽) → ((𝑀 ∩ 𝑁) ∈ ((nei‘𝐽)‘(𝐴 ∩ 𝐵)) ↔ (𝐴 ∩ 𝐵) ⊆ ((int‘𝐽)‘(𝑀 ∩ 𝑁))))
34	2, 30, 32, 33	syl3anc 1399	. . 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 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092  ∪ cuni 4870  ‘cfv 6558  Topctop 23241  intcnt 23365  neicnei 23445

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-top 23242  df-cld 23367  df-ntr 23368  df-cls 23369  df-nei 23446

This theorem is used by: (None)