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

Theorem neiss 21401
Description: Any neighborhood of a set 𝑆 is also a neighborhood of any subset 𝑅𝑆. Similar to Proposition 1 of [BourbakiTop1] p. I.2. (Contributed by FL, 25-Sep-2006.)
Assertion
Ref Expression
neiss ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝑁 ∈ ((nei‘𝐽)‘𝑅))

Proof of Theorem neiss
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 eqid 2795 . . . 4 𝐽 = 𝐽
21neii1 21398 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑁 𝐽)
323adant3 1125 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝑁 𝐽)
4 neii2 21400 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑔𝐽 (𝑆𝑔𝑔𝑁))
543adant3 1125 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → ∃𝑔𝐽 (𝑆𝑔𝑔𝑁))
6 sstr2 3896 . . . . . 6 (𝑅𝑆 → (𝑆𝑔𝑅𝑔))
76anim1d 610 . . . . 5 (𝑅𝑆 → ((𝑆𝑔𝑔𝑁) → (𝑅𝑔𝑔𝑁)))
87reximdv 3236 . . . 4 (𝑅𝑆 → (∃𝑔𝐽 (𝑆𝑔𝑔𝑁) → ∃𝑔𝐽 (𝑅𝑔𝑔𝑁)))
983ad2ant3 1128 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → (∃𝑔𝐽 (𝑆𝑔𝑔𝑁) → ∃𝑔𝐽 (𝑅𝑔𝑔𝑁)))
105, 9mpd 15 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → ∃𝑔𝐽 (𝑅𝑔𝑔𝑁))
11 simp1 1129 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝐽 ∈ Top)
12 simp3 1131 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝑅𝑆)
131neiss2 21393 . . . . 5 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 𝐽)
14133adant3 1125 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝑆 𝐽)
1512, 14sstrd 3899 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝑅 𝐽)
161isnei 21395 . . 3 ((𝐽 ∈ Top ∧ 𝑅 𝐽) → (𝑁 ∈ ((nei‘𝐽)‘𝑅) ↔ (𝑁 𝐽 ∧ ∃𝑔𝐽 (𝑅𝑔𝑔𝑁))))
1711, 15, 16syl2anc 584 . 2 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → (𝑁 ∈ ((nei‘𝐽)‘𝑅) ↔ (𝑁 𝐽 ∧ ∃𝑔𝐽 (𝑅𝑔𝑔𝑁))))
183, 10, 17mpbir2and 709 1 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆) ∧ 𝑅𝑆) → 𝑁 ∈ ((nei‘𝐽)‘𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1080  wcel 2081  wrex 3106  wss 3859   cuni 4745  cfv 6225  Topctop 21185  neicnei 21389
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1777  ax-4 1791  ax-5 1888  ax-6 1947  ax-7 1992  ax-8 2083  ax-9 2091  ax-10 2112  ax-11 2126  ax-12 2141  ax-13 2344  ax-ext 2769  ax-rep 5081  ax-sep 5094  ax-nul 5101  ax-pow 5157  ax-pr 5221
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3an 1082  df-tru 1525  df-ex 1762  df-nf 1766  df-sb 2043  df-mo 2576  df-eu 2612  df-clab 2776  df-cleq 2788  df-clel 2863  df-nfc 2935  df-ne 2985  df-ral 3110  df-rex 3111  df-reu 3112  df-rab 3114  df-v 3439  df-sbc 3707  df-csb 3812  df-dif 3862  df-un 3864  df-in 3866  df-ss 3874  df-nul 4212  df-if 4382  df-pw 4455  df-sn 4473  df-pr 4475  df-op 4479  df-uni 4746  df-iun 4827  df-br 4963  df-opab 5025  df-mpt 5042  df-id 5348  df-xp 5449  df-rel 5450  df-cnv 5451  df-co 5452  df-dm 5453  df-rn 5454  df-res 5455  df-ima 5456  df-iota 6189  df-fun 6227  df-fn 6228  df-f 6229  df-f1 6230  df-fo 6231  df-f1o 6232  df-fv 6233  df-top 21186  df-nei 21390
This theorem is referenced by:  neips  21405  neissex  21419
  Copyright terms: Public domain W3C validator