Theorem neircl 49392

Description: Reverse closure of the neighborhood operation. (This theorem depends on a function's value being empty outside of its domain, but it will make later theorems simpler to state.) (Contributed by Zhi Wang, 16-Sep-2024.)

Assertion

Ref	Expression
neircl	⊢ (𝑁 ∈ ((nei‘𝐽)‘𝑆) → 𝐽 ∈ Top)

Proof of Theorem neircl

Dummy variables 𝑓 𝑔 𝑗 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvne0 49336	. 2 ⊢ (𝑁 ∈ ((nei‘𝐽)‘𝑆) → (nei‘𝐽) ≠ ∅)
2		n0 4294	. . 3 ⊢ ((nei‘𝐽) ≠ ∅ ↔ ∃𝑓 𝑓 ∈ (nei‘𝐽))
3	2	biimpi 216	. 2 ⊢ ((nei‘𝐽) ≠ ∅ → ∃𝑓 𝑓 ∈ (nei‘𝐽))
4		df-nei 23073	. . . 4 ⊢ nei = (𝑗 ∈ Top ↦ (𝑥 ∈ 𝒫 ∪ 𝑗 ↦ {𝑦 ∈ 𝒫 ∪ 𝑗 ∣ ∃𝑔 ∈ 𝑗 (𝑥 ⊆ 𝑔 ∧ 𝑔 ⊆ 𝑦)}))
5	4	mptrcl 6951	. . 3 ⊢ (𝑓 ∈ (nei‘𝐽) → 𝐽 ∈ Top)
6	5	exlimiv 1932	. 2 ⊢ (∃𝑓 𝑓 ∈ (nei‘𝐽) → 𝐽 ∈ Top)
7	1, 3, 6	3syl 18	1 ⊢ (𝑁 ∈ ((nei‘𝐽)‘𝑆) → 𝐽 ∈ Top)

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∃wrex 3062  {crab 3390   ⊆ wss 3890  ∅c0 4274  𝒫 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-sep 5231  ax-nul 5241  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-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-xp 5630  df-rel 5631  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fv 6500  df-nei 23073

This theorem is referenced by: (None)