Metamath Proof Explorer


Theorem mod2eq1n2dvds

Description: An integer is 1 modulo 2 iff it is odd (i.e. not divisible by 2), see example 3 in ApostolNT p. 107. (Contributed by AV, 24-May-2020) (Proof shortened by AV, 5-Jul-2020)

Ref Expression
Assertion mod2eq1n2dvds ⊢ N ∈ ℤ → N mod 2 = 1 ↔ ¬ 2 ∥ N

Proof

Step Hyp Ref Expression
1 zeo ⊢ N ∈ ℤ → N 2 ∈ ℤ ∨ N + 1 2 ∈ ℤ
2 zre ⊢ N ∈ ℤ → N ∈ ℝ
3 2rp ⊢ 2 ∈ ℝ +
4 mod0 ⊢ N ∈ ℝ ∧ 2 ∈ ℝ + → N mod 2 = 0 ↔ N 2 ∈ ℤ
5 2 3 4 sylancl ⊢ N ∈ ℤ → N mod 2 = 0 ↔ N 2 ∈ ℤ
6 5 biimpar ⊢ N ∈ ℤ ∧ N 2 ∈ ℤ → N mod 2 = 0
7 eqeq1 ⊢ N mod 2 = 0 → N mod 2 = 1 ↔ 0 = 1
8 0ne1 ⊢ 0 ≠ 1
9 eqneqall ⊢ 0 = 1 → 0 ≠ 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
10 8 9 mpi ⊢ 0 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
11 7 10 biimtrdi ⊢ N mod 2 = 0 → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
12 6 11 syl ⊢ N ∈ ℤ ∧ N 2 ∈ ℤ → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
13 12 expcom ⊢ N 2 ∈ ℤ → N ∈ ℤ → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
14 peano2zm ⊢ N + 1 2 ∈ ℤ → N + 1 2 − 1 ∈ ℤ
15 zcn ⊢ N ∈ ℤ → N ∈ ℂ
16 xp1d2m1eqxm1d2 ⊢ N ∈ ℂ → N + 1 2 − 1 = N − 1 2
17 15 16 syl ⊢ N ∈ ℤ → N + 1 2 − 1 = N − 1 2
18 17 eleq1d ⊢ N ∈ ℤ → N + 1 2 − 1 ∈ ℤ ↔ N − 1 2 ∈ ℤ
19 18 biimpd ⊢ N ∈ ℤ → N + 1 2 − 1 ∈ ℤ → N − 1 2 ∈ ℤ
20 14 19 mpan9 ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ → N − 1 2 ∈ ℤ
21 oveq2 ⊢ n = N − 1 2 → 2 ⁢ n = 2 ⁢ N − 1 2
22 21 adantl ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ ∧ n = N − 1 2 → 2 ⁢ n = 2 ⁢ N − 1 2
23 22 oveq1d ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ ∧ n = N − 1 2 → 2 ⁢ n + 1 = 2 ⁢ N − 1 2 + 1
24 peano2zm ⊢ N ∈ ℤ → N − 1 ∈ ℤ
25 24 zcnd ⊢ N ∈ ℤ → N − 1 ∈ ℂ
26 2cnd ⊢ N ∈ ℤ → 2 ∈ ℂ
27 2ne0 ⊢ 2 ≠ 0
28 27 a1i ⊢ N ∈ ℤ → 2 ≠ 0
29 25 26 28 divcan2d ⊢ N ∈ ℤ → 2 ⁢ N − 1 2 = N − 1
30 29 oveq1d ⊢ N ∈ ℤ → 2 ⁢ N − 1 2 + 1 = N - 1 + 1
31 npcan1 ⊢ N ∈ ℂ → N - 1 + 1 = N
32 15 31 syl ⊢ N ∈ ℤ → N - 1 + 1 = N
33 30 32 eqtrd ⊢ N ∈ ℤ → 2 ⁢ N − 1 2 + 1 = N
34 33 ad2antlr ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ ∧ n = N − 1 2 → 2 ⁢ N − 1 2 + 1 = N
35 23 34 eqtrd ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ ∧ n = N − 1 2 → 2 ⁢ n + 1 = N
36 20 35 rspcedeqvd ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
37 36 a1d ⊢ N + 1 2 ∈ ℤ ∧ N ∈ ℤ → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
38 37 ex ⊢ N + 1 2 ∈ ℤ → N ∈ ℤ → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
39 13 38 jaoi ⊢ N 2 ∈ ℤ ∨ N + 1 2 ∈ ℤ → N ∈ ℤ → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
40 1 39 mpcom ⊢ N ∈ ℤ → N mod 2 = 1 → ∃ n ∈ ℤ 2 ⁢ n + 1 = N
41 oveq1 ⊢ N = 2 ⁢ n + 1 → N mod 2 = 2 ⁢ n + 1 mod 2
42 41 eqcoms ⊢ 2 ⁢ n + 1 = N → N mod 2 = 2 ⁢ n + 1 mod 2
43 2cnd ⊢ n ∈ ℤ → 2 ∈ ℂ
44 zcn ⊢ n ∈ ℤ → n ∈ ℂ
45 43 44 mulcomd ⊢ n ∈ ℤ → 2 ⁢ n = n ⋅ 2
46 45 oveq1d ⊢ n ∈ ℤ → 2 ⁢ n mod 2 = n ⋅ 2 mod 2
47 mulmod0 ⊢ n ∈ ℤ ∧ 2 ∈ ℝ + → n ⋅ 2 mod 2 = 0
48 3 47 mpan2 ⊢ n ∈ ℤ → n ⋅ 2 mod 2 = 0
49 46 48 eqtrd ⊢ n ∈ ℤ → 2 ⁢ n mod 2 = 0
50 49 oveq1d ⊢ n ∈ ℤ → 2 ⁢ n mod 2 + 1 = 0 + 1
51 0p1e1 ⊢ 0 + 1 = 1
52 50 51 eqtrdi ⊢ n ∈ ℤ → 2 ⁢ n mod 2 + 1 = 1
53 52 oveq1d ⊢ n ∈ ℤ → 2 ⁢ n mod 2 + 1 mod 2 = 1 mod 2
54 2z ⊢ 2 ∈ ℤ
55 54 a1i ⊢ n ∈ ℤ → 2 ∈ ℤ
56 id ⊢ n ∈ ℤ → n ∈ ℤ
57 55 56 zmulcld ⊢ n ∈ ℤ → 2 ⁢ n ∈ ℤ
58 57 zred ⊢ n ∈ ℤ → 2 ⁢ n ∈ ℝ
59 1red ⊢ n ∈ ℤ → 1 ∈ ℝ
60 3 a1i ⊢ n ∈ ℤ → 2 ∈ ℝ +
61 modaddmod ⊢ 2 ⁢ n ∈ ℝ ∧ 1 ∈ ℝ ∧ 2 ∈ ℝ + → 2 ⁢ n mod 2 + 1 mod 2 = 2 ⁢ n + 1 mod 2
62 58 59 60 61 syl3anc ⊢ n ∈ ℤ → 2 ⁢ n mod 2 + 1 mod 2 = 2 ⁢ n + 1 mod 2
63 2re ⊢ 2 ∈ ℝ
64 1lt2 ⊢ 1 < 2
65 63 64 pm3.2i ⊢ 2 ∈ ℝ ∧ 1 < 2
66 1mod ⊢ 2 ∈ ℝ ∧ 1 < 2 → 1 mod 2 = 1
67 65 66 mp1i ⊢ n ∈ ℤ → 1 mod 2 = 1
68 53 62 67 3eqtr3d ⊢ n ∈ ℤ → 2 ⁢ n + 1 mod 2 = 1
69 68 adantl ⊢ N ∈ ℤ ∧ n ∈ ℤ → 2 ⁢ n + 1 mod 2 = 1
70 42 69 sylan9eqr ⊢ N ∈ ℤ ∧ n ∈ ℤ ∧ 2 ⁢ n + 1 = N → N mod 2 = 1
71 70 rexlimdva2 ⊢ N ∈ ℤ → ∃ n ∈ ℤ 2 ⁢ n + 1 = N → N mod 2 = 1
72 40 71 impbid ⊢ N ∈ ℤ → N mod 2 = 1 ↔ ∃ n ∈ ℤ 2 ⁢ n + 1 = N
73 odd2np1 ⊢ N ∈ ℤ → ¬ 2 ∥ N ↔ ∃ n ∈ ℤ 2 ⁢ n + 1 = N
74 72 73 bitr4d ⊢ N ∈ ℤ → N mod 2 = 1 ↔ ¬ 2 ∥ N