Metamath Proof Explorer


Theorem gpgiedgdmellem

Description: Lemma for gpgiedgdmel and gpgedgel . (Contributed by AV, 2-Nov-2025)

Ref Expression
Hypotheses gpgvtxel.i ⊢ I = 0 ..^ N
gpgvtxel.j ⊢ J = 1 ..^ N 2
Assertion gpgiedgdmellem ⊢ N ∈ ℕ ∧ K ∈ J → ∃ x ∈ I Y = 0 x 0 x + 1 mod N ∨ Y = 0 x 1 x ∨ Y = 1 x 1 x + K mod N → Y ∈ 𝒫 0 1 × I

Proof

Step Hyp Ref Expression
1 gpgvtxel.i ⊢ I = 0 ..^ N
2 gpgvtxel.j ⊢ J = 1 ..^ N 2
3 prex ⊢ 0 x 0 x + 1 mod N ∈ V
4 3 a1i ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x 0 x + 1 mod N ∈ V
5 0elpr01 ⊢ 0 ∈ 0 1
6 5 a1i ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 ∈ 0 1
7 simpr ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x ∈ I
8 6 7 opelxpd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x ∈ 0 1 × I
9 elfzoelz ⊢ x ∈ 0 ..^ N → x ∈ ℤ
10 9 1 eleq2s ⊢ x ∈ I → x ∈ ℤ
11 10 adantl ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x ∈ ℤ
12 11 peano2zd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x + 1 ∈ ℤ
13 simpll ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → N ∈ ℕ
14 zmodfzo ⊢ x + 1 ∈ ℤ ∧ N ∈ ℕ → x + 1 mod N ∈ 0 ..^ N
15 12 13 14 syl2anc ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x + 1 mod N ∈ 0 ..^ N
16 15 1 eleqtrrdi ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x + 1 mod N ∈ I
17 6 16 opelxpd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x + 1 mod N ∈ 0 1 × I
18 8 17 prssd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x 0 x + 1 mod N ⊆ 0 1 × I
19 4 18 elpwd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x 0 x + 1 mod N ∈ 𝒫 0 1 × I
20 eleq1 ⊢ Y = 0 x 0 x + 1 mod N → Y ∈ 𝒫 0 1 × I ↔ 0 x 0 x + 1 mod N ∈ 𝒫 0 1 × I
21 19 20 syl5ibrcom ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → Y = 0 x 0 x + 1 mod N → Y ∈ 𝒫 0 1 × I
22 prex ⊢ 0 x 1 x ∈ V
23 22 a1i ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x 1 x ∈ V
24 1elpr01 ⊢ 1 ∈ 0 1
25 24 a1i ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 1 ∈ 0 1
26 25 7 opelxpd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 1 x ∈ 0 1 × I
27 8 26 prssd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x 1 x ⊆ 0 1 × I
28 23 27 elpwd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 0 x 1 x ∈ 𝒫 0 1 × I
29 eleq1 ⊢ Y = 0 x 1 x → Y ∈ 𝒫 0 1 × I ↔ 0 x 1 x ∈ 𝒫 0 1 × I
30 28 29 syl5ibrcom ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → Y = 0 x 1 x → Y ∈ 𝒫 0 1 × I
31 prex ⊢ 1 x 1 x + K mod N ∈ V
32 31 a1i ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 1 x 1 x + K mod N ∈ V
33 elfzoelz ⊢ K ∈ 1 ..^ N 2 → K ∈ ℤ
34 33 2 eleq2s ⊢ K ∈ J → K ∈ ℤ
35 34 ad2antlr ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → K ∈ ℤ
36 11 35 zaddcld ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x + K ∈ ℤ
37 zmodfzo ⊢ x + K ∈ ℤ ∧ N ∈ ℕ → x + K mod N ∈ 0 ..^ N
38 36 13 37 syl2anc ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x + K mod N ∈ 0 ..^ N
39 38 1 eleqtrrdi ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → x + K mod N ∈ I
40 25 39 opelxpd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 1 x + K mod N ∈ 0 1 × I
41 26 40 prssd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 1 x 1 x + K mod N ⊆ 0 1 × I
42 32 41 elpwd ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → 1 x 1 x + K mod N ∈ 𝒫 0 1 × I
43 eleq1 ⊢ Y = 1 x 1 x + K mod N → Y ∈ 𝒫 0 1 × I ↔ 1 x 1 x + K mod N ∈ 𝒫 0 1 × I
44 42 43 syl5ibrcom ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → Y = 1 x 1 x + K mod N → Y ∈ 𝒫 0 1 × I
45 21 30 44 3jaod ⊢ N ∈ ℕ ∧ K ∈ J ∧ x ∈ I → Y = 0 x 0 x + 1 mod N ∨ Y = 0 x 1 x ∨ Y = 1 x 1 x + K mod N → Y ∈ 𝒫 0 1 × I
46 45 rexlimdva ⊢ N ∈ ℕ ∧ K ∈ J → ∃ x ∈ I Y = 0 x 0 x + 1 mod N ∨ Y = 0 x 1 x ∨ Y = 1 x 1 x + K mod N → Y ∈ 𝒫 0 1 × I