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

Theorem nbgrel 29375
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 29370 . . 3 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) → 𝑋𝑉)
32pm4.71ri 560 . 2 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ (𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)))
4 nbgrel.e . . . . . . 7 𝐸 = (Edg‘𝐺)
51, 4nbgrval 29371 . . . . . 6 (𝑋𝑉 → (𝐺 NeighbVtx 𝑋) = {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒})
65eleq2d 2830 . . . . 5 (𝑋𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ 𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒}))
7 preq2 4759 . . . . . . . . 9 (𝑛 = 𝑁 → {𝑋, 𝑛} = {𝑋, 𝑁})
87sseq1d 4040 . . . . . . . 8 (𝑛 = 𝑁 → ({𝑋, 𝑛} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ 𝑒))
98rexbidv 3185 . . . . . . 7 (𝑛 = 𝑁 → (∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒 ↔ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
109elrab 3708 . . . . . 6 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ (𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
11 eldifsn 4811 . . . . . . 7 (𝑁 ∈ (𝑉 ∖ {𝑋}) ↔ (𝑁𝑉𝑁𝑋))
1211anbi1i 623 . . . . . 6 ((𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
1310, 12bitri 275 . . . . 5 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
146, 13bitrdi 287 . . . 4 (𝑋𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
1514pm5.32i 574 . . 3 ((𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ (𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
16 df-3an 1089 . . . 4 (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
17 anass 468 . . . . . 6 (((𝑋𝑉𝑁𝑉) ∧ 𝑁𝑋) ↔ (𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)))
18 ancom 460 . . . . . . 7 ((𝑋𝑉𝑁𝑉) ↔ (𝑁𝑉𝑋𝑉))
1918anbi1i 623 . . . . . 6 (((𝑋𝑉𝑁𝑉) ∧ 𝑁𝑋) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋))
2017, 19bitr3i 277 . . . . 5 ((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋))
2120anbi1i 623 . . . 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 1087   = wceq 1537  wcel 2108  wne 2946  wrex 3076  {crab 3443  cdif 3973  wss 3976  {csn 4648  {cpr 4650  cfv 6573  (class class class)co 7448  Vtxcvtx 29031  Edgcedg 29082   NeighbVtx cnbgr 29367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1st 8030  df-2nd 8031  df-nbgr 29368
This theorem is referenced by:  nbgrisvtx  29376  nbgr2vtx1edg  29385  nbuhgr2vtx1edgblem  29386  nbuhgr2vtx1edgb  29387  nbgrsym  29398  isuvtx  29430  iscplgredg  29452  cusgrexi  29478  structtocusgr  29481  dfvopnbgr2  47725
  Copyright terms: Public domain W3C validator