Theorem gpgedgiov 48227

Description: The edges of the generalized Petersen graph GPG(N,K) between an inside and an outside vertex. (Contributed by AV, 11-Nov-2025.)

Hypotheses

Ref	Expression
gpgedgiov.j	⊢ 𝐽 = (1..^(⌈‘(𝑁 / 2)))
gpgedgiov.i	⊢ 𝐼 = (0..^𝑁)
gpgedgiov.g	⊢ 𝐺 = (𝑁 gPetersenGr 𝐾)
gpgedgiov.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
gpgedgiov	⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) → ({⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸 ↔ 𝑋 = 𝑌))

Proof of Theorem gpgedgiov

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 766	. . . . 5 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸) → (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽))
2		c0ex 11117	. . . . . . . . . 10 ⊢ 0 ∈ V
3	2	a1i 11	. . . . . . . . 9 ⊢ (𝑌 ∈ 𝐼 → 0 ∈ V)
4	3	anim1i 615	. . . . . . . 8 ⊢ ((𝑌 ∈ 𝐼 ∧ 𝑋 ∈ 𝐼) → (0 ∈ V ∧ 𝑋 ∈ 𝐼))
5	4	ancoms 458	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (0 ∈ V ∧ 𝑋 ∈ 𝐼))
6		op1stg 7942	. . . . . . 7 ⊢ ((0 ∈ V ∧ 𝑋 ∈ 𝐼) → (1st ‘⟨0, 𝑋⟩) = 0)
7	5, 6	syl 17	. . . . . 6 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (1st ‘⟨0, 𝑋⟩) = 0)
8	7	ad2antlr 727	. . . . 5 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸) → (1st ‘⟨0, 𝑋⟩) = 0)
9		simpr 484	. . . . 5 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸) → {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸)
10		gpgedgiov.j	. . . . . 6 ⊢ 𝐽 = (1..^(⌈‘(𝑁 / 2)))
11		gpgedgiov.g	. . . . . 6 ⊢ 𝐺 = (𝑁 gPetersenGr 𝐾)
12		eqid 2733	. . . . . 6 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺)
13		gpgedgiov.e	. . . . . 6 ⊢ 𝐸 = (Edg‘𝐺)
14	10, 11, 12, 13	gpgvtxedg0 48225	. . . . 5 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (1st ‘⟨0, 𝑋⟩) = 0 ∧ {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸) → (⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩))
15	1, 8, 9, 14	syl3anc 1373	. . . 4 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸) → (⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩))
16	15	ex 412	. . 3 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) → ({⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸 → (⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩)))
17		ovex 7388	. . . . . . . . 9 ⊢ ((𝑋 + 1) mod 𝑁) ∈ V
18	2, 17	pm3.2i 470	. . . . . . . 8 ⊢ (0 ∈ V ∧ ((𝑋 + 1) mod 𝑁) ∈ V)
19		opthg2 5424	. . . . . . . 8 ⊢ ((0 ∈ V ∧ ((𝑋 + 1) mod 𝑁) ∈ V) → (⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ ↔ (1 = 0 ∧ 𝑌 = ((𝑋 + 1) mod 𝑁))))
20	18, 19	mp1i 13	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ ↔ (1 = 0 ∧ 𝑌 = ((𝑋 + 1) mod 𝑁))))
21		ax-1ne0 11086	. . . . . . . . 9 ⊢ 1 ≠ 0
22		eqneqall 2940	. . . . . . . . 9 ⊢ (1 = 0 → (1 ≠ 0 → (𝑌 = ((𝑋 + 1) mod 𝑁) → 𝑋 = 𝑌)))
23	21, 22	mpi 20	. . . . . . . 8 ⊢ (1 = 0 → (𝑌 = ((𝑋 + 1) mod 𝑁) → 𝑋 = 𝑌))
24	23	imp 406	. . . . . . 7 ⊢ ((1 = 0 ∧ 𝑌 = ((𝑋 + 1) mod 𝑁)) → 𝑋 = 𝑌)
25	20, 24	biimtrdi 253	. . . . . 6 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ → 𝑋 = 𝑌))
26		1ex 11119	. . . . . . . . . . 11 ⊢ 1 ∈ V
27	26	a1i 11	. . . . . . . . . 10 ⊢ (𝑌 ∈ 𝐼 → 1 ∈ V)
28	27	anim1i 615	. . . . . . . . 9 ⊢ ((𝑌 ∈ 𝐼 ∧ 𝑋 ∈ 𝐼) → (1 ∈ V ∧ 𝑋 ∈ 𝐼))
29	28	ancoms 458	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (1 ∈ V ∧ 𝑋 ∈ 𝐼))
30		opthg2 5424	. . . . . . . 8 ⊢ ((1 ∈ V ∧ 𝑋 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ ↔ (1 = 1 ∧ 𝑌 = 𝑋)))
31	29, 30	syl 17	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ ↔ (1 = 1 ∧ 𝑌 = 𝑋)))
32		simpr 484	. . . . . . . 8 ⊢ ((1 = 1 ∧ 𝑌 = 𝑋) → 𝑌 = 𝑋)
33	32	eqcomd 2739	. . . . . . 7 ⊢ ((1 = 1 ∧ 𝑌 = 𝑋) → 𝑋 = 𝑌)
34	31, 33	biimtrdi 253	. . . . . 6 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ → 𝑋 = 𝑌))
35		ovex 7388	. . . . . . . . 9 ⊢ ((𝑋 − 1) mod 𝑁) ∈ V
36	2, 35	pm3.2i 470	. . . . . . . 8 ⊢ (0 ∈ V ∧ ((𝑋 − 1) mod 𝑁) ∈ V)
37		opthg2 5424	. . . . . . . 8 ⊢ ((0 ∈ V ∧ ((𝑋 − 1) mod 𝑁) ∈ V) → (⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩ ↔ (1 = 0 ∧ 𝑌 = ((𝑋 − 1) mod 𝑁))))
38	36, 37	mp1i 13	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩ ↔ (1 = 0 ∧ 𝑌 = ((𝑋 − 1) mod 𝑁))))
39		eqneqall 2940	. . . . . . . . 9 ⊢ (1 = 0 → (1 ≠ 0 → (𝑌 = ((𝑋 − 1) mod 𝑁) → 𝑋 = 𝑌)))
40	21, 39	mpi 20	. . . . . . . 8 ⊢ (1 = 0 → (𝑌 = ((𝑋 − 1) mod 𝑁) → 𝑋 = 𝑌))
41	40	imp 406	. . . . . . 7 ⊢ ((1 = 0 ∧ 𝑌 = ((𝑋 − 1) mod 𝑁)) → 𝑋 = 𝑌)
42	38, 41	biimtrdi 253	. . . . . 6 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩ → 𝑋 = 𝑌))
43	25, 34, 42	3jaod 1431	. . . . 5 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → ((⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩) → 𝑋 = 𝑌))
44		op2ndg 7943	. . . . . . 7 ⊢ ((0 ∈ V ∧ 𝑋 ∈ 𝐼) → (2nd ‘⟨0, 𝑋⟩) = 𝑋)
45	5, 44	syl 17	. . . . . 6 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (2nd ‘⟨0, 𝑋⟩) = 𝑋)
46		oveq1 7362	. . . . . . . . . . 11 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → ((2nd ‘⟨0, 𝑋⟩) + 1) = (𝑋 + 1))
47	46	oveq1d 7370	. . . . . . . . . 10 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁) = ((𝑋 + 1) mod 𝑁))
48	47	opeq2d 4833	. . . . . . . . 9 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩)
49	48	eqeq2d 2744	. . . . . . . 8 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → (⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ↔ ⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩))
50		opeq2 4827	. . . . . . . . 9 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ = ⟨1, 𝑋⟩)
51	50	eqeq2d 2744	. . . . . . . 8 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → (⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ↔ ⟨1, 𝑌⟩ = ⟨1, 𝑋⟩))
52		oveq1 7362	. . . . . . . . . . 11 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → ((2nd ‘⟨0, 𝑋⟩) − 1) = (𝑋 − 1))
53	52	oveq1d 7370	. . . . . . . . . 10 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁) = ((𝑋 − 1) mod 𝑁))
54	53	opeq2d 4833	. . . . . . . . 9 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩)
55	54	eqeq2d 2744	. . . . . . . 8 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → (⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩ ↔ ⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩))
56	49, 51, 55	3orbi123d 1437	. . . . . . 7 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → ((⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩) ↔ (⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩)))
57	56	imbi1d 341	. . . . . 6 ⊢ ((2nd ‘⟨0, 𝑋⟩) = 𝑋 → (((⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩) → 𝑋 = 𝑌) ↔ ((⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩) → 𝑋 = 𝑌)))
58	45, 57	syl 17	. . . . 5 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → (((⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩) → 𝑋 = 𝑌) ↔ ((⟨1, 𝑌⟩ = ⟨0, ((𝑋 + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, 𝑋⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, ((𝑋 − 1) mod 𝑁)⟩) → 𝑋 = 𝑌)))
59	43, 58	mpbird 257	. . . 4 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → ((⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩) → 𝑋 = 𝑌))
60	59	adantl 481	. . 3 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) → ((⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) + 1) mod 𝑁)⟩ ∨ ⟨1, 𝑌⟩ = ⟨1, (2nd ‘⟨0, 𝑋⟩)⟩ ∨ ⟨1, 𝑌⟩ = ⟨0, (((2nd ‘⟨0, 𝑋⟩) − 1) mod 𝑁)⟩) → 𝑋 = 𝑌))
61	16, 60	syld 47	. 2 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) → ({⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸 → 𝑋 = 𝑌))
62		simpr 484	. . . . . . 7 ⊢ ((𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼) → 𝑌 ∈ 𝐼)
63	62	ad2antlr 727	. . . . . 6 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → 𝑌 ∈ 𝐼)
64		opeq2 4827	. . . . . . . . . 10 ⊢ (𝑥 = 𝑌 → ⟨0, 𝑥⟩ = ⟨0, 𝑌⟩)
65		oveq1 7362	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑌 → (𝑥 + 1) = (𝑌 + 1))
66	65	oveq1d 7370	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑌 → ((𝑥 + 1) mod 𝑁) = ((𝑌 + 1) mod 𝑁))
67	66	opeq2d 4833	. . . . . . . . . 10 ⊢ (𝑥 = 𝑌 → ⟨0, ((𝑥 + 1) mod 𝑁)⟩ = ⟨0, ((𝑌 + 1) mod 𝑁)⟩)
68	64, 67	preq12d 4695	. . . . . . . . 9 ⊢ (𝑥 = 𝑌 → {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} = {⟨0, 𝑌⟩, ⟨0, ((𝑌 + 1) mod 𝑁)⟩})
69	68	eqeq2d 2744	. . . . . . . 8 ⊢ (𝑥 = 𝑌 → ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ↔ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨0, ((𝑌 + 1) mod 𝑁)⟩}))
70		opeq2 4827	. . . . . . . . . 10 ⊢ (𝑥 = 𝑌 → ⟨1, 𝑥⟩ = ⟨1, 𝑌⟩)
71	64, 70	preq12d 4695	. . . . . . . . 9 ⊢ (𝑥 = 𝑌 → {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩})
72	71	eqeq2d 2744	. . . . . . . 8 ⊢ (𝑥 = 𝑌 → ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ↔ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩}))
73		oveq1 7362	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑌 → (𝑥 + 𝐾) = (𝑌 + 𝐾))
74	73	oveq1d 7370	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑌 → ((𝑥 + 𝐾) mod 𝑁) = ((𝑌 + 𝐾) mod 𝑁))
75	74	opeq2d 4833	. . . . . . . . . 10 ⊢ (𝑥 = 𝑌 → ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩ = ⟨1, ((𝑌 + 𝐾) mod 𝑁)⟩)
76	70, 75	preq12d 4695	. . . . . . . . 9 ⊢ (𝑥 = 𝑌 → {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩} = {⟨1, 𝑌⟩, ⟨1, ((𝑌 + 𝐾) mod 𝑁)⟩})
77	76	eqeq2d 2744	. . . . . . . 8 ⊢ (𝑥 = 𝑌 → ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩} ↔ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑌⟩, ⟨1, ((𝑌 + 𝐾) mod 𝑁)⟩}))
78	69, 72, 77	3orbi123d 1437	. . . . . . 7 ⊢ (𝑥 = 𝑌 → (({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩}) ↔ ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨0, ((𝑌 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑌⟩, ⟨1, ((𝑌 + 𝐾) mod 𝑁)⟩})))
79	78	adantl 481	. . . . . 6 ⊢ (((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) ∧ 𝑥 = 𝑌) → (({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩}) ↔ ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨0, ((𝑌 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑌⟩, ⟨1, ((𝑌 + 𝐾) mod 𝑁)⟩})))
80		eqidd 2734	. . . . . . 7 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩})
81	80	3mix2d 1338	. . . . . 6 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨0, ((𝑌 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑌⟩, ⟨1, ((𝑌 + 𝐾) mod 𝑁)⟩}))
82	63, 79, 81	rspcedvd 3575	. . . . 5 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → ∃𝑥 ∈ 𝐼 ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩}))
83		gpgedgiov.i	. . . . . . 7 ⊢ 𝐼 = (0..^𝑁)
84	83, 10, 11, 13	gpgedgel 48212	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) → ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∈ 𝐸 ↔ ∃𝑥 ∈ 𝐼 ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩})))
85	84	ad2antrr 726	. . . . 5 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∈ 𝐸 ↔ ∃𝑥 ∈ 𝐼 ({⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 𝐾) mod 𝑁)⟩})))
86	82, 85	mpbird 257	. . . 4 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∈ 𝐸)
87		opeq2 4827	. . . . . . 7 ⊢ (𝑋 = 𝑌 → ⟨0, 𝑋⟩ = ⟨0, 𝑌⟩)
88	87	preq1d 4693	. . . . . 6 ⊢ (𝑋 = 𝑌 → {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} = {⟨0, 𝑌⟩, ⟨1, 𝑌⟩})
89	88	eleq1d 2818	. . . . 5 ⊢ (𝑋 = 𝑌 → ({⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸 ↔ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∈ 𝐸))
90	89	adantl 481	. . . 4 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → ({⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸 ↔ {⟨0, 𝑌⟩, ⟨1, 𝑌⟩} ∈ 𝐸))
91	86, 90	mpbird 257	. . 3 ⊢ ((((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) ∧ 𝑋 = 𝑌) → {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸)
92	91	ex 412	. 2 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) → (𝑋 = 𝑌 → {⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸))
93	61, 92	impbid 212	1 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝐼 ∧ 𝑌 ∈ 𝐼)) → ({⟨0, 𝑋⟩, ⟨1, 𝑌⟩} ∈ 𝐸 ↔ 𝑋 = 𝑌))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ w3o 1085   = wceq 1541   ∈ wcel 2113   ≠ wne 2929  ∃wrex 3057  Vcvv 3437  {cpr 4579  ⟨cop 4583  ‘cfv 6489  (class class class)co 7355  1^st c1st 7928  2^nd c2nd 7929  0cc0 11017  1c1 11018   + caddc 11020   − cmin 11355   / cdiv 11785  2c2 12191  3c3 12192  ℤ_≥cuz 12742  ..^cfzo 13561  ⌈cceil 13702   mod cmo 13780  Vtxcvtx 28995  Edgcedg 29046   gPetersenGr cgpg 48202

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-mulcom 11081  ax-addass 11082  ax-mulass 11083  ax-distr 11084  ax-i2m1 11085  ax-1ne0 11086  ax-1rid 11087  ax-rnegex 11088  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092  ax-pre-ltadd 11093  ax-pre-mulgt0 11094  ax-pre-sup 11095

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-oadd 8398  df-er 8631  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-sup 9337  df-inf 9338  df-dju 9805  df-card 9843  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-sub 11357  df-neg 11358  df-div 11786  df-nn 12137  df-2 12199  df-3 12200  df-4 12201  df-5 12202  df-6 12203  df-7 12204  df-8 12205  df-9 12206  df-n0 12393  df-xnn0 12466  df-z 12480  df-dec 12599  df-uz 12743  df-rp 12897  df-fz 13415  df-fzo 13562  df-fl 13703  df-ceil 13704  df-mod 13781  df-hash 14245  df-dvds 16171  df-struct 17065  df-slot 17100  df-ndx 17112  df-base 17128  df-edgf 28988  df-vtx 28997  df-iedg 28998  df-edg 29047  df-umgr 29082  df-usgr 29150  df-gpg 48203

This theorem is referenced by:  pgnbgreunbgrlem1  48275  pgnbgreunbgrlem4  48281