Theorem gpg5nbgr3star 48730

Description: In a generalized Petersen graph G(N,K) of order 10 (𝑁 = 5), these are the Petersen graph G(5,2) and the 5-prism G(5,1), every vertex has exactly three (different) neighbors, and none of these neighbors are connected by an edge (i.e., the (closed) neighborhood of every vertex induces a subgraph which is isomorphic to a 3-star). This does not hold for every generalized Petersen graph: for example, in the 3-prism G(3,1) (see gpg31grim3prism TODO) and the Dürer graph G(6,2) there are vertices which have neighborhoods containing triangles. In general, all generalized Petersen graphs G(N,K) with 𝑁 = 3 · 𝐾 contain triangles, see gpg3kgrtriex 48738. (Contributed by AV, 8-Sep-2025.)

Hypotheses

Ref	Expression
gpgnbgr.j	⊢ 𝐽 = (1..^(⌈‘(𝑁 / 2)))
gpgnbgr.g	⊢ 𝐺 = (𝑁 gPetersenGr 𝐾)
gpgnbgr.v	⊢ 𝑉 = (Vtx‘𝐺)
gpgnbgr.u	⊢ 𝑈 = (𝐺 NeighbVtx 𝑋)
gpgnbgr.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
gpg5nbgr3star	⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))

Distinct variable groups:   𝑦,𝐺   𝑦,𝑉   𝑦,𝑋   𝑥,𝐽,𝑦   𝑥,𝐾,𝑦   𝑥,𝑁,𝑦   𝑥,𝑈,𝑦   𝑥,𝑉   𝑥,𝑋   𝑥,𝐸,𝑦

Allowed substitution hint:   𝐺(𝑥)

