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

Theorem neifval 23035
Description: Value of the neighborhood function on the subsets of the base set of a topology. (Contributed by NM, 11-Feb-2007.) (Revised by Mario Carneiro, 11-Nov-2013.)
Hypothesis
Ref Expression
neifval.1 𝑋 = 𝐽
Assertion
Ref Expression
neifval (𝐽 ∈ Top → (nei‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
Distinct variable groups:   𝑣,𝑔,𝑥,𝐽   𝑔,𝑋,𝑣,𝑥

Proof of Theorem neifval
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 neifval.1 . . . 4 𝑋 = 𝐽
21topopn 22842 . . 3 (𝐽 ∈ Top → 𝑋𝐽)
3 pwexg 5348 . . 3 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
4 mptexg 7212 . . 3 (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}) ∈ V)
52, 3, 43syl 18 . 2 (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}) ∈ V)
6 unieq 4894 . . . . . 6 (𝑗 = 𝐽 𝑗 = 𝐽)
76, 1eqtr4di 2788 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝑋)
87pweqd 4592 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝑋)
9 rexeq 3301 . . . . 5 (𝑗 = 𝐽 → (∃𝑔𝑗 (𝑥𝑔𝑔𝑣) ↔ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)))
108, 9rabeqbidv 3434 . . . 4 (𝑗 = 𝐽 → {𝑣 ∈ 𝒫 𝑗 ∣ ∃𝑔𝑗 (𝑥𝑔𝑔𝑣)} = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)})
118, 10mpteq12dv 5207 . . 3 (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 𝑗 ↦ {𝑣 ∈ 𝒫 𝑗 ∣ ∃𝑔𝑗 (𝑥𝑔𝑔𝑣)}) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
12 df-nei 23034 . . 3 nei = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 𝑗 ↦ {𝑣 ∈ 𝒫 𝑗 ∣ ∃𝑔𝑗 (𝑥𝑔𝑔𝑣)}))
1311, 12fvmptg 6983 . 2 ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}) ∈ V) → (nei‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
145, 13mpdan 687 1 (𝐽 ∈ Top → (nei‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wrex 3060  {crab 3415  Vcvv 3459  wss 3926  𝒫 cpw 4575   cuni 4883  cmpt 5201  cfv 6530  Topctop 22829  neicnei 23033
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6483  df-fun 6532  df-fn 6533  df-f 6534  df-f1 6535  df-fo 6536  df-f1o 6537  df-fv 6538  df-top 22830  df-nei 23034
This theorem is referenced by:  neif  23036  neival  23038
  Copyright terms: Public domain W3C validator