| 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 12982 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℤ) | |
| 2 | zre 12704 | . . 3 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 3 | id 23 | . . . 4 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℝ) | |
| 4 | 4re 12434 | . . . . 5 ⊢ 4 ∈ ℝ | |
| 5 | 4 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℝ → 4 ∈ ℝ) |
| 6 | 4ne0 12461 | . . . . 5 ⊢ 4 ≠ 0 | |
| 7 | 6 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℝ → 4 ≠ 0) |
| 8 | 3, 5, 7 | redivcld 12152 | . . 3 ⊢ (𝑁 ∈ ℝ → (𝑁 / 4) ∈ ℝ) |
| 9 | flle 13946 | . . 3 ⊢ ((𝑁 / 4) ∈ ℝ → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) | |
| 10 | 1, 2, 8, 9 | 4syl 20 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) |
| 11 | ge2halflem1 13244 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ≤ (𝑁 − 1)) | |
| 12 | 2t2e4 12513 | . . . . . . . . 9 ⊢ (2 · 2) = 4 | |
| 13 | 12 | eqcomi 2769 | . . . . . . . 8 ⊢ 4 = (2 · 2) |
| 14 | 13 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 4 = (2 · 2)) |
| 15 | 14 | oveq2d 7440 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = (𝑁 / (2 · 2))) |
| 16 | eluzelcn 12984 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℂ) | |
| 17 | 2cnne0 12562 | . . . . . . . 8 ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | |
| 18 | 17 | a1i 11 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → (2 ∈ ℂ ∧ 2 ≠ 0)) |
| 19 | divdiv1 12035 | . . . . . . 7 ⊢ ((𝑁 ∈ ℂ ∧ (2 ∈ ℂ ∧ 2 ≠ 0) ∧ (2 ∈ ℂ ∧ 2 ≠ 0)) → ((𝑁 / 2) / 2) = (𝑁 / (2 · 2))) | |
| 20 | 16, 18, 18, 19 | syl3anc 1398 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 2) / 2) = (𝑁 / (2 · 2))) |
| 21 | 15, 20 | eqtr4d 2798 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = ((𝑁 / 2) / 2)) |
| 22 | 21 | breq1d 5112 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 4) ≤ ((𝑁 − 1) / 2) ↔ ((𝑁 / 2) / 2) ≤ ((𝑁 − 1) / 2))) |
| 23 | rehalfcl 12580 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 / 2) ∈ ℝ) | |
| 24 | 1, 2, 23 | 3syl 19 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ∈ ℝ) |
| 25 | eluzelre 12983 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℝ) | |
| 26 | peano2rem 11632 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 − 1) ∈ ℝ) | |
| 27 | 25, 26 | syl 18 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℝ) |
| 28 | 2rp 13132 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 29 | 28 | a1i 11 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℝ+) |
| 30 | 24, 27, 29 | lediv1d 13217 | . . . 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 13945 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (⌊‘(𝑁 / 4)) ∈ ℤ) |
| 34 | 33 | zred 12810 | . . . 4 ⊢ (𝑁 ∈ ℝ → (⌊‘(𝑁 / 4)) ∈ ℝ) |
| 35 | 26 | rehalfcld 12600 | . . . 4 ⊢ (𝑁 ∈ ℝ → ((𝑁 − 1) / 2) ∈ ℝ) |
| 36 | 34, 8, 35 | 3jca 1146 | . . 3 ⊢ (𝑁 ∈ ℝ → ((⌊‘(𝑁 / 4)) ∈ ℝ ∧ (𝑁 / 4) ∈ ℝ ∧ ((𝑁 − 1) / 2) ∈ ℝ)) |
| 37 | letr 11411 | . . 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 1569 ∈ wcel 2144 ≠ wne 2955 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 ℂcc 11205 ℝcr 11206 0cc0 11207 1c1 11208 · cmul 11212 ≤ cle 11351 − cmin 11548 / cdiv 11980 2c2 12404 4c4 12406 ℤcz 12700 ℤ≥cuz 12972 ℝ+crp 13127 ⌊cfl 13937 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-4 12414 df-n0 12614 df-z 12701 df-uz 12973 df-rp 13128 df-fl 13939 |
| This theorem is used by: fldiv4lem1div2 13984 gausslemma2dlem4 27705 |
| Copyright terms: Public domain | W3C validator |