Theorem dfsclnbgr2 49052

Description: Alternate definition of the semiclosed neighborhood of a vertex breaking up the subset relationship of an unordered pair. A semiclosed neighborhood 𝑆 of a vertex 𝑁 is the set of all vertices incident with edges which join the vertex 𝑁 with a vertex. Therefore, a vertex is contained in its semiclosed neighborhood if it is connected with any vertex by an edge (see sclnbgrelself 49054), even only with itself (i.e., by a loop). (Contributed by AV, 16-May-2025.)

Hypotheses

Ref	Expression
dfsclnbgr2.v	⊢ 𝑉 = (Vtx‘𝐺)
dfsclnbgr2.s	⊢ 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}
dfsclnbgr2.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
dfsclnbgr2	⊢ (𝑁 ∈ 𝑉 → 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})

Distinct variable groups:   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛

Allowed substitution hints:   𝑆(𝑒, 𝑛)   𝐸(𝑒, 𝑛)   𝐺(𝑒, 𝑛)

Proof of Theorem dfsclnbgr2

Step	Hyp	Ref	Expression
1		dfsclnbgr2.s	. 2 ⊢ 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}
2		prssg 4774	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
3	2	bicomd 226	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
4	3	rexbidv 3186	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
5	4	rabbidva 3418	. 2 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒} = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})
6	1, 5	eqtrid 2807	1 ⊢ (𝑁 ∈ 𝑉 → 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  {crab 3412   ⊆ wss 3896  {cpr 4586  ‘cfv 6543  Vtxcvtx 29583  Edgcedg 29634

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-un 4150  df-sn 4585  df-pr 4587

This theorem is used by:  dfclnbgr5  49056  dfnbgr5  49057  dfsclnbgr6  49064