| 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 9941 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℤ) | |
| 2 | 4nn 9473 | . . . . 5 ⊢ 4 ∈ ℕ | |
| 3 | znq 10034 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 4 ∈ ℕ) → (𝑁 / 4) ∈ ℚ) | |
| 4 | 1, 2, 3 | sylancl 417 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) ∈ ℚ) |
| 5 | 4 | flqcld 10725 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ∈ ℤ) |
| 6 | 5 | zred 9773 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ∈ ℝ) |
| 7 | eluzelre 9942 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℝ) | |
| 8 | 2 | a1i 9 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → 4 ∈ ℕ) |
| 9 | 7, 8 | nndivred 9357 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) ∈ ℝ) |
| 10 | peano2rem 8595 | . . . 4 ⊢ (𝑁 ∈ ℝ → (𝑁 − 1) ∈ ℝ) | |
| 11 | 7, 10 | syl 14 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − 1) ∈ ℝ) |
| 12 | 11 | rehalfcld 9557 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 − 1) / 2) ∈ ℝ) |
| 13 | flqle 10726 | . . 3 ⊢ ((𝑁 / 4) ∈ ℚ → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) | |
| 14 | 4, 13 | syl 14 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ (𝑁 / 4)) |
| 15 | 1red 8342 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → 1 ∈ ℝ) | |
| 16 | zre 9653 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 17 | rehalfcl 9537 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (𝑁 / 2) ∈ ℝ) | |
| 18 | 1, 16, 17 | 3syl 17 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ∈ ℝ) |
| 19 | 2rp 10070 | . . . . . 6 ⊢ 2 ∈ ℝ+ | |
| 20 | eluzle 9944 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ≤ 𝑁) | |
| 21 | divge1 10135 | . . . . . 6 ⊢ ((2 ∈ ℝ+ ∧ 𝑁 ∈ ℝ ∧ 2 ≤ 𝑁) → 1 ≤ (𝑁 / 2)) | |
| 22 | 19, 7, 20, 21 | mp3an2i 1383 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → 1 ≤ (𝑁 / 2)) |
| 23 | eluzelcn 9943 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → 𝑁 ∈ ℂ) | |
| 24 | subhalfhalf 9545 | . . . . . 6 ⊢ (𝑁 ∈ ℂ → (𝑁 − (𝑁 / 2)) = (𝑁 / 2)) | |
| 25 | 23, 24 | syl 14 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 − (𝑁 / 2)) = (𝑁 / 2)) |
| 26 | 22, 25 | breqtrrd 4158 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → 1 ≤ (𝑁 − (𝑁 / 2))) |
| 27 | 15, 7, 18, 26 | lesubd 8879 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 2) ≤ (𝑁 − 1)) |
| 28 | 2t2e4 9462 | . . . . . . . . 9 ⊢ (2 · 2) = 4 | |
| 29 | 28 | eqcomi 2242 | . . . . . . . 8 ⊢ 4 = (2 · 2) |
| 30 | 29 | a1i 9 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 4 = (2 · 2)) |
| 31 | 30 | oveq2d 6101 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = (𝑁 / (2 · 2))) |
| 32 | 2cnd 9380 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℂ) | |
| 33 | 19 | a1i 9 | . . . . . . . 8 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 ∈ ℝ+) |
| 34 | 33 | rpap0d 10114 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘2) → 2 # 0) |
| 35 | 23, 32, 32, 34, 34 | divdivap1d 9155 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 2) / 2) = (𝑁 / (2 · 2))) |
| 36 | 31, 35 | eqtr4d 2274 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘2) → (𝑁 / 4) = ((𝑁 / 2) / 2)) |
| 37 | 36 | breq1d 4140 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘2) → ((𝑁 / 4) ≤ ((𝑁 − 1) / 2) ↔ ((𝑁 / 2) / 2) ≤ ((𝑁 − 1) / 2))) |
| 38 | 18, 11, 33 | lediv1d 10155 | . . . 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 8452 | 1 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ∈ wcel 2209 class class class wbr 4130 ‘cfv 5377 (class class class)co 6085 ℂcc 8178 ℝcr 8179 1c1 8181 · cmul 8185 ≤ cle 8362 − cmin 8499 / cdiv 9005 ℕcn 9307 2c2 9358 4c4 9360 ℤcz 9649 ℤ≥cuz 9931 ℚcq 10029 ℝ+crp 10065 ⌊cfl 10714 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-mulrcl 8279 ax-addcom 8280 ax-mulcom 8281 ax-addass 8282 ax-mulass 8283 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-1rid 8287 ax-0id 8288 ax-rnegex 8289 ax-precex 8290 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-apti 8295 ax-pre-ltadd 8296 ax-pre-mulgt0 8297 ax-pre-mulext 8298 ax-arch 8299 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-po 4441 df-iso 4442 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-reap 8906 df-ap 8913 df-div 9006 df-inn 9308 df-2 9366 df-3 9367 df-4 9368 df-n0 9569 df-z 9650 df-uz 9932 df-q 10030 df-rp 10066 df-fl 10716 |
| This theorem is used by: fldiv4lem1div2 10756 gausslemma2dlem4 16305 |
| Copyright terms: Public domain | W3C validator |