Theorem dfvopnbgr2 48646

Description: Alternate definition of the semiopen neighborhood of a vertex breaking up the subset relationship of an unordered pair. A semiopen neighborhood 𝑈 of a vertex 𝑁 is its open neighborhood together with itself if there is a loop at this vertex. (Contributed by AV, 15-May-2025.)

Hypotheses

Ref	Expression
dfvopnbgr2.v	⊢ 𝑉 = (Vtx‘𝐺)
dfvopnbgr2.e	⊢ 𝐸 = (Edg‘𝐺)
dfvopnbgr2.u	⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))}

Assertion

Ref	Expression
dfvopnbgr2	⊢ (𝑁 ∈ 𝑉 → 𝑈 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))})

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

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

Proof of Theorem dfvopnbgr2

Step	Hyp	Ref	Expression
1		dfvopnbgr2.u	. 2 ⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))}
2		dfvopnbgr2.v	. . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺)
3		dfvopnbgr2.e	. . . . . . . 8 ⊢ 𝐸 = (Edg‘𝐺)
4	2, 3	nbgrel 29699	. . . . . . 7 ⊢ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒))
5	4	a1i 11	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒)))
6	5	orbi1d 929	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))))
7		df-3an 1105	. . . . . . . . 9 ⊢ (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒) ↔ (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒))
8		r19.42v 3197	. . . . . . . . 9 ⊢ (∃𝑒 ∈ 𝐸 (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒))
9	7, 8	bitr4i 281	. . . . . . . 8 ⊢ (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒) ↔ ∃𝑒 ∈ 𝐸 (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒))
10	9	orbi1i 926	. . . . . . 7 ⊢ ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ (∃𝑒 ∈ 𝐸 (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})))
11	10	a1i 11	. . . . . 6 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ (∃𝑒 ∈ 𝐸 (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))))
12		r19.43 3133	. . . . . 6 ⊢ (∃𝑒 ∈ 𝐸 ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ (∃𝑒 ∈ 𝐸 (((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})))
13	11, 12	bitr4di 292	. . . . 5 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁 ∧ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ ∃𝑒 ∈ 𝐸 ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))))
14	6, 13	bitrd 282	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ ∃𝑒 ∈ 𝐸 ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))))
15		anass 473	. . . . . . . 8 ⊢ ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒)))
16	15	a1i 11	. . . . . . 7 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒))))
17		ibar 537	. . . . . . . . 9 ⊢ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) → ((𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒))))
18	17	ancoms 463	. . . . . . . 8 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒))))
19	18	adantr 485	. . . . . . 7 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ((𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ ((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒))))
20		prssg 4785	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ {𝑁, 𝑛} ⊆ 𝑒))
21	20	bicomd 226	. . . . . . . . . 10 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
22	21	adantr 485	. . . . . . . . 9 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ({𝑁, 𝑛} ⊆ 𝑒 ↔ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
23	22	anbi2d 641	. . . . . . . 8 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ((𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ (𝑛 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))))
24		3anass 1111	. . . . . . . 8 ⊢ ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ (𝑛 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
25	23, 24	bitr4di 292	. . . . . . 7 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ((𝑛 ≠ 𝑁 ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ (𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
26	16, 19, 25	3bitr2d 310	. . . . . 6 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ↔ (𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
27		eqcom 2770	. . . . . . . . 9 ⊢ (𝑁 = 𝑛 ↔ 𝑛 = 𝑁)
28	27	anbi1i 635	. . . . . . . 8 ⊢ ((𝑁 = 𝑛 ∧ 𝑒 = {𝑁}) ↔ (𝑛 = 𝑁 ∧ 𝑒 = {𝑁}))
29		sneq 4599	. . . . . . . . . . 11 ⊢ (𝑁 = 𝑛 → {𝑁} = {𝑛})
30	29	eqcoms 2771	. . . . . . . . . 10 ⊢ (𝑛 = 𝑁 → {𝑁} = {𝑛})
31	30	eqeq2d 2774	. . . . . . . . 9 ⊢ (𝑛 = 𝑁 → (𝑒 = {𝑁} ↔ 𝑒 = {𝑛}))
32	31	pm5.32i 584	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑒 = {𝑁}) ↔ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))
33	28, 32	bitri 278	. . . . . . 7 ⊢ ((𝑁 = 𝑛 ∧ 𝑒 = {𝑁}) ↔ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))
34	33	a1i 11	. . . . . 6 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → ((𝑁 = 𝑛 ∧ 𝑒 = {𝑁}) ↔ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})))
35	26, 34	orbi12d 931	. . . . 5 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) ∧ 𝑒 ∈ 𝐸) → (((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))))
36	35	rexbidva 3187	. . . 4 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 ((((𝑛 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑛 ≠ 𝑁) ∧ {𝑁, 𝑛} ⊆ 𝑒) ∨ (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))))
37	14, 36	bitrd 282	. . 3 ⊢ ((𝑁 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → ((𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁})) ↔ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))))
38	37	rabbidva 3422	. 2 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))} = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))})
39	1, 38	eqtrid 2810	1 ⊢ (𝑁 ∈ 𝑉 → 𝑈 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∃wrex 3089  {crab 3416   ⊆ wss 3905  {csn 4589  {cpr 4591  ‘cfv 6536  (class class class)co 7410  Vtxcvtx 29355  Edgcedg 29406   NeighbVtx cnbgr 29691

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-nbgr 29692

This theorem is used by:  vopnbgrel  48647  dfclnbgr6  48649  dfnbgr6  48650  dfsclnbgr6  48651