| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fldiv4lem1div2uz2 | Structured version Visualization version GIF version | ||
| 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 |
|---|---|
| fldiv4lem1div2uz2 | ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eluzelz 13015 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℤ) | |
| 2 | zre 12737 | . . 3 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 3 | id 23 | . . . 4 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℝ) | |
| 4 | 4re 12467 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 5 | 4 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℝ → 4 ∈ ℝ) |
| 6 | 4ne0 12494 | . . . . 5 ⊢ 4 ≠ 0 | |
| 7 | 6 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℝ → 4 ≠ 0) |
| 8 | 3, 5, 7 | redivcld 12185 | . . 3 ⊢ (𝑁 ∈ ℝ → (𝑁 / 4) ∈ ℝ) |
| 9 | flle 13979 | . . 3 ⊢ ((𝑁 / 4) ∈ ℝ → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) | |
| 10 | 1, 2, 8, 9 | 4syl 20 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) |
| 11 | ge2halflem1 13277 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ≤ (𝑁 − 1)) | |
| 12 | 2t2e4 12546 | . . . . . . . . 9 ⊢ (2 · 2) = 4 | |
| 13 | 12 | eqcomi 2772 | . . . . . . . 8 ⊢ 4 = (2 · 2) |
| 14 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 4 = (2 · 2)) |
| 15 | 14 | oveq2d 7467 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = (𝑁 / (2 · 2))) |
| 16 | eluzelcn 13017 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℂ) | |
| 17 | 2cnne0 12595 | . . . . . . . 8 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | |
| 18 | 17 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → (2 ∈ ℂ ∧ 2 ≠ 0)) |
| 19 | divdiv1 12068 | . . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ (2 ∈ ℂ ∧ 2 ≠ 0)) → ((𝑁 / 2) / 2) = (𝑁 / (2 · 2))) | |
| 20 | 16, 18, 18, 19 | syl3anc 1399 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 2) / 2) = (𝑁 / (2 · 2))) |
| 21 | 15, 20 | eqtr4d 2801 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = ((𝑁 / 2) / 2)) |
| 22 | 21 | breq1d 5118 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 4) ≤ ((𝑁 − 1) / 2) ↔ ((𝑁 / 2) / 2) ≤ ((𝑁 − 1) / 2))) |
| 23 | rehalfcl 12613 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 / 2) ∈ ℝ) | |
| 24 | 1, 2, 23 | 3syl 19 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ∈ ℝ) |
| 25 | eluzelre 13016 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℝ) | |
| 26 | peano2rem 11664 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 − 1) ∈ ℝ) | |
| 27 | 25, 26 | syl 18 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℝ) |
| 28 | 2rp 13165 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 29 | 28 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℝ+) |
| 30 | 24, 27, 29 | lediv1d 13250 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 2) ≤ (𝑁 − 1) ↔ ((𝑁 / 2) / 2) ≤ ((𝑁 − 1) / 2))) |
| 31 | 22, 30 | bitr4d 285 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 4) ≤ ((𝑁 − 1) / 2) ↔ (𝑁 / 2) ≤ (𝑁 − 1))) |
| 32 | 11, 31 | mpbird 260 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) ≤ ((𝑁 − 1) / 2)) |
| 33 | 8 | flcld 13978 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (⌊‘(𝑁 / 4)) ∈ ℤ) |
| 34 | 33 | zred 12843 | . . . 4 ⊢ (𝑁 ∈ ℝ → (⌊‘(𝑁 / 4)) ∈ ℝ) |
| 35 | 26 | rehalfcld 12633 | . . . 4 ⊢ (𝑁 ∈ ℝ → ((𝑁 − 1) / 2) ∈ ℝ) |
| 36 | 34, 8, 35 | 3jca 1146 | . . 3 ⊢ (𝑁 ∈ ℝ → ((⌊‘(𝑁 / 4)) ∈ ℝ ∧ (𝑁 / 4) ∈ ℝ ∧ ((𝑁 − 1) / 2) ∈ ℝ)) |
| 37 | letr 11443 | . . 3 ⊢ (((⌊‘(𝑁 / 4)) ∈ ℝ ∧ (𝑁 / 4) ∈ ℝ ∧ ((𝑁 − 1) / 2) ∈ ℝ) → (((⌊‘(𝑁 / 4)) ≤ (𝑁 / 4) ∧ (𝑁 / 4) ≤ ((𝑁 − 1) / 2)) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2))) | |
| 38 | 1, 2, 36, 37 | 4syl 20 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (((⌊‘(𝑁 / 4)) ≤ (𝑁 / 4) ∧ (𝑁 / 4) ≤ ((𝑁 − 1) / 2)) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2))) |
| 39 | 10, 32, 38 | mp2and 712 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 ℝcr 11238 0cc0 11239 1c1 11240 · cmul 11244 ≤ cle 11383 − cmin 11580 / cdiv 12013 2c2 12437 4c4 12439 ℤcz 12733 ℤ≥cuz 13005 ℝ+crp 13160 ⌊cfl 13970 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-fl 13972 |
| This theorem is used by: fldiv4lem1div2 14017 gausslemma2dlem4 27753 |
| Copyright terms: Public domain | W3C validator |