Metamath Proof Explorer


Theorem ltoddhalfle

Description: An integer is less than half of an odd number iff it is less than or equal to the half of the predecessor of the odd number (which is an even number). (Contributed by AV, 29-Jun-2021)

Ref Expression
Assertion ltoddhalfle ⊢ N ∈ ℤ ∧ ¬ 2 ∥ N ∧ M ∈ ℤ → M < N 2 ↔ M ≤ N − 1 2

Proof

Step Hyp Ref Expression
1 odd2np1 ⊢ N ∈ ℤ → ¬ 2 ∥ N ↔ ∃ n ∈ ℤ 2 ⁢ n + 1 = N
2 halfre ⊢ 1 2 ∈ ℝ
3 2 a1i ⊢ n ∈ ℤ → 1 2 ∈ ℝ
4 1red ⊢ n ∈ ℤ → 1 ∈ ℝ
5 zre ⊢ n ∈ ℤ → n ∈ ℝ
6 3 4 5 3jca ⊢ n ∈ ℤ → 1 2 ∈ ℝ ∧ 1 ∈ ℝ ∧ n ∈ ℝ
7 6 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → 1 2 ∈ ℝ ∧ 1 ∈ ℝ ∧ n ∈ ℝ
8 halflt1 ⊢ 1 2 < 1
9 axltadd ⊢ 1 2 ∈ ℝ ∧ 1 ∈ ℝ ∧ n ∈ ℝ → 1 2 < 1 → n + 1 2 < n + 1
10 7 8 9 mpisyl ⊢ n ∈ ℤ ∧ M ∈ ℤ → n + 1 2 < n + 1
11 zre ⊢ M ∈ ℤ → M ∈ ℝ
12 11 adantl ⊢ n ∈ ℤ ∧ M ∈ ℤ → M ∈ ℝ
13 5 3 readdcld ⊢ n ∈ ℤ → n + 1 2 ∈ ℝ
14 13 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → n + 1 2 ∈ ℝ
15 peano2z ⊢ n ∈ ℤ → n + 1 ∈ ℤ
16 15 zred ⊢ n ∈ ℤ → n + 1 ∈ ℝ
17 16 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → n + 1 ∈ ℝ
18 lttr ⊢ M ∈ ℝ ∧ n + 1 2 ∈ ℝ ∧ n + 1 ∈ ℝ → M < n + 1 2 ∧ n + 1 2 < n + 1 → M < n + 1
19 12 14 17 18 syl3anc ⊢ n ∈ ℤ ∧ M ∈ ℤ → M < n + 1 2 ∧ n + 1 2 < n + 1 → M < n + 1
20 10 19 mpan2d ⊢ n ∈ ℤ ∧ M ∈ ℤ → M < n + 1 2 → M < n + 1
21 zleltp1 ⊢ M ∈ ℤ ∧ n ∈ ℤ → M ≤ n ↔ M < n + 1
22 21 ancoms ⊢ n ∈ ℤ ∧ M ∈ ℤ → M ≤ n ↔ M < n + 1
23 20 22 sylibrd ⊢ n ∈ ℤ ∧ M ∈ ℤ → M < n + 1 2 → M ≤ n
24 halfgt0 ⊢ 0 < 1 2
25 3 5 jca ⊢ n ∈ ℤ → 1 2 ∈ ℝ ∧ n ∈ ℝ
26 25 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → 1 2 ∈ ℝ ∧ n ∈ ℝ
27 ltaddpos ⊢ 1 2 ∈ ℝ ∧ n ∈ ℝ → 0 < 1 2 ↔ n < n + 1 2
28 26 27 syl ⊢ n ∈ ℤ ∧ M ∈ ℤ → 0 < 1 2 ↔ n < n + 1 2
29 24 28 mpbii ⊢ n ∈ ℤ ∧ M ∈ ℤ → n < n + 1 2
30 5 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → n ∈ ℝ
31 lelttr ⊢ M ∈ ℝ ∧ n ∈ ℝ ∧ n + 1 2 ∈ ℝ → M ≤ n ∧ n < n + 1 2 → M < n + 1 2
32 12 30 14 31 syl3anc ⊢ n ∈ ℤ ∧ M ∈ ℤ → M ≤ n ∧ n < n + 1 2 → M < n + 1 2
33 29 32 mpan2d ⊢ n ∈ ℤ ∧ M ∈ ℤ → M ≤ n → M < n + 1 2
34 23 33 impbid ⊢ n ∈ ℤ ∧ M ∈ ℤ → M < n + 1 2 ↔ M ≤ n
35 zcn ⊢ n ∈ ℤ → n ∈ ℂ
36 1cnd ⊢ n ∈ ℤ → 1 ∈ ℂ
37 2cnne0 ⊢ 2 ∈ ℂ ∧ 2 ≠ 0
38 37 a1i ⊢ n ∈ ℤ → 2 ∈ ℂ ∧ 2 ≠ 0
39 muldivdir ⊢ n ∈ ℂ ∧ 1 ∈ ℂ ∧ 2 ∈ ℂ ∧ 2 ≠ 0 → 2 ⁢ n + 1 2 = n + 1 2
40 35 36 38 39 syl3anc ⊢ n ∈ ℤ → 2 ⁢ n + 1 2 = n + 1 2
41 40 breq2d ⊢ n ∈ ℤ → M < 2 ⁢ n + 1 2 ↔ M < n + 1 2
42 41 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → M < 2 ⁢ n + 1 2 ↔ M < n + 1 2
43 2z ⊢ 2 ∈ ℤ
44 43 a1i ⊢ n ∈ ℤ → 2 ∈ ℤ
45 id ⊢ n ∈ ℤ → n ∈ ℤ
46 44 45 zmulcld ⊢ n ∈ ℤ → 2 ⁢ n ∈ ℤ
47 46 zcnd ⊢ n ∈ ℤ → 2 ⁢ n ∈ ℂ
48 47 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → 2 ⁢ n ∈ ℂ
49 pncan1 ⊢ 2 ⁢ n ∈ ℂ → 2 ⁢ n + 1 - 1 = 2 ⁢ n
50 48 49 syl ⊢ n ∈ ℤ ∧ M ∈ ℤ → 2 ⁢ n + 1 - 1 = 2 ⁢ n
51 50 oveq1d ⊢ n ∈ ℤ ∧ M ∈ ℤ → 2 ⁢ n + 1 - 1 2 = 2 ⁢ n 2
52 2cnd ⊢ n ∈ ℤ → 2 ∈ ℂ
53 2ne0 ⊢ 2 ≠ 0
54 53 a1i ⊢ n ∈ ℤ → 2 ≠ 0
55 35 52 54 divcan3d ⊢ n ∈ ℤ → 2 ⁢ n 2 = n
56 55 adantr ⊢ n ∈ ℤ ∧ M ∈ ℤ → 2 ⁢ n 2 = n
57 51 56 eqtrd ⊢ n ∈ ℤ ∧ M ∈ ℤ → 2 ⁢ n + 1 - 1 2 = n
58 57 breq2d ⊢ n ∈ ℤ ∧ M ∈ ℤ → M ≤ 2 ⁢ n + 1 - 1 2 ↔ M ≤ n
59 34 42 58 3bitr4d ⊢ n ∈ ℤ ∧ M ∈ ℤ → M < 2 ⁢ n + 1 2 ↔ M ≤ 2 ⁢ n + 1 - 1 2
60 oveq1 ⊢ 2 ⁢ n + 1 = N → 2 ⁢ n + 1 2 = N 2
61 60 breq2d ⊢ 2 ⁢ n + 1 = N → M < 2 ⁢ n + 1 2 ↔ M < N 2
62 oveq1 ⊢ 2 ⁢ n + 1 = N → 2 ⁢ n + 1 - 1 = N − 1
63 62 oveq1d ⊢ 2 ⁢ n + 1 = N → 2 ⁢ n + 1 - 1 2 = N − 1 2
64 63 breq2d ⊢ 2 ⁢ n + 1 = N → M ≤ 2 ⁢ n + 1 - 1 2 ↔ M ≤ N − 1 2
65 61 64 bibi12d ⊢ 2 ⁢ n + 1 = N → M < 2 ⁢ n + 1 2 ↔ M ≤ 2 ⁢ n + 1 - 1 2 ↔ M < N 2 ↔ M ≤ N − 1 2
66 59 65 syl5ibcom ⊢ n ∈ ℤ ∧ M ∈ ℤ → 2 ⁢ n + 1 = N → M < N 2 ↔ M ≤ N − 1 2
67 66 ex ⊢ n ∈ ℤ → M ∈ ℤ → 2 ⁢ n + 1 = N → M < N 2 ↔ M ≤ N − 1 2
68 67 adantl ⊢ N ∈ ℤ ∧ n ∈ ℤ → M ∈ ℤ → 2 ⁢ n + 1 = N → M < N 2 ↔ M ≤ N − 1 2
69 68 com23 ⊢ N ∈ ℤ ∧ n ∈ ℤ → 2 ⁢ n + 1 = N → M ∈ ℤ → M < N 2 ↔ M ≤ N − 1 2
70 69 rexlimdva ⊢ N ∈ ℤ → ∃ n ∈ ℤ 2 ⁢ n + 1 = N → M ∈ ℤ → M < N 2 ↔ M ≤ N − 1 2
71 1 70 sylbid ⊢ N ∈ ℤ → ¬ 2 ∥ N → M ∈ ℤ → M < N 2 ↔ M ≤ N − 1 2
72 71 3imp ⊢ N ∈ ℤ ∧ ¬ 2 ∥ N ∧ M ∈ ℤ → M < N 2 ↔ M ≤ N − 1 2