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

Theorem predgclnbgrel 48906
Description: If a (not necessarily proper) unordered pair containing a vertex is an edge, the other vertex is in the closed neighborhood of the first vertex. (Contributed by AV, 23-Aug-2025.)
Hypotheses
Ref Expression
predgclnbgrel.v 𝑉 = (Vtx‘𝐺)
predgclnbgrel.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
predgclnbgrel ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → 𝑁 ∈ (𝐺 ClNeighbVtx 𝑋))

Proof of Theorem predgclnbgrel
Dummy variable 𝑒 is distinct from all other variables.
StepHypRef Expression
1 3simpa 1166 . 2 ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → (𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉))
2 simp3 1156 . . . 4 ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → {𝑋, 𝑁} ∈ 𝐸)
3 sseq2 3957 . . . . 5 (𝑒 = {𝑋, 𝑁} → ({𝑋, 𝑁} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ {𝑋, 𝑁}))
43adantl 487 . . . 4 (((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) ∧ 𝑒 = {𝑋, 𝑁}) → ({𝑋, 𝑁} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ {𝑋, 𝑁}))
5 ssidd 3954 . . . 4 ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → {𝑋, 𝑁} ⊆ {𝑋, 𝑁})
62, 4, 5rspcedvd 3579 . . 3 ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)
76olcd 888 . 2 ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → (𝑁 = 𝑋 ∨ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
8 predgclnbgrel.v . . 3 𝑉 = (Vtx‘𝐺)
9 predgclnbgrel.e . . 3 𝐸 = (Edg‘𝐺)
108, 9clnbgrel 48895 . 2 (𝑁 ∈ (𝐺 ClNeighbVtx 𝑋) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ (𝑁 = 𝑋 ∨ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
111, 7, 10sylanbrc 595 1 ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉 ∧ {𝑋, 𝑁} ∈ 𝐸) → 𝑁 ∈ (𝐺 ClNeighbVtx 𝑋))
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 2145  ∃wrex 3087   ⊆ wss 3899  {cpr 4586  ‘cfv 6537  (class class class)co 7418  Vtxcvtx 29567  Edgcedg 29618   ClNeighbVtx cclnbgr 48885
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1st 7999  df-2nd 8000  df-clnbgr 48886
This theorem is used by:  grlimgredgex  49067  grlimgrtri  49070
  Copyright terms: Public domain W3C validator