gpgprismgr4cycllem10 - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > gpgprismgr4cycllem10		Structured version Visualization version GIF version

Theorem gpgprismgr4cycllem10 48731

Description: Lemma 10 for gpgprismgr4cycl0 48733. (Contributed by AV, 5-Nov-2025.)

**Hypotheses**
Ref	Expression
gpgprismgr4cycl.p	⊢ 𝑃 = ⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩
gpgprismgr4cycl.f	⊢ 𝐹 = ⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩
gpgprismgr4cycl.g	⊢ 𝐺 = (𝑁 gPetersenGr 1)

**Assertion**
Ref	Expression
gpgprismgr4cycllem10	⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → ((iEdg‘𝐺)‘(𝐹‘𝑋)) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})

Proof of Theorem gpgprismgr4cycllem10 Dummy variables 𝑒 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gpgprismgr4cycl.g	. . . . . . 7 ⊢ 𝐺 = (𝑁 gPetersenGr 1)
2	1	fveq2i 6872	. . . . . 6 ⊢ (iEdg‘𝐺) = (iEdg‘(𝑁 gPetersenGr 1))
3	2	a1i 11	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (iEdg‘𝐺) = (iEdg‘(𝑁 gPetersenGr 1)))
4		eluz3nn 12892	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘3) → 𝑁 ∈ ℕ)
5		1elfzo1ceilhalf1 47940	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘3) → 1 ∈ (1..^(⌈‘(𝑁 / 2))))
6	4, 5	jca 519	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘3) → (𝑁 ∈ ℕ ∧ 1 ∈ (1..^(⌈‘(𝑁 / 2)))))
7	6	adantr 484	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (𝑁 ∈ ℕ ∧ 1 ∈ (1..^(⌈‘(𝑁 / 2)))))
8		eqid 2764	. . . . . . 7 ⊢ (1..^(⌈‘(𝑁 / 2))) = (1..^(⌈‘(𝑁 / 2)))
9		eqid 2764	. . . . . . 7 ⊢ (0..^𝑁) = (0..^𝑁)
10	8, 9	gpgiedg 48671	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 1 ∈ (1..^(⌈‘(𝑁 / 2)))) → (iEdg‘(𝑁 gPetersenGr 1)) = ( I ↾ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})}))
11	7, 10	syl 17	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (iEdg‘(𝑁 gPetersenGr 1)) = ( I ↾ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})}))
12	3, 11	eqtrd 2799	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (iEdg‘𝐺) = ( I ↾ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})}))
13	12	fveq1d 6871	. . 3 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → ((iEdg‘𝐺)‘(𝐹‘𝑋)) = (( I ↾ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})})‘(𝐹‘𝑋)))
14		gpgprismgr4cycl.f	. . . . . 6 ⊢ 𝐹 = ⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩
15	14	gpgprismgr4cycllem3 48724	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^4)) → ((𝐹‘𝑋) ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∧ ∃𝑥 ∈ (0..^𝑁)((𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ (𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ (𝐹‘𝑋) = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})))
16	14	gpgprismgr4cycllem1 48722	. . . . . . . 8 ⊢ (♯‘𝐹) = 4
17	16	oveq2i 7409	. . . . . . 7 ⊢ (0..^(♯‘𝐹)) = (0..^4)
18	17	eleq2i 2856	. . . . . 6 ⊢ (𝑋 ∈ (0..^(♯‘𝐹)) ↔ 𝑋 ∈ (0..^4))
19	18	anbi2i 632	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) ↔ (𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^4)))
20		eqeq1 2768	. . . . . . . 8 ⊢ (𝑒 = (𝐹‘𝑋) → (𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ↔ (𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩}))
21		eqeq1 2768	. . . . . . . 8 ⊢ (𝑒 = (𝐹‘𝑋) → (𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ↔ (𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩}))
22		eqeq1 2768	. . . . . . . 8 ⊢ (𝑒 = (𝐹‘𝑋) → (𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩} ↔ (𝐹‘𝑋) = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩}))
23	20, 21, 22	3orbi123d 1458	. . . . . . 7 ⊢ (𝑒 = (𝐹‘𝑋) → ((𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩}) ↔ ((𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ (𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ (𝐹‘𝑋) = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})))
24	23	rexbidv 3188	. . . . . 6 ⊢ (𝑒 = (𝐹‘𝑋) → (∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩}) ↔ ∃𝑥 ∈ (0..^𝑁)((𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ (𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ (𝐹‘𝑋) = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})))
25	24	elrab 3652	. . . . 5 ⊢ ((𝐹‘𝑋) ∈ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})} ↔ ((𝐹‘𝑋) ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∧ ∃𝑥 ∈ (0..^𝑁)((𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ (𝐹‘𝑋) = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ (𝐹‘𝑋) = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})))
26	15, 19, 25	3imtr4i 294	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (𝐹‘𝑋) ∈ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})})
27		fvresi 7159	. . . 4 ⊢ ((𝐹‘𝑋) ∈ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})} → (( I ↾ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})})‘(𝐹‘𝑋)) = (𝐹‘𝑋))
28	26, 27	syl 17	. . 3 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (( I ↾ {𝑒 ∈ 𝒫 ({0, 1} × (0..^𝑁)) ∣ ∃𝑥 ∈ (0..^𝑁)(𝑒 = {⟨0, 𝑥⟩, ⟨0, ((𝑥 + 1) mod 𝑁)⟩} ∨ 𝑒 = {⟨0, 𝑥⟩, ⟨1, 𝑥⟩} ∨ 𝑒 = {⟨1, 𝑥⟩, ⟨1, ((𝑥 + 1) mod 𝑁)⟩})})‘(𝐹‘𝑋)) = (𝐹‘𝑋))
29	13, 28	eqtrd 2799	. 2 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → ((iEdg‘𝐺)‘(𝐹‘𝑋)) = (𝐹‘𝑋))
30		fzo0to42pr 13761	. . . . . 6 ⊢ (0..^4) = ({0, 1} ∪ {2, 3})
31	30	eleq2i 2856	. . . . 5 ⊢ (𝑋 ∈ (0..^4) ↔ 𝑋 ∈ ({0, 1} ∪ {2, 3}))
32		elun 4108	. . . . 5 ⊢ (𝑋 ∈ ({0, 1} ∪ {2, 3}) ↔ (𝑋 ∈ {0, 1} ∨ 𝑋 ∈ {2, 3}))
33	18, 31, 32	3bitri 299	. . . 4 ⊢ (𝑋 ∈ (0..^(♯‘𝐹)) ↔ (𝑋 ∈ {0, 1} ∨ 𝑋 ∈ {2, 3}))
34		elpri 4608	. . . . . 6 ⊢ (𝑋 ∈ {0, 1} → (𝑋 = 0 ∨ 𝑋 = 1))
35		prex 5397	. . . . . . . . . 10 ⊢ {⟨0, 0⟩, ⟨0, 1⟩} ∈ V
36		s4fv0 14910	. . . . . . . . . 10 ⊢ ({⟨0, 0⟩, ⟨0, 1⟩} ∈ V → (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘0) = {⟨0, 0⟩, ⟨0, 1⟩})
37	35, 36	ax-mp 5	. . . . . . . . 9 ⊢ (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘0) = {⟨0, 0⟩, ⟨0, 1⟩}
38	14	fveq1i 6870	. . . . . . . . 9 ⊢ (𝐹‘0) = (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘0)
39		gpgprismgr4cycl.p	. . . . . . . . . . . 12 ⊢ 𝑃 = ⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩
40	39	fveq1i 6870	. . . . . . . . . . 11 ⊢ (𝑃‘0) = (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘0)
41		opex 5433	. . . . . . . . . . . 12 ⊢ ⟨0, 0⟩ ∈ V
42		df-s5 14866	. . . . . . . . . . . . 13 ⊢ ⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩ = (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩ ++ ⟨“⟨0, 0⟩”⟩)
43		s4cli 14897	. . . . . . . . . . . . 13 ⊢ ⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩ ∈ Word V
44		s4len 14914	. . . . . . . . . . . . 13 ⊢ (♯‘⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩) = 4
45		s4fv0 14910	. . . . . . . . . . . . 13 ⊢ (⟨0, 0⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩‘0) = ⟨0, 0⟩)
46		0nn0 12498	. . . . . . . . . . . . 13 ⊢ 0 ∈ ℕ₀
47		4pos 12330	. . . . . . . . . . . . 13 ⊢ 0 < 4
48	42, 43, 44, 45, 46, 47	cats1fv 14874	. . . . . . . . . . . 12 ⊢ (⟨0, 0⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘0) = ⟨0, 0⟩)
49	41, 48	ax-mp 5	. . . . . . . . . . 11 ⊢ (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘0) = ⟨0, 0⟩
50	40, 49	eqtri 2787	. . . . . . . . . 10 ⊢ (𝑃‘0) = ⟨0, 0⟩
51	39	fveq1i 6870	. . . . . . . . . . 11 ⊢ (𝑃‘1) = (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘1)
52		opex 5433	. . . . . . . . . . . 12 ⊢ ⟨0, 1⟩ ∈ V
53		s4fv1 14911	. . . . . . . . . . . . 13 ⊢ (⟨0, 1⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩‘1) = ⟨0, 1⟩)
54		1nn0 12499	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℕ₀
55		1lt4 12398	. . . . . . . . . . . . 13 ⊢ 1 < 4
56	42, 43, 44, 53, 54, 55	cats1fv 14874	. . . . . . . . . . . 12 ⊢ (⟨0, 1⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘1) = ⟨0, 1⟩)
57	52, 56	ax-mp 5	. . . . . . . . . . 11 ⊢ (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘1) = ⟨0, 1⟩
58	51, 57	eqtri 2787	. . . . . . . . . 10 ⊢ (𝑃‘1) = ⟨0, 1⟩
59	50, 58	preq12i 4699	. . . . . . . . 9 ⊢ {(𝑃‘0), (𝑃‘1)} = {⟨0, 0⟩, ⟨0, 1⟩}
60	37, 38, 59	3eqtr4i 2797	. . . . . . . 8 ⊢ (𝐹‘0) = {(𝑃‘0), (𝑃‘1)}
61		fveq2 6869	. . . . . . . 8 ⊢ (𝑋 = 0 → (𝐹‘𝑋) = (𝐹‘0))
62		fveq2 6869	. . . . . . . . 9 ⊢ (𝑋 = 0 → (𝑃‘𝑋) = (𝑃‘0))
63		fv0p1e1 12341	. . . . . . . . 9 ⊢ (𝑋 = 0 → (𝑃‘(𝑋 + 1)) = (𝑃‘1))
64	62, 63	preq12d 4702	. . . . . . . 8 ⊢ (𝑋 = 0 → {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))} = {(𝑃‘0), (𝑃‘1)})
65	60, 61, 64	3eqtr4a 2825	. . . . . . 7 ⊢ (𝑋 = 0 → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
66		prex 5397	. . . . . . . . . 10 ⊢ {⟨0, 1⟩, ⟨1, 1⟩} ∈ V
67		s4fv1 14911	. . . . . . . . . 10 ⊢ ({⟨0, 1⟩, ⟨1, 1⟩} ∈ V → (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘1) = {⟨0, 1⟩, ⟨1, 1⟩})
68	66, 67	ax-mp 5	. . . . . . . . 9 ⊢ (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘1) = {⟨0, 1⟩, ⟨1, 1⟩}
69	14	fveq1i 6870	. . . . . . . . 9 ⊢ (𝐹‘1) = (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘1)
70	39	fveq1i 6870	. . . . . . . . . . 11 ⊢ (𝑃‘2) = (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘2)
71		opex 5433	. . . . . . . . . . . 12 ⊢ ⟨1, 1⟩ ∈ V
72		s4fv2 14912	. . . . . . . . . . . . 13 ⊢ (⟨1, 1⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩‘2) = ⟨1, 1⟩)
73		2nn0 12500	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℕ₀
74		2lt4 12397	. . . . . . . . . . . . 13 ⊢ 2 < 4
75	42, 43, 44, 72, 73, 74	cats1fv 14874	. . . . . . . . . . . 12 ⊢ (⟨1, 1⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘2) = ⟨1, 1⟩)
76	71, 75	ax-mp 5	. . . . . . . . . . 11 ⊢ (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘2) = ⟨1, 1⟩
77	70, 76	eqtri 2787	. . . . . . . . . 10 ⊢ (𝑃‘2) = ⟨1, 1⟩
78	58, 77	preq12i 4699	. . . . . . . . 9 ⊢ {(𝑃‘1), (𝑃‘2)} = {⟨0, 1⟩, ⟨1, 1⟩}
79	68, 69, 78	3eqtr4i 2797	. . . . . . . 8 ⊢ (𝐹‘1) = {(𝑃‘1), (𝑃‘2)}
80		fveq2 6869	. . . . . . . 8 ⊢ (𝑋 = 1 → (𝐹‘𝑋) = (𝐹‘1))
81		fveq2 6869	. . . . . . . . 9 ⊢ (𝑋 = 1 → (𝑃‘𝑋) = (𝑃‘1))
82		oveq1 7405	. . . . . . . . . . 11 ⊢ (𝑋 = 1 → (𝑋 + 1) = (1 + 1))
83		1p1e2 12343	. . . . . . . . . . 11 ⊢ (1 + 1) = 2
84	82, 83	eqtrdi 2815	. . . . . . . . . 10 ⊢ (𝑋 = 1 → (𝑋 + 1) = 2)
85	84	fveq2d 6873	. . . . . . . . 9 ⊢ (𝑋 = 1 → (𝑃‘(𝑋 + 1)) = (𝑃‘2))
86	81, 85	preq12d 4702	. . . . . . . 8 ⊢ (𝑋 = 1 → {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))} = {(𝑃‘1), (𝑃‘2)})
87	79, 80, 86	3eqtr4a 2825	. . . . . . 7 ⊢ (𝑋 = 1 → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
88	65, 87	jaoi 868	. . . . . 6 ⊢ ((𝑋 = 0 ∨ 𝑋 = 1) → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
89	34, 88	syl 17	. . . . 5 ⊢ (𝑋 ∈ {0, 1} → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
90		elpri 4608	. . . . . 6 ⊢ (𝑋 ∈ {2, 3} → (𝑋 = 2 ∨ 𝑋 = 3))
91		prex 5397	. . . . . . . . . 10 ⊢ {⟨1, 1⟩, ⟨1, 0⟩} ∈ V
92		s4fv2 14912	. . . . . . . . . 10 ⊢ ({⟨1, 1⟩, ⟨1, 0⟩} ∈ V → (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘2) = {⟨1, 1⟩, ⟨1, 0⟩})
93	91, 92	ax-mp 5	. . . . . . . . 9 ⊢ (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘2) = {⟨1, 1⟩, ⟨1, 0⟩}
94	14	fveq1i 6870	. . . . . . . . 9 ⊢ (𝐹‘2) = (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘2)
95	39	fveq1i 6870	. . . . . . . . . . 11 ⊢ (𝑃‘3) = (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘3)
96		opex 5433	. . . . . . . . . . . 12 ⊢ ⟨1, 0⟩ ∈ V
97		s4fv3 14913	. . . . . . . . . . . . 13 ⊢ (⟨1, 0⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩”⟩‘3) = ⟨1, 0⟩)
98		3nn0 12501	. . . . . . . . . . . . 13 ⊢ 3 ∈ ℕ₀
99		3lt4 12396	. . . . . . . . . . . . 13 ⊢ 3 < 4
100	42, 43, 44, 97, 98, 99	cats1fv 14874	. . . . . . . . . . . 12 ⊢ (⟨1, 0⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘3) = ⟨1, 0⟩)
101	96, 100	ax-mp 5	. . . . . . . . . . 11 ⊢ (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘3) = ⟨1, 0⟩
102	95, 101	eqtri 2787	. . . . . . . . . 10 ⊢ (𝑃‘3) = ⟨1, 0⟩
103	77, 102	preq12i 4699	. . . . . . . . 9 ⊢ {(𝑃‘2), (𝑃‘3)} = {⟨1, 1⟩, ⟨1, 0⟩}
104	93, 94, 103	3eqtr4i 2797	. . . . . . . 8 ⊢ (𝐹‘2) = {(𝑃‘2), (𝑃‘3)}
105		fveq2 6869	. . . . . . . 8 ⊢ (𝑋 = 2 → (𝐹‘𝑋) = (𝐹‘2))
106		fveq2 6869	. . . . . . . . 9 ⊢ (𝑋 = 2 → (𝑃‘𝑋) = (𝑃‘2))
107		oveq1 7405	. . . . . . . . . . 11 ⊢ (𝑋 = 2 → (𝑋 + 1) = (2 + 1))
108		2p1e3 12361	. . . . . . . . . . 11 ⊢ (2 + 1) = 3
109	107, 108	eqtrdi 2815	. . . . . . . . . 10 ⊢ (𝑋 = 2 → (𝑋 + 1) = 3)
110	109	fveq2d 6873	. . . . . . . . 9 ⊢ (𝑋 = 2 → (𝑃‘(𝑋 + 1)) = (𝑃‘3))
111	106, 110	preq12d 4702	. . . . . . . 8 ⊢ (𝑋 = 2 → {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))} = {(𝑃‘2), (𝑃‘3)})
112	104, 105, 111	3eqtr4a 2825	. . . . . . 7 ⊢ (𝑋 = 2 → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
113		prex 5397	. . . . . . . . . 10 ⊢ {⟨1, 0⟩, ⟨0, 0⟩} ∈ V
114		s4fv3 14913	. . . . . . . . . 10 ⊢ ({⟨1, 0⟩, ⟨0, 0⟩} ∈ V → (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘3) = {⟨1, 0⟩, ⟨0, 0⟩})
115	113, 114	ax-mp 5	. . . . . . . . 9 ⊢ (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘3) = {⟨1, 0⟩, ⟨0, 0⟩}
116	14	fveq1i 6870	. . . . . . . . 9 ⊢ (𝐹‘3) = (⟨“{⟨0, 0⟩, ⟨0, 1⟩} {⟨0, 1⟩, ⟨1, 1⟩} {⟨1, 1⟩, ⟨1, 0⟩} {⟨1, 0⟩, ⟨0, 0⟩}”⟩‘3)
117	39	fveq1i 6870	. . . . . . . . . . 11 ⊢ (𝑃‘4) = (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘4)
118	42, 43, 44	cats1fvn 14873	. . . . . . . . . . . 12 ⊢ (⟨0, 0⟩ ∈ V → (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘4) = ⟨0, 0⟩)
119	41, 118	ax-mp 5	. . . . . . . . . . 11 ⊢ (⟨“⟨0, 0⟩⟨0, 1⟩⟨1, 1⟩⟨1, 0⟩⟨0, 0⟩”⟩‘4) = ⟨0, 0⟩
120	117, 119	eqtri 2787	. . . . . . . . . 10 ⊢ (𝑃‘4) = ⟨0, 0⟩
121	102, 120	preq12i 4699	. . . . . . . . 9 ⊢ {(𝑃‘3), (𝑃‘4)} = {⟨1, 0⟩, ⟨0, 0⟩}
122	115, 116, 121	3eqtr4i 2797	. . . . . . . 8 ⊢ (𝐹‘3) = {(𝑃‘3), (𝑃‘4)}
123		fveq2 6869	. . . . . . . 8 ⊢ (𝑋 = 3 → (𝐹‘𝑋) = (𝐹‘3))
124		fveq2 6869	. . . . . . . . 9 ⊢ (𝑋 = 3 → (𝑃‘𝑋) = (𝑃‘3))
125		oveq1 7405	. . . . . . . . . . 11 ⊢ (𝑋 = 3 → (𝑋 + 1) = (3 + 1))
126		3p1e4 12364	. . . . . . . . . . 11 ⊢ (3 + 1) = 4
127	125, 126	eqtrdi 2815	. . . . . . . . . 10 ⊢ (𝑋 = 3 → (𝑋 + 1) = 4)
128	127	fveq2d 6873	. . . . . . . . 9 ⊢ (𝑋 = 3 → (𝑃‘(𝑋 + 1)) = (𝑃‘4))
129	124, 128	preq12d 4702	. . . . . . . 8 ⊢ (𝑋 = 3 → {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))} = {(𝑃‘3), (𝑃‘4)})
130	122, 123, 129	3eqtr4a 2825	. . . . . . 7 ⊢ (𝑋 = 3 → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
131	112, 130	jaoi 868	. . . . . 6 ⊢ ((𝑋 = 2 ∨ 𝑋 = 3) → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
132	90, 131	syl 17	. . . . 5 ⊢ (𝑋 ∈ {2, 3} → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
133	89, 132	jaoi 868	. . . 4 ⊢ ((𝑋 ∈ {0, 1} ∨ 𝑋 ∈ {2, 3}) → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
134	33, 133	sylbi 219	. . 3 ⊢ (𝑋 ∈ (0..^(♯‘𝐹)) → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
135	134	adantl 485	. 2 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → (𝐹‘𝑋) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})
136	29, 135	eqtrd 2799	1 ⊢ ((𝑁 ∈ (ℤ_≥‘3) ∧ 𝑋 ∈ (0..^(♯‘𝐹))) → ((iEdg‘𝐺)‘(𝐹‘𝑋)) = {(𝑃‘𝑋), (𝑃‘(𝑋 + 1))})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∨ wo 858 ∨ w3o 1098 = wceq 1562 ∈ wcel 2144 ∃wrex 3088 {crab 3416 Vcvv 3456 ∪ cun 3904 𝒫 cpw 4557 {cpr 4586 ⟨cop 4590 I cid 5543 × cxp 5647 ↾ cres 5651 ‘cfv 6523 (class class class)co 7398 0cc0 11075 1c1 11076 + caddc 11078 / cdiv 11846 ℕcn 12212 2c2 12274 3c3 12275 4c4 12276 ℤ_≥cuz 12841 ..^cfzo 13661 ⌈cceil 13803 mod cmo 13881 ♯chash 14345 ⟨“cs4 14858 ⟨“cs5 14859 iEdgciedg 29200 gPetersenGr cgpg 48667

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1st 7972 df-2nd 7973 df-frecs 8264 df-wrecs 8295 df-recs 8344 df-rdg 8383 df-1o 8439 df-oadd 8443 df-er 8680 df-en 8930 df-dom 8931 df-sdom 8932 df-fin 8933 df-sup 9390 df-inf 9391 df-dju 9861 df-card 9899 df-pnf 11220 df-mnf 11221 df-xr 11222 df-ltxr 11223 df-le 11224 df-sub 11418 df-neg 11419 df-div 11847 df-nn 12213 df-2 12282 df-3 12283 df-4 12284 df-5 12285 df-6 12286 df-7 12287 df-8 12288 df-9 12289 df-n0 12484 df-xnn0 12557 df-z 12571 df-dec 12691 df-uz 12842 df-rp 12996 df-ico 13357 df-fz 13515 df-fzo 13662 df-fl 13804 df-ceil 13805 df-mod 13882 df-hash 14346 df-word 14529 df-concat 14586 df-s1 14612 df-s2 14863 df-s3 14864 df-s4 14865 df-s5 14866 df-struct 17185 df-slot 17220 df-ndx 17232 df-base 17248 df-edgf 29192 df-iedg 29202 df-gpg 48668

This theorem is referenced by: gpgprismgr4cycllem11 48732

W3C validator