Metamath Proof Explorer


Theorem gpgvtx1

Description: The inside vertices in a generalized Petersen graph G . (Contributed by AV, 28-Aug-2025)

Ref Expression
Hypotheses gpgvtx0.j J = 1 ..^ N 2
gpgvtx0.g No typesetting found for |- G = ( N gPetersenGr K ) with typecode |-
gpgvtx0.v V = Vtx G
Assertion gpgvtx1 N 3 K J X V 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V

Proof

Step Hyp Ref Expression
1 gpgvtx0.j J = 1 ..^ N 2
2 gpgvtx0.g Could not format G = ( N gPetersenGr K ) : No typesetting found for |- G = ( N gPetersenGr K ) with typecode |-
3 gpgvtx0.v V = Vtx G
4 eqid 0 ..^ N = 0 ..^ N
5 4 1 2 3 gpgvtxel N 3 K J X V x 0 1 y 0 ..^ N X = x y
6 2 fveq2i Could not format ( Vtx ` G ) = ( Vtx ` ( N gPetersenGr K ) ) : No typesetting found for |- ( Vtx ` G ) = ( Vtx ` ( N gPetersenGr K ) ) with typecode |-
7 3 6 eqtri Could not format V = ( Vtx ` ( N gPetersenGr K ) ) : No typesetting found for |- V = ( Vtx ` ( N gPetersenGr K ) ) with typecode |-
8 eluz3nn N 3 N
9 1 4 gpgvtx Could not format ( ( N e. NN /\ K e. J ) -> ( Vtx ` ( N gPetersenGr K ) ) = ( { 0 , 1 } X. ( 0 ..^ N ) ) ) : No typesetting found for |- ( ( N e. NN /\ K e. J ) -> ( Vtx ` ( N gPetersenGr K ) ) = ( { 0 , 1 } X. ( 0 ..^ N ) ) ) with typecode |-
10 8 9 sylan Could not format ( ( N e. ( ZZ>= ` 3 ) /\ K e. J ) -> ( Vtx ` ( N gPetersenGr K ) ) = ( { 0 , 1 } X. ( 0 ..^ N ) ) ) : No typesetting found for |- ( ( N e. ( ZZ>= ` 3 ) /\ K e. J ) -> ( Vtx ` ( N gPetersenGr K ) ) = ( { 0 , 1 } X. ( 0 ..^ N ) ) ) with typecode |-
11 10 adantr Could not format ( ( ( N e. ( ZZ>= ` 3 ) /\ K e. J ) /\ ( x e. { 0 , 1 } /\ y e. ( 0 ..^ N ) ) ) -> ( Vtx ` ( N gPetersenGr K ) ) = ( { 0 , 1 } X. ( 0 ..^ N ) ) ) : No typesetting found for |- ( ( ( N e. ( ZZ>= ` 3 ) /\ K e. J ) /\ ( x e. { 0 , 1 } /\ y e. ( 0 ..^ N ) ) ) -> ( Vtx ` ( N gPetersenGr K ) ) = ( { 0 , 1 } X. ( 0 ..^ N ) ) ) with typecode |-
12 7 11 eqtrid N 3 K J x 0 1 y 0 ..^ N V = 0 1 × 0 ..^ N
13 1elpr01 1 0 1
14 13 a1i N 3 K J x 0 1 y 0 ..^ N 1 0 1
15 elfzoelz y 0 ..^ N y
16 15 adantl x 0 1 y 0 ..^ N y
17 16 adantl N 3 K J x 0 1 y 0 ..^ N y
18 elfzoelz K 1 ..^ N 2 K
19 18 1 eleq2s K J K
20 19 adantl N 3 K J K
21 20 adantr N 3 K J x 0 1 y 0 ..^ N K
22 17 21 zaddcld N 3 K J x 0 1 y 0 ..^ N y + K
23 8 adantr N 3 K J N
24 23 adantr N 3 K J x 0 1 y 0 ..^ N N
25 zmodfzo y + K N y + K mod N 0 ..^ N
26 22 24 25 syl2anc N 3 K J x 0 1 y 0 ..^ N y + K mod N 0 ..^ N
27 14 26 opelxpd N 3 K J x 0 1 y 0 ..^ N 1 y + K mod N 0 1 × 0 ..^ N
28 simprr N 3 K J x 0 1 y 0 ..^ N y 0 ..^ N
29 14 28 opelxpd N 3 K J x 0 1 y 0 ..^ N 1 y 0 1 × 0 ..^ N
30 17 21 zsubcld N 3 K J x 0 1 y 0 ..^ N y K
31 zmodfzo y K N y K mod N 0 ..^ N
32 30 24 31 syl2anc N 3 K J x 0 1 y 0 ..^ N y K mod N 0 ..^ N
33 14 32 opelxpd N 3 K J x 0 1 y 0 ..^ N 1 y K mod N 0 1 × 0 ..^ N
34 27 29 33 3jca N 3 K J x 0 1 y 0 ..^ N 1 y + K mod N 0 1 × 0 ..^ N 1 y 0 1 × 0 ..^ N 1 y K mod N 0 1 × 0 ..^ N
35 34 adantr N 3 K J x 0 1 y 0 ..^ N V = 0 1 × 0 ..^ N 1 y + K mod N 0 1 × 0 ..^ N 1 y 0 1 × 0 ..^ N 1 y K mod N 0 1 × 0 ..^ N
36 eleq2 V = 0 1 × 0 ..^ N 1 y + K mod N V 1 y + K mod N 0 1 × 0 ..^ N
37 eleq2 V = 0 1 × 0 ..^ N 1 y V 1 y 0 1 × 0 ..^ N
38 eleq2 V = 0 1 × 0 ..^ N 1 y K mod N V 1 y K mod N 0 1 × 0 ..^ N
39 36 37 38 3anbi123d V = 0 1 × 0 ..^ N 1 y + K mod N V 1 y V 1 y K mod N V 1 y + K mod N 0 1 × 0 ..^ N 1 y 0 1 × 0 ..^ N 1 y K mod N 0 1 × 0 ..^ N
40 39 adantl N 3 K J x 0 1 y 0 ..^ N V = 0 1 × 0 ..^ N 1 y + K mod N V 1 y V 1 y K mod N V 1 y + K mod N 0 1 × 0 ..^ N 1 y 0 1 × 0 ..^ N 1 y K mod N 0 1 × 0 ..^ N
41 35 40 mpbird N 3 K J x 0 1 y 0 ..^ N V = 0 1 × 0 ..^ N 1 y + K mod N V 1 y V 1 y K mod N V
42 12 41 mpdan N 3 K J x 0 1 y 0 ..^ N 1 y + K mod N V 1 y V 1 y K mod N V
43 vex x V
44 vex y V
45 43 44 op2ndd X = x y 2 nd X = y
46 oveq1 2 nd X = y 2 nd X + K = y + K
47 46 oveq1d 2 nd X = y 2 nd X + K mod N = y + K mod N
48 47 opeq2d 2 nd X = y 1 2 nd X + K mod N = 1 y + K mod N
49 48 eleq1d 2 nd X = y 1 2 nd X + K mod N V 1 y + K mod N V
50 opeq2 2 nd X = y 1 2 nd X = 1 y
51 50 eleq1d 2 nd X = y 1 2 nd X V 1 y V
52 oveq1 2 nd X = y 2 nd X K = y K
53 52 oveq1d 2 nd X = y 2 nd X K mod N = y K mod N
54 53 opeq2d 2 nd X = y 1 2 nd X K mod N = 1 y K mod N
55 54 eleq1d 2 nd X = y 1 2 nd X K mod N V 1 y K mod N V
56 49 51 55 3anbi123d 2 nd X = y 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V 1 y + K mod N V 1 y V 1 y K mod N V
57 45 56 syl X = x y 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V 1 y + K mod N V 1 y V 1 y K mod N V
58 42 57 syl5ibrcom N 3 K J x 0 1 y 0 ..^ N X = x y 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V
59 58 rexlimdvva N 3 K J x 0 1 y 0 ..^ N X = x y 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V
60 5 59 sylbid N 3 K J X V 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V
61 60 imp N 3 K J X V 1 2 nd X + K mod N V 1 2 nd X V 1 2 nd X K mod N V