MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  innei Structured version   Visualization version   GIF version

Theorem innei 22476
Description: The intersection of two neighborhoods of a set is also a neighborhood of the set. Generalization to subsets of Property Vii of [BourbakiTop1] p. I.3 for binary intersections. (Contributed by FL, 28-Sep-2006.)
Assertion
Ref Expression
innei ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆)) → (𝑁𝑀) ∈ ((nei‘𝐽)‘𝑆))

Proof of Theorem innei
Dummy variables 𝑔 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . . . 5 𝐽 = 𝐽
21neii1 22457 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑁 𝐽)
3 ssinss1 4197 . . . 4 (𝑁 𝐽 → (𝑁𝑀) ⊆ 𝐽)
42, 3syl 17 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → (𝑁𝑀) ⊆ 𝐽)
543adant3 1132 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆)) → (𝑁𝑀) ⊆ 𝐽)
6 neii2 22459 . . . . 5 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝐽 (𝑆𝑁))
7 neii2 22459 . . . . 5 ((𝐽 ∈ Top ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑣𝐽 (𝑆𝑣𝑣𝑀))
86, 7anim12dan 619 . . . 4 ((𝐽 ∈ Top ∧ (𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆))) → (∃𝐽 (𝑆𝑁) ∧ ∃𝑣𝐽 (𝑆𝑣𝑣𝑀)))
9 inopn 22248 . . . . . . . . . . 11 ((𝐽 ∈ Top ∧ 𝐽𝑣𝐽) → (𝑣) ∈ 𝐽)
1093expa 1118 . . . . . . . . . 10 (((𝐽 ∈ Top ∧ 𝐽) ∧ 𝑣𝐽) → (𝑣) ∈ 𝐽)
11 ssin 4190 . . . . . . . . . . . . 13 ((𝑆𝑆𝑣) ↔ 𝑆 ⊆ (𝑣))
1211biimpi 215 . . . . . . . . . . . 12 ((𝑆𝑆𝑣) → 𝑆 ⊆ (𝑣))
13 ss2in 4196 . . . . . . . . . . . 12 ((𝑁𝑣𝑀) → (𝑣) ⊆ (𝑁𝑀))
1412, 13anim12i 613 . . . . . . . . . . 11 (((𝑆𝑆𝑣) ∧ (𝑁𝑣𝑀)) → (𝑆 ⊆ (𝑣) ∧ (𝑣) ⊆ (𝑁𝑀)))
1514an4s 658 . . . . . . . . . 10 (((𝑆𝑁) ∧ (𝑆𝑣𝑣𝑀)) → (𝑆 ⊆ (𝑣) ∧ (𝑣) ⊆ (𝑁𝑀)))
16 sseq2 3970 . . . . . . . . . . . 12 (𝑔 = (𝑣) → (𝑆𝑔𝑆 ⊆ (𝑣)))
17 sseq1 3969 . . . . . . . . . . . 12 (𝑔 = (𝑣) → (𝑔 ⊆ (𝑁𝑀) ↔ (𝑣) ⊆ (𝑁𝑀)))
1816, 17anbi12d 631 . . . . . . . . . . 11 (𝑔 = (𝑣) → ((𝑆𝑔𝑔 ⊆ (𝑁𝑀)) ↔ (𝑆 ⊆ (𝑣) ∧ (𝑣) ⊆ (𝑁𝑀))))
1918rspcev 3581 . . . . . . . . . 10 (((𝑣) ∈ 𝐽 ∧ (𝑆 ⊆ (𝑣) ∧ (𝑣) ⊆ (𝑁𝑀))) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))
2010, 15, 19syl2an 596 . . . . . . . . 9 ((((𝐽 ∈ Top ∧ 𝐽) ∧ 𝑣𝐽) ∧ ((𝑆𝑁) ∧ (𝑆𝑣𝑣𝑀))) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))
2120expr 457 . . . . . . . 8 ((((𝐽 ∈ Top ∧ 𝐽) ∧ 𝑣𝐽) ∧ (𝑆𝑁)) → ((𝑆𝑣𝑣𝑀) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀))))
2221an32s 650 . . . . . . 7 ((((𝐽 ∈ Top ∧ 𝐽) ∧ (𝑆𝑁)) ∧ 𝑣𝐽) → ((𝑆𝑣𝑣𝑀) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀))))
2322rexlimdva 3152 . . . . . 6 (((𝐽 ∈ Top ∧ 𝐽) ∧ (𝑆𝑁)) → (∃𝑣𝐽 (𝑆𝑣𝑣𝑀) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀))))
2423rexlimdva2 3154 . . . . 5 (𝐽 ∈ Top → (∃𝐽 (𝑆𝑁) → (∃𝑣𝐽 (𝑆𝑣𝑣𝑀) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))))
2524imp32 419 . . . 4 ((𝐽 ∈ Top ∧ (∃𝐽 (𝑆𝑁) ∧ ∃𝑣𝐽 (𝑆𝑣𝑣𝑀))) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))
268, 25syldan 591 . . 3 ((𝐽 ∈ Top ∧ (𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆))) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))
27263impb 1115 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))
281neiss2 22452 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 𝐽)
291isnei 22454 . . . 4 ((𝐽 ∈ Top ∧ 𝑆 𝐽) → ((𝑁𝑀) ∈ ((nei‘𝐽)‘𝑆) ↔ ((𝑁𝑀) ⊆ 𝐽 ∧ ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))))
3028, 29syldan 591 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ((𝑁𝑀) ∈ ((nei‘𝐽)‘𝑆) ↔ ((𝑁𝑀) ⊆ 𝐽 ∧ ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))))
31303adant3 1132 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆)) → ((𝑁𝑀) ∈ ((nei‘𝐽)‘𝑆) ↔ ((𝑁𝑀) ⊆ 𝐽 ∧ ∃𝑔𝐽 (𝑆𝑔𝑔 ⊆ (𝑁𝑀)))))
325, 27, 31mpbir2and 711 1 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑀 ∈ ((nei‘𝐽)‘𝑆)) → (𝑁𝑀) ∈ ((nei‘𝐽)‘𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wrex 3073  cin 3909  wss 3910   cuni 4865  cfv 6496  Topctop 22242  neicnei 22448
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-top 22243  df-nei 22449
This theorem is referenced by:  neifil  23231  neificl  36212
  Copyright terms: Public domain W3C validator