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 48678
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 538 . 2 (𝑁𝑉 → (∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})) ↔ (𝑁𝑉 ∧ ∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))))
2 eqid 2765 . . . . . . 7 𝑁 = 𝑁
32jctl 533 . . . . . 6 (𝑒 = {𝑁} → (𝑁 = 𝑁𝑒 = {𝑁}))
43olcd 888 . . . . 5 (𝑒 = {𝑁} → ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))
5 eqneqall 2971 . . . . . . . 8 (𝑁 = 𝑁 → (𝑁𝑁 → ((𝑁𝑒𝑁𝑒) → 𝑒 = {𝑁})))
62, 5ax-mp 5 . . . . . . 7 (𝑁𝑁 → ((𝑁𝑒𝑁𝑒) → 𝑒 = {𝑁}))
763impib 1134 . . . . . 6 ((𝑁𝑁𝑁𝑒𝑁𝑒) → 𝑒 = {𝑁})
8 simpr 490 . . . . . 6 ((𝑁 = 𝑁𝑒 = {𝑁}) → 𝑒 = {𝑁})
97, 8jaoi 871 . . . . 5 (((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})) → 𝑒 = {𝑁})
104, 9impbii 212 . . . 4 (𝑒 = {𝑁} ↔ ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))
1110a1i 11 . . 3 (𝑁𝑉 → (𝑒 = {𝑁} ↔ ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁}))))
1211rexbidv 3191 . 2 (𝑁𝑉 → (∃𝑒𝐸 𝑒 = {𝑁} ↔ ∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁}))))
13 dfvopnbgr2.v . . 3 𝑉 = (Vtx‘𝐺)
14 dfvopnbgr2.e . . 3 𝐸 = (Edg‘𝐺)
15 dfvopnbgr2.u . . 3 𝑈 = {𝑛𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒𝐸 (𝑁 = 𝑛𝑒 = {𝑁}))}
1613, 14, 15vopnbgrel 48677 . 2 (𝑁𝑉 → (𝑁𝑈 ↔ (𝑁𝑉 ∧ ∃𝑒𝐸 ((𝑁𝑁𝑁𝑒𝑁𝑒) ∨ (𝑁 = 𝑁𝑒 = {𝑁})))))
171, 12, 163bitr4rd 315 1 (𝑁𝑉 → (𝑁𝑈 ↔ ∃𝑒𝐸 𝑒 = {𝑁}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wo 861  w3a 1103   = wceq 1570  wcel 2146  wne 2960  wrex 3091  {crab 3418  {csn 4591  cfv 6540  (class class class)co 7419  Vtxcvtx 29401  Edgcedg 29452   NeighbVtx cnbgr 29740
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-nbgr 29741
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator