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

Theorem nbgrel 29978
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 29973 . . 3 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) → 𝑋 ∈ 𝑉)
32pm4.71ri 570 . 2 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ (𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (𝐺 NeighbVtx 𝑋)))
4 nbgrel.e . . . . . . 7 𝐸 = (Edg‘𝐺)
51, 4nbgrval 29974 . . . . . 6 (𝑋 ∈ 𝑉 → (𝐺 NeighbVtx 𝑋) = {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒 ∈ 𝐸 {𝑋, 𝑛} ⊆ 𝑒})
65eleq2d 2850 . . . . 5 (𝑋 ∈ 𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ 𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒 ∈ 𝐸 {𝑋, 𝑛} ⊆ 𝑒}))
7 preq2 4697 . . . . . . . . 9 (𝑛 = 𝑁 → {𝑋, 𝑛} = {𝑋, 𝑁})
87sseq1d 3944 . . . . . . . 8 (𝑛 = 𝑁 → ({𝑋, 𝑛} ⊆ 𝑒 ↔ {𝑋, 𝑁} ⊆ 𝑒))
98rexbidv 3190 . . . . . . 7 (𝑛 = 𝑁 → (∃𝑒 ∈ 𝐸 {𝑋, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
109elrab 3648 . . . . . 6 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒 ∈ 𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ (𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
11 eldifsn 4750 . . . . . . 7 (𝑁 ∈ (𝑉 ∖ {𝑋}) ↔ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋))
1211anbi1i 636 . . . . . 6 ((𝑁 ∈ (𝑉 ∖ {𝑋}) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
1310, 12bitri 278 . . . . 5 (𝑁 ∈ {𝑛 ∈ (𝑉 ∖ {𝑋}) ∣ ∃𝑒 ∈ 𝐸 {𝑋, 𝑛} ⊆ 𝑒} ↔ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
146, 13bitrdi 290 . . . 4 (𝑋 ∈ 𝑉 → (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
1514pm5.32i 585 . . 3 ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ (𝑋 ∈ 𝑉 ∧ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
16 df-3an 1105 . . . 4 (((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋 ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
17 anass 474 . . . . . 6 (((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋) ↔ (𝑋 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋)))
18 ancom 466 . . . . . . 7 ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ↔ (𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉))
1918anbi1i 636 . . . . . 6 (((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋))
2017, 19bitr3i 280 . . . . 5 ((𝑋 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋)) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋))
2120anbi1i 636 . . . 4 (((𝑋 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋)) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
22 anass 474 . . . 4 (((𝑋 ∈ 𝑉 ∧ (𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋)) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒) ↔ (𝑋 ∈ 𝑉 ∧ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)))
2316, 21, 223bitr2ri 303 . . 3 ((𝑋 ∈ 𝑉 ∧ ((𝑁 ∈ 𝑉 ∧ 𝑁 ≠ 𝑋) ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒)) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋 ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
2415, 23bitri 278 . 2 ((𝑋 ∈ 𝑉 ∧ 𝑁 ∈ (𝐺 NeighbVtx 𝑋)) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋 ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
253, 24bitri 278 1 (𝑁 ∈ (𝐺 NeighbVtx 𝑋) ↔ ((𝑁 ∈ 𝑉 ∧ 𝑋 ∈ 𝑉) ∧ 𝑁 ≠ 𝑋 ∧ ∃𝑒 ∈ 𝐸 {𝑋, 𝑁} ⊆ 𝑒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090  {crab 3416   ⊆ wss 3900   ∖ cdif 4048  {csn 4588  {cpr 4590  ‘cfv 6566  (class class class)co 7451  Vtxcvtx 29631  Edgcedg 29682   NeighbVtx cnbgr 29970
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-nbgr 29971
This theorem is used by:  nbgrisvtx  29979  nbgr2vtx1edg  29988  nbuhgr2vtx1edgblem  29989  nbuhgr2vtx1edgb  29990  nbgrsym  30001  isuvtx  30033  iscplgredg  30055  cusgrexi  30081  structtocusgr  30084  dfvopnbgr2  49224
  Copyright terms: Public domain W3C validator