Theorem sclnbgrelself 49219

Description: A vertex 𝑁 is a member of its semiclosed neighborhood iff there is an edge joining the vertex with a vertex. (Contributed by AV, 16-May-2025.)

Hypotheses

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

Assertion

Ref	Expression
sclnbgrelself	⊢ (𝑁 ∈ 𝑆 ↔ (𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 𝑁 ∈ 𝑒))

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

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

Proof of Theorem sclnbgrelself

Step	Hyp	Ref	Expression
1		dfsclnbgr2.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		dfsclnbgr2.s	. . 3 ⊢ 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}
3		dfsclnbgr2.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
4	1, 2, 3	sclnbgrel 49218	. 2 ⊢ (𝑁 ∈ 𝑆 ↔ (𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑁} ⊆ 𝑒))
5		dfsn2 4597	. . . . . . 7 ⊢ {𝑁} = {𝑁, 𝑁}
6	5	eqcomi 2772	. . . . . 6 ⊢ {𝑁, 𝑁} = {𝑁}
7	6	sseq1i 3941	. . . . 5 ⊢ ({𝑁, 𝑁} ⊆ 𝑒 ↔ {𝑁} ⊆ 𝑒)
8		snssg 4746	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → (𝑁 ∈ 𝑒 ↔ {𝑁} ⊆ 𝑒))
9	7, 8	bitr4id 293	. . . 4 ⊢ (𝑁 ∈ 𝑉 → ({𝑁, 𝑁} ⊆ 𝑒 ↔ 𝑁 ∈ 𝑒))
10	9	rexbidv 3190	. . 3 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 {𝑁, 𝑁} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 𝑁 ∈ 𝑒))
11	10	pm5.32i 585	. 2 ⊢ ((𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑁} ⊆ 𝑒) ↔ (𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 𝑁 ∈ 𝑒))
12	4, 11	bitri 278	1 ⊢ (𝑁 ∈ 𝑆 ↔ (𝑁 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 𝑁 ∈ 𝑒))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416   ⊆ wss 3900  {csn 4588  {cpr 4590  ‘cfv 6566  Vtxcvtx 29631  Edgcedg 29682

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591

This theorem is used by: (None)