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

Theorem ssnei2 23464
Description: Any subset 𝑀 of 𝑋 containing a neighborhood 𝑁 of a set 𝑆 is a neighborhood of this set. Generalization to subsets of Property Vi of [BourbakiTop1] p. I.3. (Contributed by FL, 2-Oct-2006.)
Hypothesis
Ref Expression
neips.1 𝑋 = ∪ 𝐽
Assertion
Ref Expression
ssnei2 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑁 ⊆ 𝑀 ∧ 𝑀 ⊆ 𝑋)) → 𝑀 ∈ ((nei‘𝐽)‘𝑆))

Proof of Theorem ssnei2
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 simprr 785 . 2 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑁 ⊆ 𝑀 ∧ 𝑀 ⊆ 𝑋)) → 𝑀 ⊆ 𝑋)
2 neii2 23456 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁))
3 sstr2 3920 . . . . . . 7 (𝑔 ⊆ 𝑁 → (𝑁 ⊆ 𝑀 → 𝑔 ⊆ 𝑀))
43com12 33 . . . . . 6 (𝑁 ⊆ 𝑀 → (𝑔 ⊆ 𝑁 → 𝑔 ⊆ 𝑀))
54anim2d 624 . . . . 5 (𝑁 ⊆ 𝑀 → ((𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁) → (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀)))
65reximdv 3181 . . . 4 (𝑁 ⊆ 𝑀 → (∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑁) → ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀)))
72, 6mpan9 516 . . 3 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ 𝑁 ⊆ 𝑀) → ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀))
87adantrr 730 . 2 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑁 ⊆ 𝑀 ∧ 𝑀 ⊆ 𝑋)) → ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀))
9 neips.1 . . . . 5 𝑋 = ∪ 𝐽
109neiss2 23449 . . . 4 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → 𝑆 ⊆ 𝑋)
119isnei 23451 . . . 4 ((𝐽 ∈ Top ∧ 𝑆 ⊆ 𝑋) → (𝑀 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑀 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀))))
1210, 11syldan 603 . . 3 ((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) → (𝑀 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑀 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀))))
1312adantr 486 . 2 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑁 ⊆ 𝑀 ∧ 𝑀 ⊆ 𝑋)) → (𝑀 ∈ ((nei‘𝐽)‘𝑆) ↔ (𝑀 ⊆ 𝑋 ∧ ∃𝑔 ∈ 𝐽 (𝑆 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑀))))
141, 8, 13mpbir2and 726 1 (((𝐽 ∈ Top ∧ 𝑁 ∈ ((nei‘𝐽)‘𝑆)) ∧ (𝑁 ⊆ 𝑀 ∧ 𝑀 ⊆ 𝑋)) → 𝑀 ∈ ((nei‘𝐽)‘𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  ∪ cuni 4870  ‘cfv 6558  Topctop 23241  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
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-iun 4956  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-nei 23446
This theorem is used by:  topssnei  23472  nllyrest  23835  nllyidm  23838  hausllycmp  23843  cldllycmp  23844  txnlly  23986  neifil  24229  utop2nei  24599  cnllycmp  25307  gneispb  45323
  Copyright terms: Public domain W3C validator