Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  vopnbgrelself Structured version   Visualization version   GIF version

Theorem vopnbgrelself 47894
Description: A vertex 𝑁 is a member of its semiopen neighborhood iff there is a loop joining the vertex with itself. (Contributed by AV, 16-May-2025.)
Hypotheses
Ref Expression
dfvopnbgr2.v 𝑉 = (Vtx‘𝐺)
dfvopnbgr2.e 𝐸 = (Edg‘𝐺)
dfvopnbgr2.u 𝑈 = {𝑛𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒𝐸 (𝑁 = 𝑛𝑒 = {𝑁}))}
Assertion
Ref Expression
vopnbgrelself (𝑁𝑉 → (𝑁𝑈 ↔ ∃𝑒𝐸 𝑒 = {𝑁}))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛   𝑛,𝐸
Allowed substitution hints:   𝑈(𝑒,𝑛)   𝐺(𝑛)

Proof of Theorem vopnbgrelself
StepHypRef Expression
1 ibar 528 . 2 (𝑁𝑉 → (∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})) ↔ (𝑁𝑉 ∧ ∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))))
2 eqid 2731 . . . . . . 7 𝑁 = 𝑁
32jctl 523 . . . . . 6 (𝑒 = {𝑁} → (𝑁 = 𝑁𝑒 = {𝑁}))
43olcd 874 . . . . 5 (𝑒 = {𝑁} → ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))
5 eqneqall 2939 . . . . . . . 8 (𝑁 = 𝑁 → (𝑁𝑁 → ((𝑁𝑒𝑁𝑒) → 𝑒 = {𝑁})))
62, 5ax-mp 5 . . . . . . 7 (𝑁𝑁 → ((𝑁𝑒𝑁𝑒) → 𝑒 = {𝑁}))
763impib 1116 . . . . . 6 ((𝑁𝑁𝑁𝑒𝑁𝑒) → 𝑒 = {𝑁})
8 simpr 484 . . . . . 6 ((𝑁 = 𝑁𝑒 = {𝑁}) → 𝑒 = {𝑁})
97, 8jaoi 857 . . . . 5 (((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})) → 𝑒 = {𝑁})
104, 9impbii 209 . . . 4 (𝑒 = {𝑁} ↔ ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))
1110a1i 11 . . 3 (𝑁𝑉 → (𝑒 = {𝑁} ↔ ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁}))))
1211rexbidv 3156 . 2 (𝑁𝑉 → (∃𝑒𝐸 𝑒 = {𝑁} ↔ ∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁}))))
13 dfvopnbgr2.v . . 3 𝑉 = (Vtx‘𝐺)
14 dfvopnbgr2.e . . 3 𝐸 = (Edg‘𝐺)
15 dfvopnbgr2.u . . 3 𝑈 = {𝑛𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒𝐸 (𝑁 = 𝑛𝑒 = {𝑁}))}
1613, 14, 15vopnbgrel 47893 . 2 (𝑁𝑉 → (𝑁𝑈 ↔ (𝑁𝑉 ∧ ∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))))
171, 12, 163bitr4rd 312 1 (𝑁𝑉 → (𝑁𝑈 ↔ ∃𝑒𝐸 𝑒 = {𝑁}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 847  w3a 1086   = wceq 1541  wcel 2111  wne 2928  wrex 3056  {crab 3395  {csn 4573  cfv 6481  (class class class)co 7346  Vtxcvtx 28974  Edgcedg 29025   NeighbVtx cnbgr 29310
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-1st 7921  df-2nd 7922  df-nbgr 29311
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator