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

Theorem neifval 23074
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 22881 . . 3 (𝐽 ∈ Top → 𝑋𝐽)
3 pwexg 5315 . . 3 (𝑋𝐽 → 𝒫 𝑋 ∈ V)
4 mptexg 7169 . . 3 (𝒫 𝑋 ∈ V → (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}) ∈ V)
52, 3, 43syl 18 . 2 (𝐽 ∈ Top → (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}) ∈ V)
6 unieq 4862 . . . . . 6 (𝑗 = 𝐽 𝑗 = 𝐽)
76, 1eqtr4di 2790 . . . . 5 (𝑗 = 𝐽 𝑗 = 𝑋)
87pweqd 4559 . . . 4 (𝑗 = 𝐽 → 𝒫 𝑗 = 𝒫 𝑋)
9 rexeq 3292 . . . . 5 (𝑗 = 𝐽 → (∃𝑔𝑗 (𝑥𝑔𝑔𝑣) ↔ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)))
108, 9rabeqbidv 3408 . . . 4 (𝑗 = 𝐽 → {𝑣 ∈ 𝒫 𝑗 ∣ ∃𝑔𝑗 (𝑥𝑔𝑔𝑣)} = {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)})
118, 10mpteq12dv 5173 . . 3 (𝑗 = 𝐽 → (𝑥 ∈ 𝒫 𝑗 ↦ {𝑣 ∈ 𝒫 𝑗 ∣ ∃𝑔𝑗 (𝑥𝑔𝑔𝑣)}) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
12 df-nei 23073 . . 3 nei = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 𝑗 ↦ {𝑣 ∈ 𝒫 𝑗 ∣ ∃𝑔𝑗 (𝑥𝑔𝑔𝑣)}))
1311, 12fvmptg 6939 . 2 ((𝐽 ∈ Top ∧ (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}) ∈ V) → (nei‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
145, 13mpdan 688 1 (𝐽 ∈ Top → (nei‘𝐽) = (𝑥 ∈ 𝒫 𝑋 ↦ {𝑣 ∈ 𝒫 𝑋 ∣ ∃𝑔𝐽 (𝑥𝑔𝑔𝑣)}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wrex 3062  {crab 3390  Vcvv 3430  wss 3890  𝒫 cpw 4542   cuni 4851  cmpt 5167  cfv 6492  Topctop 22868  neicnei 23072
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-top 22869  df-nei 23073
This theorem is referenced by:  neif  23075  neival  23077
  Copyright terms: Public domain W3C validator