Theorem dfclnbgr6 48773

Description: Alternate definition of the closed neighborhood of a vertex as union of the vertex with its semiopen neighborhood. (Contributed by AV, 17-May-2025.)

Hypotheses

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

Assertion

Ref	Expression
dfclnbgr6	⊢ (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ 𝑈))

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

Allowed substitution hints:   𝑈(𝑒, 𝑛)

Proof of Theorem dfclnbgr6

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		orc 881	. . . . . . 7 ⊢ (𝑣 = 𝑁 → (𝑣 = 𝑁 ∨ ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))))
2	1	a1d 26	. . . . . 6 ⊢ (𝑣 = 𝑁 → (𝑁 ∈ 𝑉 → (𝑣 = 𝑁 ∨ ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))))))
3		simpl 488	. . . . . . . . . . . . . . 15 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → 𝑣 ≠ 𝑁)
4	3	anim1i 627	. . . . . . . . . . . . . 14 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) ∧ (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) → (𝑣 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
5		3anass 1111	. . . . . . . . . . . . . 14 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ↔ (𝑣 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
6	4, 5	sylibr 237	. . . . . . . . . . . . 13 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) ∧ (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) → (𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))
7	6	orcd 887	. . . . . . . . . . . 12 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) ∧ (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) → ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))
8	7	ex 418	. . . . . . . . . . 11 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → ((𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) → ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))
9		3simpc 1168	. . . . . . . . . . . . 13 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) → (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))
10	9	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) → (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
11		vsnid 4624	. . . . . . . . . . . . . . . . 17 ⊢ 𝑣 ∈ {𝑣}
12		eleq2 2849	. . . . . . . . . . . . . . . . 17 ⊢ (𝑒 = {𝑣} → (𝑣 ∈ 𝑒 ↔ 𝑣 ∈ {𝑣}))
13	11, 12	mpbiri 261	. . . . . . . . . . . . . . . 16 ⊢ (𝑒 = {𝑣} → 𝑣 ∈ 𝑒)
14	13	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑣 = 𝑁 ∧ 𝑒 = {𝑣}) → 𝑣 ∈ 𝑒)
15		eleq1 2848	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 = 𝑁 → (𝑣 ∈ 𝑒 ↔ 𝑁 ∈ 𝑒))
16	15	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((𝑣 = 𝑁 ∧ 𝑒 = {𝑣}) → (𝑣 ∈ 𝑒 ↔ 𝑁 ∈ 𝑒))
17	14, 16	mpbid 235	. . . . . . . . . . . . . 14 ⊢ ((𝑣 = 𝑁 ∧ 𝑒 = {𝑣}) → 𝑁 ∈ 𝑒)
18	17, 14	jca 521	. . . . . . . . . . . . 13 ⊢ ((𝑣 = 𝑁 ∧ 𝑒 = {𝑣}) → (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))
19	18	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → ((𝑣 = 𝑁 ∧ 𝑒 = {𝑣}) → (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
20	10, 19	jaod 873	. . . . . . . . . . 11 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → (((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})) → (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
21	8, 20	impbid 215	. . . . . . . . . 10 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → ((𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ↔ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))
22	21	rexbidv 3186	. . . . . . . . 9 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → (∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ↔ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))
23	22	anbi2d 642	. . . . . . . 8 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))))
24	23	olcd 888	. . . . . . 7 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑉) → (𝑣 = 𝑁 ∨ ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))))
25	24	ex 418	. . . . . 6 ⊢ (𝑣 ≠ 𝑁 → (𝑁 ∈ 𝑉 → (𝑣 = 𝑁 ∨ ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))))))
26	2, 25	pm2.61ine 3038	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → (𝑣 = 𝑁 ∨ ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))))
27		orbidi 967	. . . . 5 ⊢ ((𝑣 = 𝑁 ∨ ((𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)) ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))) ↔ ((𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))) ↔ (𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))))
28	26, 27	sylib 221	. . . 4 ⊢ (𝑁 ∈ 𝑉 → ((𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))) ↔ (𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))))
29		elun 4100	. . . . 5 ⊢ (𝑣 ∈ ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}) ↔ (𝑣 ∈ {𝑁} ∨ 𝑣 ∈ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
30		velsn 4600	. . . . . 6 ⊢ (𝑣 ∈ {𝑁} ↔ 𝑣 = 𝑁)
31		eleq1 2848	. . . . . . . . 9 ⊢ (𝑛 = 𝑣 → (𝑛 ∈ 𝑒 ↔ 𝑣 ∈ 𝑒))
32	31	anbi2d 642	. . . . . . . 8 ⊢ (𝑛 = 𝑣 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
33	32	rexbidv 3186	. . . . . . 7 ⊢ (𝑛 = 𝑣 → (∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
34	33	elrab 3645	. . . . . 6 ⊢ (𝑣 ∈ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)} ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
35	30, 34	orbi12i 928	. . . . 5 ⊢ ((𝑣 ∈ {𝑁} ∨ 𝑣 ∈ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}) ↔ (𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))))
36	29, 35	bitri 278	. . . 4 ⊢ (𝑣 ∈ ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}) ↔ (𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒))))
37		elun 4100	. . . . 5 ⊢ (𝑣 ∈ ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))}) ↔ (𝑣 ∈ {𝑁} ∨ 𝑣 ∈ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))}))
38		neeq1 3017	. . . . . . . . . 10 ⊢ (𝑛 = 𝑣 → (𝑛 ≠ 𝑁 ↔ 𝑣 ≠ 𝑁))
39	38, 31	3anbi13d 1466	. . . . . . . . 9 ⊢ (𝑛 = 𝑣 → ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ (𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒)))
40		eqeq1 2764	. . . . . . . . . 10 ⊢ (𝑛 = 𝑣 → (𝑛 = 𝑁 ↔ 𝑣 = 𝑁))
41		sneq 4594	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑣 → {𝑛} = {𝑣})
42	41	eqeq2d 2771	. . . . . . . . . 10 ⊢ (𝑛 = 𝑣 → (𝑒 = {𝑛} ↔ 𝑒 = {𝑣}))
43	40, 42	anbi12d 644	. . . . . . . . 9 ⊢ (𝑛 = 𝑣 → ((𝑛 = 𝑁 ∧ 𝑒 = {𝑛}) ↔ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))
44	39, 43	orbi12d 932	. . . . . . . 8 ⊢ (𝑛 = 𝑣 → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ↔ ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))
45	44	rexbidv 3186	. . . . . . 7 ⊢ (𝑛 = 𝑣 → (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ↔ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))
46	45	elrab 3645	. . . . . 6 ⊢ (𝑣 ∈ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ↔ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣}))))
47	30, 46	orbi12i 928	. . . . 5 ⊢ ((𝑣 ∈ {𝑁} ∨ 𝑣 ∈ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))}) ↔ (𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))))
48	37, 47	bitri 278	. . . 4 ⊢ (𝑣 ∈ ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))}) ↔ (𝑣 = 𝑁 ∨ (𝑣 ∈ 𝑉 ∧ ∃𝑒 ∈ 𝐸 ((𝑣 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑣 ∈ 𝑒) ∨ (𝑣 = 𝑁 ∧ 𝑒 = {𝑣})))))
49	28, 36, 48	3bitr4g 317	. . 3 ⊢ (𝑁 ∈ 𝑉 → (𝑣 ∈ ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}) ↔ 𝑣 ∈ ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))})))
50	49	eqrdv 2758	. 2 ⊢ (𝑁 ∈ 𝑉 → ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))}))
51		dfvopnbgr2.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
52		dfvopnbgr2.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
53	51, 52	dfclnbgr2 48740	. 2 ⊢ (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)}))
54		dfvopnbgr2.u	. . . 4 ⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))}
55	51, 52, 54	dfvopnbgr2 48770	. . 3 ⊢ (𝑁 ∈ 𝑉 → 𝑈 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))})
56	55	uneq2d 4115	. 2 ⊢ (𝑁 ∈ 𝑉 → ({𝑁} ∪ 𝑈) = ({𝑁} ∪ {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))}))
57	50, 53, 56	3eqtr4d 2805	1 ⊢ (𝑁 ∈ 𝑉 → (𝐺 ClNeighbVtx 𝑁) = ({𝑁} ∪ 𝑈))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∃wrex 3086  {crab 3412   ∪ cun 3897  {csn 4584  ‘cfv 6533  (class class class)co 7414  Vtxcvtx 29454  Edgcedg 29505   NeighbVtx cnbgr 29793   ClNeighbVtx cclnbgr 48735

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-nbgr 29794  df-clnbgr 48736

This theorem is used by: (None)