Metamath Proof Explorer


Theorem fldiv4lem1div2uz2

Description: The floor of an integer greater than 1, divided by 4 is less than or equal to the half of the integer minus 1. (Contributed by AV, 5-Jul-2021) (Proof shortened by AV, 9-Jul-2022)

Ref Expression
Assertion fldiv4lem1div2uz2 ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N − 1 2

Proof

Step Hyp Ref Expression
1 eluzelz ⊢ N ∈ ℤ ≥ 2 → N ∈ ℤ
2 zre ⊢ N ∈ ℤ → N ∈ ℝ
3 id ⊢ N ∈ ℝ → N ∈ ℝ
4 4re ⊢ 4 ∈ ℝ
5 4 a1i ⊢ N ∈ ℝ → 4 ∈ ℝ
6 4ne0 ⊢ 4 ≠ 0
7 6 a1i ⊢ N ∈ ℝ → 4 ≠ 0
8 3 5 7 redivcld ⊢ N ∈ ℝ → N 4 ∈ ℝ
9 flle ⊢ N 4 ∈ ℝ → N 4 ≤ N 4
10 1 2 8 9 4syl ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N 4
11 ge2halflem1 ⊢ N ∈ ℤ ≥ 2 → N 2 ≤ N − 1
12 2t2e4 ⊢ 2 ⋅ 2 = 4
13 12 eqcomi ⊢ 4 = 2 ⋅ 2
14 13 a1i ⊢ N ∈ ℤ ≥ 2 → 4 = 2 ⋅ 2
15 14 oveq2d ⊢ N ∈ ℤ ≥ 2 → N 4 = N 2 ⋅ 2
16 eluzelcn ⊢ N ∈ ℤ ≥ 2 → N ∈ ℂ
17 2cnne0 ⊢ 2 ∈ ℂ ∧ 2 ≠ 0
18 17 a1i ⊢ N ∈ ℤ ≥ 2 → 2 ∈ ℂ ∧ 2 ≠ 0
19 divdiv1 ⊢ N ∈ ℂ ∧ 2 ∈ ℂ ∧ 2 ≠ 0 ∧ 2 ∈ ℂ ∧ 2 ≠ 0 → N 2 2 = N 2 ⋅ 2
20 16 18 18 19 syl3anc ⊢ N ∈ ℤ ≥ 2 → N 2 2 = N 2 ⋅ 2
21 15 20 eqtr4d ⊢ N ∈ ℤ ≥ 2 → N 4 = N 2 2
22 21 breq1d ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N − 1 2 ↔ N 2 2 ≤ N − 1 2
23 rehalfcl ⊢ N ∈ ℝ → N 2 ∈ ℝ
24 1 2 23 3syl ⊢ N ∈ ℤ ≥ 2 → N 2 ∈ ℝ
25 eluzelre ⊢ N ∈ ℤ ≥ 2 → N ∈ ℝ
26 peano2rem ⊢ N ∈ ℝ → N − 1 ∈ ℝ
27 25 26 syl ⊢ N ∈ ℤ ≥ 2 → N − 1 ∈ ℝ
28 2rp ⊢ 2 ∈ ℝ +
29 28 a1i ⊢ N ∈ ℤ ≥ 2 → 2 ∈ ℝ +
30 24 27 29 lediv1d ⊢ N ∈ ℤ ≥ 2 → N 2 ≤ N − 1 ↔ N 2 2 ≤ N − 1 2
31 22 30 bitr4d ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N − 1 2 ↔ N 2 ≤ N − 1
32 11 31 mpbird ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N − 1 2
33 8 flcld ⊢ N ∈ ℝ → N 4 ∈ ℤ
34 33 zred ⊢ N ∈ ℝ → N 4 ∈ ℝ
35 26 rehalfcld ⊢ N ∈ ℝ → N − 1 2 ∈ ℝ
36 34 8 35 3jca ⊢ N ∈ ℝ → N 4 ∈ ℝ ∧ N 4 ∈ ℝ ∧ N − 1 2 ∈ ℝ
37 letr ⊢ N 4 ∈ ℝ ∧ N 4 ∈ ℝ ∧ N − 1 2 ∈ ℝ → N 4 ≤ N 4 ∧ N 4 ≤ N − 1 2 → N 4 ≤ N − 1 2
38 1 2 36 37 4syl ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N 4 ∧ N 4 ≤ N − 1 2 → N 4 ≤ N − 1 2
39 10 32 38 mp2and ⊢ N ∈ ℤ ≥ 2 → N 4 ≤ N − 1 2