Proof of Theorem gpg5nbgr3star

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		5eluz3 12903	. . . . . 6 ⊢ 5 ∈ (ℤ≥‘3)
2		eleq1 2857	. . . . . 6 ⊢ (𝑁 = 5 → (𝑁 ∈ (ℤ≥‘3) ↔ 5 ∈ (ℤ≥‘3)))
3	1, 2	mpbiri 261	. . . . 5 ⊢ (𝑁 = 5 → 𝑁 ∈ (ℤ≥‘3))
4	3	anim1i 626	. . . 4 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) → (𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽))
5		eqid 2769	. . . . 5 ⊢ (0..^𝑁) = (0..^𝑁)
6		gpgnbgr.j	. . . . 5 ⊢ 𝐽 = (1..^(⌈‘(𝑁 / 2)))
7		gpgnbgr.g	. . . . 5 ⊢ 𝐺 = (𝑁 gPetersenGr 𝐾)
8		gpgnbgr.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
9	5, 6, 7, 8	gpgvtxel 48696	. . . 4 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) → (𝑋 ∈ 𝑉 ↔ ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^𝑁)𝑋 = ⟨𝑎, 𝑏⟩))
10	4, 9	syl 18	. . 3 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) → (𝑋 ∈ 𝑉 ↔ ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^𝑁)𝑋 = ⟨𝑎, 𝑏⟩))
11	10	biimp3a 1495	. 2 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^𝑁)𝑋 = ⟨𝑎, 𝑏⟩)
12		elpri 4615	. . . . . . 7 ⊢ (𝑎 ∈ {0, 1} → (𝑎 = 0 ∨ 𝑎 = 1))
13		opeq1 4839	. . . . . . . . . . . 12 ⊢ (𝑎 = 0 → ⟨𝑎, 𝑏⟩ = ⟨0, 𝑏⟩)
14	13	eqeq2d 2780	. . . . . . . . . . 11 ⊢ (𝑎 = 0 → (𝑋 = ⟨𝑎, 𝑏⟩ ↔ 𝑋 = ⟨0, 𝑏⟩))
15	14	adantr 485	. . . . . . . . . 10 ⊢ ((𝑎 = 0 ∧ (𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = ⟨𝑎, 𝑏⟩ ↔ 𝑋 = ⟨0, 𝑏⟩))
16		c0ex 11196	. . . . . . . . . . . . 13 ⊢ 0 ∈ V
17		vex 3467	. . . . . . . . . . . . 13 ⊢ 𝑏 ∈ V
18	16, 17	op1std 7992	. . . . . . . . . . . 12 ⊢ (𝑋 = ⟨0, 𝑏⟩ → (1st ‘𝑋) = 0)
19		4z 12624	. . . . . . . . . . . . . . . . 17 ⊢ 4 ∈ ℤ
20		5nn 12323	. . . . . . . . . . . . . . . . . 18 ⊢ 5 ∈ ℕ
21	20	nnzi 12614	. . . . . . . . . . . . . . . . 17 ⊢ 5 ∈ ℤ
22		4re 12321	. . . . . . . . . . . . . . . . . 18 ⊢ 4 ∈ ℝ
23		5re 12324	. . . . . . . . . . . . . . . . . 18 ⊢ 5 ∈ ℝ
24		4lt5 12416	. . . . . . . . . . . . . . . . . 18 ⊢ 4 < 5
25	22, 23, 24	ltleii 11329	. . . . . . . . . . . . . . . . 17 ⊢ 4 ≤ 5
26		eluz2 12864	. . . . . . . . . . . . . . . . 17 ⊢ (5 ∈ (ℤ≥‘4) ↔ (4 ∈ ℤ ∧ 5 ∈ ℤ ∧ 4 ≤ 5))
27	19, 21, 25, 26	mpbir3an 1358	. . . . . . . . . . . . . . . 16 ⊢ 5 ∈ (ℤ≥‘4)
28		eleq1 2857	. . . . . . . . . . . . . . . 16 ⊢ (𝑁 = 5 → (𝑁 ∈ (ℤ≥‘4) ↔ 5 ∈ (ℤ≥‘4)))
29	27, 28	mpbiri 261	. . . . . . . . . . . . . . 15 ⊢ (𝑁 = 5 → 𝑁 ∈ (ℤ≥‘4))
30		gpgnbgr.u	. . . . . . . . . . . . . . . 16 ⊢ 𝑈 = (𝐺 NeighbVtx 𝑋)
31		gpgnbgr.e	. . . . . . . . . . . . . . . 16 ⊢ 𝐸 = (Edg‘𝐺)
32	6, 7, 8, 30, 31	gpg5nbgrvtx03star 48729	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ (ℤ≥‘4) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 0)) → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))
33	29, 32	sylanl1 692	. . . . . . . . . . . . . 14 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 0)) → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))
34	33	exp43 441	. . . . . . . . . . . . 13 ⊢ (𝑁 = 5 → (𝐾 ∈ 𝐽 → (𝑋 ∈ 𝑉 → ((1st ‘𝑋) = 0 → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))))
35	34	3imp 1126	. . . . . . . . . . . 12 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((1st ‘𝑋) = 0 → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
36	18, 35	syl5 35	. . . . . . . . . . 11 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = ⟨0, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
37	36	adantl 486	. . . . . . . . . 10 ⊢ ((𝑎 = 0 ∧ (𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = ⟨0, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
38	15, 37	sylbid 243	. . . . . . . . 9 ⊢ ((𝑎 = 0 ∧ (𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
39	38	ex 417	. . . . . . . 8 ⊢ (𝑎 = 0 → ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))))
40		opeq1 4839	. . . . . . . . . . . 12 ⊢ (𝑎 = 1 → ⟨𝑎, 𝑏⟩ = ⟨1, 𝑏⟩)
41	40	eqeq2d 2780	. . . . . . . . . . 11 ⊢ (𝑎 = 1 → (𝑋 = ⟨𝑎, 𝑏⟩ ↔ 𝑋 = ⟨1, 𝑏⟩))
42	41	adantr 485	. . . . . . . . . 10 ⊢ ((𝑎 = 1 ∧ (𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = ⟨𝑎, 𝑏⟩ ↔ 𝑋 = ⟨1, 𝑏⟩))
43		1ex 11199	. . . . . . . . . . . . 13 ⊢ 1 ∈ V
44	43, 17	op1std 7992	. . . . . . . . . . . 12 ⊢ (𝑋 = ⟨1, 𝑏⟩ → (1st ‘𝑋) = 1)
45	6, 7, 8, 30	gpg3nbgrvtx1 48727	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → (♯‘𝑈) = 3)
46	3, 45	sylanl1 692	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → (♯‘𝑈) = 3)
47		eqid 2769	. . . . . . . . . . . . . . . . . . . 20 ⊢ ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩
48	6	eleq2i 2861	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐾 ∈ 𝐽 ↔ 𝐾 ∈ (1..^(⌈‘(𝑁 / 2))))
49	48	biimpi 219	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐾 ∈ 𝐽 → 𝐾 ∈ (1..^(⌈‘(𝑁 / 2))))
50		gpgusgra 48706	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ (1..^(⌈‘(𝑁 / 2)))) → (𝑁 gPetersenGr 𝐾) ∈ USGraph)
51	7, 50	eqeltrid 2873	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ (1..^(⌈‘(𝑁 / 2)))) → 𝐺 ∈ USGraph)
52	3, 49, 51	syl2an 607	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) → 𝐺 ∈ USGraph)
53	52	adantr 485	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → 𝐺 ∈ USGraph)
54	31	usgredgne 29493	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐺 ∈ USGraph ∧ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∈ 𝐸) → ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ ≠ ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩)
55	54	neneqd 2969	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐺 ∈ USGraph ∧ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∈ 𝐸) → ¬ ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩)
56	55	ex 417	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐺 ∈ USGraph → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∈ 𝐸 → ¬ ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩))
57	53, 56	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∈ 𝐸 → ¬ ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩))
58	47, 57	mt2i 138	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ¬ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∈ 𝐸)
59		df-nel 3071	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ↔ ¬ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∈ 𝐸)
60	58, 59	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸)
61		fvexd 6894	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1) → (2nd ‘𝑋) ∈ V)
62	6, 7, 8, 31	gpg5nbgrvtx13starlem1 48720	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (2nd ‘𝑋) ∈ V) → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸)
63	61, 62	sylan2 604	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸)
64		simpl 487	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1) → 𝑋 ∈ 𝑉)
65	4, 64	anim12i 624	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ 𝑋 ∈ 𝑉))
66	5, 6, 7, 8	gpgvtxel2 48697	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ 𝑋 ∈ 𝑉) → (2nd ‘𝑋) ∈ (0..^𝑁))
67		elfzoelz 13683	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((2nd ‘𝑋) ∈ (0..^𝑁) → (2nd ‘𝑋) ∈ ℤ)
68	65, 66, 67	3syl 19	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → (2nd ‘𝑋) ∈ ℤ)
69	6, 7, 8, 31	gpg5nbgrvtx13starlem2 48721	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (2nd ‘𝑋) ∈ ℤ) → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
70	68, 69	syldan 602	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
71		opex 5443	. . . . . . . . . . . . . . . . . . 19 ⊢ ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ ∈ V
72		opex 5443	. . . . . . . . . . . . . . . . . . 19 ⊢ ⟨0, (2nd ‘𝑋)⟩ ∈ V
73		opex 5443	. . . . . . . . . . . . . . . . . . 19 ⊢ ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ ∈ V
74		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩})
75		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸))
76	74, 75	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸))
77		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨0, (2nd ‘𝑋)⟩ → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩})
78		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
79	77, 78	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨0, (2nd ‘𝑋)⟩ → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
80		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩})
81		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
82	80, 81	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
83	71, 72, 73, 76, 79, 82	raltp 4673	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ ({⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ∧ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸 ∧ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
84	60, 63, 70, 83	syl3anbrc 1360	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸)
85		prcom 4700	. . . . . . . . . . . . . . . . . . . 20 ⊢ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩}
86		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} → ({⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
87	85, 86	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸)
88	63, 87	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸)
89		eqid 2769	. . . . . . . . . . . . . . . . . . . 20 ⊢ ⟨0, (2nd ‘𝑋)⟩ = ⟨0, (2nd ‘𝑋)⟩
90	31	usgredgne 29493	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐺 ∈ USGraph ∧ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∈ 𝐸) → ⟨0, (2nd ‘𝑋)⟩ ≠ ⟨0, (2nd ‘𝑋)⟩)
91	90	neneqd 2969	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐺 ∈ USGraph ∧ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∈ 𝐸) → ¬ ⟨0, (2nd ‘𝑋)⟩ = ⟨0, (2nd ‘𝑋)⟩)
92	91	ex 417	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐺 ∈ USGraph → ({⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∈ 𝐸 → ¬ ⟨0, (2nd ‘𝑋)⟩ = ⟨0, (2nd ‘𝑋)⟩))
93	53, 92	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ({⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∈ 𝐸 → ¬ ⟨0, (2nd ‘𝑋)⟩ = ⟨0, (2nd ‘𝑋)⟩))
94	89, 93	mt2i 138	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ¬ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∈ 𝐸)
95		df-nel 3071	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸 ↔ ¬ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∈ 𝐸)
96	94, 95	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸)
97	6, 7, 8, 31	gpg5nbgrvtx13starlem3 48722	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (2nd ‘𝑋) ∈ V) → {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
98	61, 97	sylan2 604	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
99		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → {⟨0, (2nd ‘𝑋)⟩, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩})
100		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, (2nd ‘𝑋)⟩, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} → ({⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸))
101	99, 100	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → ({⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸))
102		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨0, (2nd ‘𝑋)⟩ → {⟨0, (2nd ‘𝑋)⟩, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩})
103		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, (2nd ‘𝑋)⟩, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} → ({⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
104	102, 103	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨0, (2nd ‘𝑋)⟩ → ({⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
105		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → {⟨0, (2nd ‘𝑋)⟩, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩})
106		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, (2nd ‘𝑋)⟩, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} → ({⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
107	105, 106	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → ({⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
108	71, 72, 73, 101, 104, 107	raltp 4673	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ↔ ({⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ∧ {⟨0, (2nd ‘𝑋)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸 ∧ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
109	88, 96, 98, 108	syl3anbrc 1360	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸)
110		prcom 4700	. . . . . . . . . . . . . . . . . . . 20 ⊢ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩}
111		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
112	110, 111	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
113	70, 112	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸)
114		prcom 4700	. . . . . . . . . . . . . . . . . . . 20 ⊢ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} = {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩}
115		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} = {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
116	114, 115	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
117	98, 116	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸)
118		eqid 2769	. . . . . . . . . . . . . . . . . . . 20 ⊢ ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩
119	31	usgredgne 29493	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐺 ∈ USGraph ∧ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∈ 𝐸) → ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ ≠ ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩)
120	119	neneqd 2969	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐺 ∈ USGraph ∧ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∈ 𝐸) → ¬ ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩)
121	120	ex 417	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐺 ∈ USGraph → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∈ 𝐸 → ¬ ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩))
122	53, 121	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∈ 𝐸 → ¬ ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩))
123	118, 122	mt2i 138	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ¬ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∈ 𝐸)
124		df-nel 3071	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸 ↔ ¬ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∈ 𝐸)
125	123, 124	sylibr 237	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸)
126		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩})
127		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸))
128	126, 127	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸))
129		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨0, (2nd ‘𝑋)⟩ → {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩})
130		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
131	129, 130	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨0, (2nd ‘𝑋)⟩ → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸))
132		preq2 4702	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩})
133		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
134	132, 133	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
135	71, 72, 73, 128, 131, 134	raltp 4673	. . . . . . . . . . . . . . . . . 18 ⊢ (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ↔ ({⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩} ∉ 𝐸 ∧ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩} ∉ 𝐸 ∧ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} ∉ 𝐸))
136	113, 117, 125, 135	syl3anbrc 1360	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸)
137		preq1 4701	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → {𝑥, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦})
138		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({𝑥, 𝑦} = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} → ({𝑥, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
139	137, 138	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → ({𝑥, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
140	139	ralbidv 3194	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩ → (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸 ↔ ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
141		preq1 4701	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = ⟨0, (2nd ‘𝑋)⟩ → {𝑥, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, 𝑦})
142		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({𝑥, 𝑦} = {⟨0, (2nd ‘𝑋)⟩, 𝑦} → ({𝑥, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸))
143	141, 142	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = ⟨0, (2nd ‘𝑋)⟩ → ({𝑥, 𝑦} ∉ 𝐸 ↔ {⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸))
144	143	ralbidv 3194	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨0, (2nd ‘𝑋)⟩ → (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸 ↔ ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸))
145		preq1 4701	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → {𝑥, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦})
146		neleq1 3076	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({𝑥, 𝑦} = {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} → ({𝑥, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
147	145, 146	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → ({𝑥, 𝑦} ∉ 𝐸 ↔ {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
148	147	ralbidv 3194	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩ → (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸 ↔ ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
149	71, 72, 73, 140, 144, 148	raltp 4673	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑥 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩}∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸 ↔ (∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸 ∧ ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨0, (2nd ‘𝑋)⟩, 𝑦} ∉ 𝐸 ∧ ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩, 𝑦} ∉ 𝐸))
150	84, 109, 136, 149	syl3anbrc 1360	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ∀𝑥 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩}∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸)
151	6, 7, 8, 30	gpgnbgrvtx1 48724	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑁 ∈ (ℤ≥‘3) ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → 𝑈 = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩})
152	3, 151	sylanl1 692	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → 𝑈 = {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩})
153	152	raleqdv 3329	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → (∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸 ↔ ∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸))
154	152, 153	raleqbidv 3345	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → (∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸 ↔ ∀𝑥 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩}∀𝑦 ∈ {⟨1, (((2nd ‘𝑋) + 𝐾) mod 𝑁)⟩, ⟨0, (2nd ‘𝑋)⟩, ⟨1, (((2nd ‘𝑋) − 𝐾) mod 𝑁)⟩} {𝑥, 𝑦} ∉ 𝐸))
155	150, 154	mpbird 260	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)
156	46, 155	jca 520	. . . . . . . . . . . . . 14 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽) ∧ (𝑋 ∈ 𝑉 ∧ (1st ‘𝑋) = 1)) → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))
157	156	exp43 441	. . . . . . . . . . . . 13 ⊢ (𝑁 = 5 → (𝐾 ∈ 𝐽 → (𝑋 ∈ 𝑉 → ((1st ‘𝑋) = 1 → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))))
158	157	3imp 1126	. . . . . . . . . . . 12 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((1st ‘𝑋) = 1 → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
159	44, 158	syl5 35	. . . . . . . . . . 11 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = ⟨1, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
160	159	adantl 486	. . . . . . . . . 10 ⊢ ((𝑎 = 1 ∧ (𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = ⟨1, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
161	42, 160	sylbid 243	. . . . . . . . 9 ⊢ ((𝑎 = 1 ∧ (𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉)) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
162	161	ex 417	. . . . . . . 8 ⊢ (𝑎 = 1 → ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))))
163	39, 162	jaoi 870	. . . . . . 7 ⊢ ((𝑎 = 0 ∨ 𝑎 = 1) → ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))))
164	12, 163	syl 18	. . . . . 6 ⊢ (𝑎 ∈ {0, 1} → ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))))
165	164	impcom 412	. . . . 5 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) ∧ 𝑎 ∈ {0, 1}) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
166	165	a1d 26	. . . 4 ⊢ (((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) ∧ 𝑎 ∈ {0, 1}) → (𝑏 ∈ (0..^𝑁) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))))
167	166	expimpd 458	. . 3 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((𝑎 ∈ {0, 1} ∧ 𝑏 ∈ (0..^𝑁)) → (𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))))
168	167	rexlimdvv 3227	. 2 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → (∃𝑎 ∈ {0, 1}∃𝑏 ∈ (0..^𝑁)𝑋 = ⟨𝑎, 𝑏⟩ → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸)))
169	11, 168	mpd 16	1 ⊢ ((𝑁 = 5 ∧ 𝐾 ∈ 𝐽 ∧ 𝑋 ∈ 𝑉) → ((♯‘𝑈) = 3 ∧ ∀𝑥 ∈ 𝑈 ∀𝑦 ∈ 𝑈 {𝑥, 𝑦} ∉ 𝐸))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ∉ wnel 3070  ∀wral 3085  ∃wrex 3095  Vcvv 3463  {cpr 4593  {ctp 4595  ⟨cop 4597   class class class wbr 5110  ‘cfv 6534  (class class class)co 7408  1^st c1st 7980  2^nd c2nd 7981  0cc0 11096  1c1 11097   + caddc 11099   ≤ cle 11240   − cmin 11437   / cdiv 11867  2c2 12291  3c3 12292  4c4 12293  5c5 12294  ℤcz 12587  ℤ_≥cuz 12858  ..^cfzo 13678  ⌈cceil 13820   mod cmo 13898  ♯chash 14362  Vtxcvtx 29283  Edgcedg 29334  USGraphcusgr 29436   NeighbVtx cnbgr 29619   gPetersenGr cgpg 48689

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-cnex 11152  ax-resscn 11153  ax-1cn 11154  ax-icn 11155  ax-addcl 11156  ax-addrcl 11157  ax-mulcl 11158  ax-mulrcl 11159  ax-mulcom 11160  ax-addass 11161  ax-mulass 11162  ax-distr 11163  ax-i2m1 11164  ax-1ne0 11165  ax-1rid 11166  ax-rnegex 11167  ax-rrecex 11168  ax-cnre 11169  ax-pre-lttri 11170  ax-pre-lttrn 11171  ax-pre-ltadd 11172  ax-pre-mulgt0 11173  ax-pre-sup 11174

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6300  df-ord 6361  df-on 6362  df-lim 6363  df-suc 6364  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-oadd 8453  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-inf 9399  df-dju 9883  df-card 9921  df-pnf 11241  df-mnf 11242  df-xr 11243  df-ltxr 11244  df-le 11245  df-sub 11439  df-neg 11440  df-div 11868  df-nn 12230  df-2 12299  df-3 12300  df-4 12301  df-5 12302  df-6 12303  df-7 12304  df-8 12305  df-9 12306  df-n0 12501  df-xnn0 12574  df-z 12588  df-dec 12708  df-uz 12859  df-rp 13013  df-ico 13374  df-fz 13532  df-fzo 13679  df-fl 13821  df-ceil 13822  df-mod 13899  df-seq 14034  df-exp 14094  df-hash 14363  df-cj 15146  df-re 15147  df-im 15148  df-sqrt 15282  df-abs 15283  df-dvds 16307  df-struct 17203  df-slot 17238  df-ndx 17250  df-base 17266  df-edgf 29276  df-vtx 29285  df-iedg 29286  df-edg 29335  df-upgr 29369  df-umgr 29370  df-usgr 29438  df-nbgr 29620  df-gpg 48690

This theorem is referenced by:  gpg5gricstgr3  48739