MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nbgrel Structured version   Visualization version   GIF version

Theorem nbgrel 29339
Description: Characterization of a neighbor 𝑁 of a vertex 𝑋 in a graph 𝐺. (Contributed by Alexander van der Vekens and Mario Carneiro, 9-Oct-2017.) (Revised by AV, 26-Oct-2020.) (Revised by AV, 12-Feb-2022.)
Hypotheses
Ref Expression
nbgrel.v 𝑉 = (Vtx‘𝐺)
nbgrel.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
nbgrel (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝑁   𝑒,𝑋   𝑒,𝑉

Proof of Theorem nbgrel
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 nbgrel.v . . . 4 𝑉 = (Vtx‘𝐺)
21nbgrcl 29334 . . 3 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) → 𝑋𝑉)
32pm4.71ri 560 . 2 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ (𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)))
4 nbgrel.e . . . . . . 7 𝐸 = (Edg‘𝐺)
51, 4nbgrval 29335 . . . . . 6 (𝑋𝑉 → (𝐺 NeighbVtx 𝑋) = {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒})
65eleq2d 2819 . . . . 5 (𝑋𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ 𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒}))
7 preq2 4688 . . . . . . . . 9 (𝑛 = 𝑁 → {𝑋, 𝑛} = {𝑋, 𝑁})
87sseq1d 3962 . . . . . . . 8 (𝑛 = 𝑁 → ({𝑋, 𝑛} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ 𝑒))
98rexbidv 3157 . . . . . . 7 (𝑛 = 𝑁 → (∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒 ↔ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
109elrab 3643 . . . . . 6 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ (𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
11 eldifsn 4739 . . . . . . 7 (𝑁 ∈ (𝑉 ∖ {𝑋}) ↔ (𝑁𝑉𝑁𝑋))
1211anbi1i 624 . . . . . 6 ((𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
1310, 12bitri 275 . . . . 5 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
146, 13bitrdi 287 . . . 4 (𝑋𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
1514pm5.32i 574 . . 3 ((𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ (𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
16 df-3an 1088 . . . 4 (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
17 anass 468 . . . . . 6 (((𝑋𝑉𝑁𝑉) ∧ 𝑁𝑋) ↔ (𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)))
18 ancom 460 . . . . . . 7 ((𝑋𝑉𝑁𝑉) ↔ (𝑁𝑉𝑋𝑉))
1918anbi1i 624 . . . . . 6 (((𝑋𝑉𝑁𝑉) ∧ 𝑁𝑋) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋))
2017, 19bitr3i 277 . . . . 5 ((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋))
2120anbi1i 624 . . . 4 (((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
22 anass 468 . . . 4 (((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
2316, 21, 223bitr2ri 300 . . 3 ((𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
2415, 23bitri 275 . 2 ((𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
253, 24bitri 275 1 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  wne 2929  wrex 3057  {crab 3396  cdif 3895  wss 3898  {csn 4577  {cpr 4579  cfv 6489  (class class class)co 7355  Vtxcvtx 28995  Edgcedg 29046   NeighbVtx cnbgr 29331
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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374  ax-un 7677
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 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-1st 7930  df-2nd 7931  df-nbgr 29332
This theorem is referenced by:  nbgrisvtx  29340  nbgr2vtx1edg  29349  nbuhgr2vtx1edgblem  29350  nbuhgr2vtx1edgb  29351  nbgrsym  29362  isuvtx  29394  iscplgredg  29416  cusgrexi  29442  structtocusgr  29445  dfvopnbgr2  48015
  Copyright terms: Public domain W3C validator