| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fldiv4lem1div2uz2 | 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 9765 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℤ) | |
| 2 | 4nn 9307 | . . . . 5 ⊢ 4 ∈ ℕ | |
| 3 | znq 9858 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 4 ∈ ℕ) → (𝑁 / 4) ∈ ℚ) | |
| 4 | 1, 2, 3 | sylancl 413 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) ∈ ℚ) |
| 5 | 4 | flqcld 10538 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ∈ ℤ) |
| 6 | 5 | zred 9602 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ∈ ℝ) |
| 7 | eluzelre 9766 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℝ) | |
| 8 | 2 | a1i 9 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → 4 ∈ ℕ) |
| 9 | 7, 8 | nndivred 9193 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) ∈ ℝ) |
| 10 | peano2rem 8446 | . . . 4 ⊢ (𝑁 ∈ ℝ → (𝑁 − 1) ∈ ℝ) | |
| 11 | 7, 10 | syl 14 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℝ) |
| 12 | 11 | rehalfcld 9391 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 − 1) / 2) ∈ ℝ) |
| 13 | flqle 10539 | . . 3 ⊢ ((𝑁 / 4) ∈ ℚ → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) | |
| 14 | 4, 13 | syl 14 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) |
| 15 | 1red 8194 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → 1 ∈ ℝ) | |
| 16 | zre 9483 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 17 | rehalfcl 9371 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (𝑁 / 2) ∈ ℝ) | |
| 18 | 1, 16, 17 | 3syl 17 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ∈ ℝ) |
| 19 | 2rp 9893 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 20 | eluzle 9768 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ≤ 𝑁) | |
| 21 | divge1 9958 | . . . . . 6 ⊢ ((2 ∈ ℝ+ ∧ 𝑁 ∈ ℝ ∧ 2 ≤ 𝑁) → 1 ≤ (𝑁 / 2)) | |
| 22 | 19, 7, 20, 21 | mp3an2i 1378 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → 1 ≤ (𝑁 / 2)) |
| 23 | eluzelcn 9767 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℂ) | |
| 24 | subhalfhalf 9379 | . . . . . 6 ⊢ (𝑁 ∈ ℂ → (𝑁 − (𝑁 / 2)) = (𝑁 / 2)) | |
| 25 | 23, 24 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − (𝑁 / 2)) = (𝑁 / 2)) |
| 26 | 22, 25 | breqtrrd 4116 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → 1 ≤ (𝑁 − (𝑁 / 2))) |
| 27 | 15, 7, 18, 26 | lesubd 8729 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ≤ (𝑁 − 1)) |
| 28 | 2t2e4 9298 | . . . . . . . . 9 ⊢ (2 · 2) = 4 | |
| 29 | 28 | eqcomi 2235 | . . . . . . . 8 ⊢ 4 = (2 · 2) |
| 30 | 29 | a1i 9 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 4 = (2 · 2)) |
| 31 | 30 | oveq2d 6034 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = (𝑁 / (2 · 2))) |
| 32 | 2cnd 9216 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℂ) | |
| 33 | 19 | a1i 9 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℝ+) |
| 34 | 33 | rpap0d 9937 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 # 0) |
| 35 | 23, 32, 32, 34, 34 | divdivap1d 9002 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 2) / 2) = (𝑁 / (2 · 2))) |
| 36 | 31, 35 | eqtr4d 2267 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = ((𝑁 / 2) / 2)) |
| 37 | 36 | breq1d 4098 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 4) ≤ ((𝑁 − 1) / 2) ↔ ((𝑁 / 2) / 2) ≤ ((𝑁 − 1) / 2))) |
| 38 | 18, 11, 33 | lediv1d 9978 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 2) ≤ (𝑁 − 1) ↔ ((𝑁 / 2) / 2) ≤ ((𝑁 − 1) / 2))) |
| 39 | 37, 38 | bitr4d 191 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 4) ≤ ((𝑁 − 1) / 2) ↔ (𝑁 / 2) ≤ (𝑁 − 1))) |
| 40 | 27, 39 | mpbird 167 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) ≤ ((𝑁 − 1) / 2)) |
| 41 | 6, 9, 12, 14, 40 | letrd 8303 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 class class class wbr 4088 ‘cfv 5326 (class class class)co 6018 ℂcc 8030 ℝcr 8031 1c1 8033 · cmul 8037 ≤ cle 8215 − cmin 8350 / cdiv 8852 ℕcn 9143 2c2 9194 4c4 9196 ℤcz 9479 ℤ≥cuz 9755 ℚcq 9853 ℝ+crp 9888 ⌊cfl 10529 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-mulrcl 8131 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-precex 8142 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 ax-pre-mulgt0 8149 ax-pre-mulext 8150 ax-arch 8151 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-reap 8755 df-ap 8762 df-div 8853 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-n0 9403 df-z 9480 df-uz 9756 df-q 9854 df-rp 9889 df-fl 10531 |
| This theorem is referenced by: fldiv4lem1div2 10568 gausslemma2dlem4 15799 |
| Copyright terms: Public domain | W3C validator |