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

Theorem nbgrel 27382
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 27377 . . 3 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) → 𝑋𝑉)
32pm4.71ri 564 . 2 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ (𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)))
4 nbgrel.e . . . . . . 7 𝐸 = (Edg‘𝐺)
51, 4nbgrval 27378 . . . . . 6 (𝑋𝑉 → (𝐺 NeighbVtx 𝑋) = {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒})
65eleq2d 2816 . . . . 5 (𝑋𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ 𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒}))
7 preq2 4636 . . . . . . . . 9 (𝑛 = 𝑁 → {𝑋, 𝑛} = {𝑋, 𝑁})
87sseq1d 3918 . . . . . . . 8 (𝑛 = 𝑁 → ({𝑋, 𝑛} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ 𝑒))
98rexbidv 3206 . . . . . . 7 (𝑛 = 𝑁 → (∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒 ↔ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
109elrab 3591 . . . . . 6 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ (𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
11 eldifsn 4686 . . . . . . 7 (𝑁 ∈ (𝑉 ∖ {𝑋}) ↔ (𝑁𝑉𝑁𝑋))
1211anbi1i 627 . . . . . 6 ((𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
1310, 12bitri 278 . . . . 5 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
146, 13bitrdi 290 . . . 4 (𝑋𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
1514pm5.32i 578 . . 3 ((𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ (𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
16 df-3an 1091 . . . 4 (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
17 anass 472 . . . . . 6 (((𝑋𝑉𝑁𝑉) ∧ 𝑁𝑋) ↔ (𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)))
18 ancom 464 . . . . . . 7 ((𝑋𝑉𝑁𝑉) ↔ (𝑁𝑉𝑋𝑉))
1918anbi1i 627 . . . . . 6 (((𝑋𝑉𝑁𝑉) ∧ 𝑁𝑋) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋))
2017, 19bitr3i 280 . . . . 5 ((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋))
2120anbi1i 627 . . . 4 (((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
22 anass 472 . . . 4 (((𝑋𝑉 ∧ (𝑁𝑉𝑁𝑋)) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
2316, 21, 223bitr2ri 303 . . 3 ((𝑋𝑉 ∧ ((𝑁𝑉𝑁𝑋) ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
2415, 23bitri 278 . 2 ((𝑋𝑉𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
253, 24bitri 278 1 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁𝑉𝑋𝑉) ∧ 𝑁𝑋 ∧ ∃𝑒𝐸 {𝑋, 𝑁} ⊆ 𝑒))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399  w3a 1089   = wceq 1543  wcel 2112  wne 2932  wrex 3052  {crab 3055  cdif 3850  wss 3853  {csn 4527  {cpr 4529  cfv 6358  (class class class)co 7191  Vtxcvtx 27041  Edgcedg 27092   NeighbVtx cnbgr 27374
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307  ax-un 7501
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-iun 4892  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fv 6366  df-ov 7194  df-oprab 7195  df-mpo 7196  df-1st 7739  df-2nd 7740  df-nbgr 27375
This theorem is referenced by:  nbgrisvtx  27383  nbgr2vtx1edg  27392  nbuhgr2vtx1edgblem  27393  nbuhgr2vtx1edgb  27394  nbgrsym  27405  isuvtx  27437  iscplgredg  27459  cusgrexi  27485  structtocusgr  27488
  Copyright terms: Public domain W3C validator