Metamath Proof Explorer


Theorem modm1p1ne

Description: If an integer minus one equals another integer plus one modulo an integer greater than 4, then the first integer plus one is not equal to the second integer minus one modulo the same modulus. (Contributed by AV, 15-Nov-2025)

Ref Expression
Hypothesis modm1nep1.i I = 0 ..^ N
Assertion modm1p1ne N 5 X I Y I Y 1 mod N = X + 1 mod N Y + 1 mod N X 1 mod N

Proof

Step Hyp Ref Expression
1 modm1nep1.i I = 0 ..^ N
2 eluz2 N 5 5 N 5 N
3 4nn0 4 0
4 3 a1i 5 N 5 N 4 0
5 simp2 5 N 5 N N
6 0red 5 N 5 N 0
7 5re 5
8 7 a1i 5 N 5 N 5
9 zre N N
10 9 3ad2ant2 5 N 5 N N
11 5pos 0 < 5
12 11 a1i 5 N 5 N 0 < 5
13 simp3 5 N 5 N 5 N
14 6 8 10 12 13 ltletrd 5 N 5 N 0 < N
15 elnnz N N 0 < N
16 5 14 15 sylanbrc 5 N 5 N N
17 4re 4
18 17 a1i 5 N 5 N 4
19 4lt5 4 < 5
20 19 a1i 5 N 5 N 4 < 5
21 18 8 10 20 13 ltletrd 5 N 5 N 4 < N
22 elfzo0 4 0 ..^ N 4 0 N 4 < N
23 4 16 21 22 syl3anbrc 5 N 5 N 4 0 ..^ N
24 2 23 sylbi N 5 4 0 ..^ N
25 zmodidfzoimp 4 0 ..^ N 4 mod N = 4
26 24 25 syl N 5 4 mod N = 4
27 4ne0 4 0
28 27 a1i N 5 4 0
29 26 28 eqnetrd N 5 4 mod N 0
30 df-ne 4 1 mod N 0 ¬ 4 1 mod N = 0
31 4cn 4
32 31 mulridi 4 1 = 4
33 32 oveq1i 4 1 mod N = 4 mod N
34 33 neeq1i 4 1 mod N 0 4 mod N 0
35 30 34 bitr3i ¬ 4 1 mod N = 0 4 mod N 0
36 29 35 sylibr N 5 ¬ 4 1 mod N = 0
37 36 3ad2ant1 N 5 X I Y I ¬ 4 1 mod N = 0
38 37 adantr N 5 X I Y I Y 1 mod N = X + 1 mod N ¬ 4 1 mod N = 0
39 uzuzle35 N 5 N 3
40 eluz3nn N 3 N
41 39 40 syl N 5 N
42 41 3ad2ant1 N 5 X I Y I N
43 elfzoelz X 0 ..^ N X
44 43 1 eleq2s X I X
45 44 3ad2ant2 N 5 X I Y I X
46 elfzoelz Y 0 ..^ N Y
47 46 1 eleq2s Y I Y
48 47 3ad2ant3 N 5 X I Y I Y
49 1zzd N 5 X I Y I 1
50 modmkpkne N X Y 1 Y 1 mod N = X + 1 mod N Y + 1 mod N = X 1 mod N 4 1 mod N = 0
51 42 45 48 49 50 syl13anc N 5 X I Y I Y 1 mod N = X + 1 mod N Y + 1 mod N = X 1 mod N 4 1 mod N = 0
52 51 imp N 5 X I Y I Y 1 mod N = X + 1 mod N Y + 1 mod N = X 1 mod N 4 1 mod N = 0
53 38 52 mtbird N 5 X I Y I Y 1 mod N = X + 1 mod N ¬ Y + 1 mod N = X 1 mod N
54 53 neqned N 5 X I Y I Y 1 mod N = X + 1 mod N Y + 1 mod N X 1 mod N
55 54 ex N 5 X I Y I Y 1 mod N = X + 1 mod N Y + 1 mod N X 1 mod N