Metamath Proof Explorer


Theorem gpg3nbgrvtx1

Description: In a generalized Petersen graph G , every inside vertex has exactly three (different) neighbors. (Contributed by AV, 3-Sep-2025) (Proof shortened by AV, 22-Nov-2025)

Ref Expression
Hypotheses gpgnbgr.j ⊢ J = 1 ..^ N 2
gpgnbgr.g No typesetting found for |- G = ( N gPetersenGr K ) with typecode |-
gpgnbgr.v ⊢ V = Vtx ⁡ G
gpgnbgr.u ⊢ U = G NeighbVtx X
Assertion gpg3nbgrvtx1 ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → U = 3

Proof

Step Hyp Ref Expression
1 gpgnbgr.j ⊢ J = 1 ..^ N 2
2 gpgnbgr.g Could not format G = ( N gPetersenGr K ) : No typesetting found for |- G = ( N gPetersenGr K ) with typecode |-
3 gpgnbgr.v ⊢ V = Vtx ⁡ G
4 gpgnbgr.u ⊢ U = G NeighbVtx X
5 1 2 3 4 gpgnbgrvtx1 ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → U = 1 2 nd ⁡ X + K mod N 0 2 nd ⁡ X 1 2 nd ⁡ X − K mod N
6 5 fveq2d ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → U = 1 2 nd ⁡ X + K mod N 0 2 nd ⁡ X 1 2 nd ⁡ X − K mod N
7 ax-1ne0 ⊢ 1 ≠ 0
8 7 a1i ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 ≠ 0
9 8 orcd ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 ≠ 0 ∨ 2 nd ⁡ X + K mod N ≠ 2 nd ⁡ X
10 1ex ⊢ 1 ∈ V
11 ovex ⊢ 2 nd ⁡ X + K mod N ∈ V
12 10 11 opthne ⊢ 1 2 nd ⁡ X + K mod N ≠ 0 2 nd ⁡ X ↔ 1 ≠ 0 ∨ 2 nd ⁡ X + K mod N ≠ 2 nd ⁡ X
13 9 12 sylibr ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 2 nd ⁡ X + K mod N ≠ 0 2 nd ⁡ X
14 0ne1 ⊢ 0 ≠ 1
15 14 a1i ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 0 ≠ 1
16 15 orcd ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 0 ≠ 1 ∨ 2 nd ⁡ X ≠ 2 nd ⁡ X − K mod N
17 c0ex ⊢ 0 ∈ V
18 fvex ⊢ 2 nd ⁡ X ∈ V
19 17 18 opthne ⊢ 0 2 nd ⁡ X ≠ 1 2 nd ⁡ X − K mod N ↔ 0 ≠ 1 ∨ 2 nd ⁡ X ≠ 2 nd ⁡ X − K mod N
20 16 19 sylibr ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 0 2 nd ⁡ X ≠ 1 2 nd ⁡ X − K mod N
21 simpll ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → N ∈ ℤ ≥ 3
22 eqid ⊢ 0 ..^ N = 0 ..^ N
23 22 1 2 3 gpgvtxel2 ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V → 2 nd ⁡ X ∈ 0 ..^ N
24 23 adantrr ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 2 nd ⁡ X ∈ 0 ..^ N
25 simplr ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → K ∈ J
26 1 22 modmknepk ⊢ N ∈ ℤ ≥ 3 ∧ 2 nd ⁡ X ∈ 0 ..^ N ∧ K ∈ J → 2 nd ⁡ X − K mod N ≠ 2 nd ⁡ X + K mod N
27 21 24 25 26 syl3anc ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 2 nd ⁡ X − K mod N ≠ 2 nd ⁡ X + K mod N
28 27 olcd ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 ≠ 1 ∨ 2 nd ⁡ X − K mod N ≠ 2 nd ⁡ X + K mod N
29 ovex ⊢ 2 nd ⁡ X − K mod N ∈ V
30 10 29 opthne ⊢ 1 2 nd ⁡ X − K mod N ≠ 1 2 nd ⁡ X + K mod N ↔ 1 ≠ 1 ∨ 2 nd ⁡ X − K mod N ≠ 2 nd ⁡ X + K mod N
31 28 30 sylibr ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 2 nd ⁡ X − K mod N ≠ 1 2 nd ⁡ X + K mod N
32 13 20 31 3jca ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 2 nd ⁡ X + K mod N ≠ 0 2 nd ⁡ X ∧ 0 2 nd ⁡ X ≠ 1 2 nd ⁡ X − K mod N ∧ 1 2 nd ⁡ X − K mod N ≠ 1 2 nd ⁡ X + K mod N
33 opex ⊢ 1 2 nd ⁡ X + K mod N ∈ V
34 opex ⊢ 0 2 nd ⁡ X ∈ V
35 opex ⊢ 1 2 nd ⁡ X − K mod N ∈ V
36 hashtpg ⊢ 1 2 nd ⁡ X + K mod N ∈ V ∧ 0 2 nd ⁡ X ∈ V ∧ 1 2 nd ⁡ X − K mod N ∈ V → 1 2 nd ⁡ X + K mod N ≠ 0 2 nd ⁡ X ∧ 0 2 nd ⁡ X ≠ 1 2 nd ⁡ X − K mod N ∧ 1 2 nd ⁡ X − K mod N ≠ 1 2 nd ⁡ X + K mod N ↔ 1 2 nd ⁡ X + K mod N 0 2 nd ⁡ X 1 2 nd ⁡ X − K mod N = 3
37 33 34 35 36 mp3an ⊢ 1 2 nd ⁡ X + K mod N ≠ 0 2 nd ⁡ X ∧ 0 2 nd ⁡ X ≠ 1 2 nd ⁡ X − K mod N ∧ 1 2 nd ⁡ X − K mod N ≠ 1 2 nd ⁡ X + K mod N ↔ 1 2 nd ⁡ X + K mod N 0 2 nd ⁡ X 1 2 nd ⁡ X − K mod N = 3
38 32 37 sylib ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → 1 2 nd ⁡ X + K mod N 0 2 nd ⁡ X 1 2 nd ⁡ X − K mod N = 3
39 6 38 eqtrd ⊢ N ∈ ℤ ≥ 3 ∧ K ∈ J ∧ X ∈ V ∧ 1 st ⁡ X = 1 → U = 3