| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > flhalf | Structured version Visualization version GIF version | ||
| Description: Ordering relation for the floor of half of an integer. (Contributed by NM, 1-Jan-2006.) (Proof shortened by Mario Carneiro, 7-Jun-2016.) |
| Ref | Expression |
|---|---|
| flhalf | ⊢ (𝑁 ∈ ℤ → 𝑁 ≤ (2 · (⌊‘((𝑁 + 1) / 2)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zre 12586 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 2 | peano2re 11371 | . . . . . . . 8 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ) | |
| 3 | 1, 2 | syl 18 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℝ) |
| 4 | 3 | rehalfcld 12482 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → ((𝑁 + 1) / 2) ∈ ℝ) |
| 5 | flltp1 13824 | . . . . . 6 ⊢ (((𝑁 + 1) / 2) ∈ ℝ → ((𝑁 + 1) / 2) < ((⌊‘((𝑁 + 1) / 2)) + 1)) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝑁 ∈ ℤ → ((𝑁 + 1) / 2) < ((⌊‘((𝑁 + 1) / 2)) + 1)) |
| 7 | 4 | flcld 13822 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (⌊‘((𝑁 + 1) / 2)) ∈ ℤ) |
| 8 | 7 | zred 12691 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (⌊‘((𝑁 + 1) / 2)) ∈ ℝ) |
| 9 | 1red 11197 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 1 ∈ ℝ) | |
| 10 | 8, 9 | readdcld 11226 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → ((⌊‘((𝑁 + 1) / 2)) + 1) ∈ ℝ) |
| 11 | 2rp 13012 | . . . . . . 7 ⊢ 2 ∈ ℝ+ | |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℝ+) |
| 13 | 3, 10, 12 | ltdivmuld 13102 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (((𝑁 + 1) / 2) < ((⌊‘((𝑁 + 1) / 2)) + 1) ↔ (𝑁 + 1) < (2 · ((⌊‘((𝑁 + 1) / 2)) + 1)))) |
| 14 | 6, 13 | mpbid 235 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) < (2 · ((⌊‘((𝑁 + 1) / 2)) + 1))) |
| 15 | 9 | recnd 11225 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 1 ∈ ℂ) |
| 16 | 15 | 2timesd 12478 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (2 · 1) = (1 + 1)) |
| 17 | 16 | oveq2d 7416 | . . . . 5 ⊢ (𝑁 ∈ ℤ → ((2 · (⌊‘((𝑁 + 1) / 2))) + (2 · 1)) = ((2 · (⌊‘((𝑁 + 1) / 2))) + (1 + 1))) |
| 18 | 2cnd 12310 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℂ) | |
| 19 | 8 | recnd 11225 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (⌊‘((𝑁 + 1) / 2)) ∈ ℂ) |
| 20 | 18, 19, 15 | adddid 11221 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (2 · ((⌊‘((𝑁 + 1) / 2)) + 1)) = ((2 · (⌊‘((𝑁 + 1) / 2))) + (2 · 1))) |
| 21 | 2re 12306 | . . . . . . . . 9 ⊢ 2 ∈ ℝ | |
| 22 | 21 | a1i 11 | . . . . . . . 8 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℝ) |
| 23 | 22, 8 | remulcld 11227 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → (2 · (⌊‘((𝑁 + 1) / 2))) ∈ ℝ) |
| 24 | 23 | recnd 11225 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (2 · (⌊‘((𝑁 + 1) / 2))) ∈ ℂ) |
| 25 | 24, 15, 15 | addassd 11219 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (((2 · (⌊‘((𝑁 + 1) / 2))) + 1) + 1) = ((2 · (⌊‘((𝑁 + 1) / 2))) + (1 + 1))) |
| 26 | 17, 20, 25 | 3eqtr4d 2810 | . . . 4 ⊢ (𝑁 ∈ ℤ → (2 · ((⌊‘((𝑁 + 1) / 2)) + 1)) = (((2 · (⌊‘((𝑁 + 1) / 2))) + 1) + 1)) |
| 27 | 14, 26 | breqtrd 5131 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) < (((2 · (⌊‘((𝑁 + 1) / 2))) + 1) + 1)) |
| 28 | 23, 9 | readdcld 11226 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((2 · (⌊‘((𝑁 + 1) / 2))) + 1) ∈ ℝ) |
| 29 | 1, 28, 9 | ltadd1d 11795 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 < ((2 · (⌊‘((𝑁 + 1) / 2))) + 1) ↔ (𝑁 + 1) < (((2 · (⌊‘((𝑁 + 1) / 2))) + 1) + 1))) |
| 30 | 27, 29 | mpbird 260 | . 2 ⊢ (𝑁 ∈ ℤ → 𝑁 < ((2 · (⌊‘((𝑁 + 1) / 2))) + 1)) |
| 31 | 2z 12617 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 32 | 31 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℤ → 2 ∈ ℤ) |
| 33 | 32, 7 | zmulcld 12697 | . . 3 ⊢ (𝑁 ∈ ℤ → (2 · (⌊‘((𝑁 + 1) / 2))) ∈ ℤ) |
| 34 | zleltp1 12636 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ (2 · (⌊‘((𝑁 + 1) / 2))) ∈ ℤ) → (𝑁 ≤ (2 · (⌊‘((𝑁 + 1) / 2))) ↔ 𝑁 < ((2 · (⌊‘((𝑁 + 1) / 2))) + 1))) | |
| 35 | 33, 34 | mpdan 699 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 ≤ (2 · (⌊‘((𝑁 + 1) / 2))) ↔ 𝑁 < ((2 · (⌊‘((𝑁 + 1) / 2))) + 1))) |
| 36 | 30, 35 | mpbird 260 | 1 ⊢ (𝑁 ∈ ℤ → 𝑁 ≤ (2 · (⌊‘((𝑁 + 1) / 2)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∈ wcel 2145 class class class wbr 5105 ‘cfv 6525 (class class class)co 7400 ℝcr 11087 1c1 11089 + caddc 11091 · cmul 11093 < clt 11231 ≤ cle 11232 / cdiv 11859 2c2 12286 ℤcz 12582 ℝ+crp 13007 ⌊cfl 13814 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-sup 9390 df-inf 9391 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-n0 12496 df-z 12583 df-uz 12854 df-rp 13008 df-fl 13816 |
| This theorem is referenced by: ovolunlem1a 25616 |
| Copyright terms: Public domain | W3C validator |