| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fldiv4lem1div2 | GIF version | ||
| Description: The floor of a positive integer divided by 4 is less than or equal to the half of the integer minus 1. (Contributed by AV, 9-Jul-2021.) |
| Ref | Expression |
|---|---|
| fldiv4lem1div2 | ⊢ (𝑁 ∈ ℕ → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elnn1uz2 9990 | . 2 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2))) | |
| 2 | 1lt4 9462 | . . . . . 6 ⊢ 1 < 4 | |
| 3 | 1nn0 9562 | . . . . . . 7 ⊢ 1 ∈ ℕ0 | |
| 4 | 4nn 9451 | . . . . . . 7 ⊢ 4 ∈ ℕ | |
| 5 | divfl0 10714 | . . . . . . 7 ⊢ ((1 ∈ ℕ0 ∧ 4 ∈ ℕ) → (1 < 4 ↔ (⌊‘(1 / 4)) = 0)) | |
| 6 | 3, 4, 5 | mp2an 430 | . . . . . 6 ⊢ (1 < 4 ↔ (⌊‘(1 / 4)) = 0) |
| 7 | 2, 6 | mpbi 145 | . . . . 5 ⊢ (⌊‘(1 / 4)) = 0 |
| 8 | 1z 9653 | . . . . . . . . 9 ⊢ 1 ∈ ℤ | |
| 9 | znq 10007 | . . . . . . . . 9 ⊢ ((1 ∈ ℤ ∧ 4 ∈ ℕ) → (1 / 4) ∈ ℚ) | |
| 10 | 8, 4, 9 | mp2an 430 | . . . . . . . 8 ⊢ (1 / 4) ∈ ℚ |
| 11 | flqcl 10691 | . . . . . . . 8 ⊢ ((1 / 4) ∈ ℚ → (⌊‘(1 / 4)) ∈ ℤ) | |
| 12 | 10, 11 | ax-mp 5 | . . . . . . 7 ⊢ (⌊‘(1 / 4)) ∈ ℤ |
| 13 | 12 | zrei 9633 | . . . . . 6 ⊢ (⌊‘(1 / 4)) ∈ ℝ |
| 14 | 13 | eqlei 8413 | . . . . 5 ⊢ ((⌊‘(1 / 4)) = 0 → (⌊‘(1 / 4)) ≤ 0) |
| 15 | 7, 14 | mp1i 10 | . . . 4 ⊢ (𝑁 = 1 → (⌊‘(1 / 4)) ≤ 0) |
| 16 | fvoveq1 6102 | . . . 4 ⊢ (𝑁 = 1 → (⌊‘(𝑁 / 4)) = (⌊‘(1 / 4))) | |
| 17 | oveq1 6086 | . . . . . . 7 ⊢ (𝑁 = 1 → (𝑁 − 1) = (1 − 1)) | |
| 18 | 1m1e0 9356 | . . . . . . 7 ⊢ (1 − 1) = 0 | |
| 19 | 17, 18 | eqtrdi 2287 | . . . . . 6 ⊢ (𝑁 = 1 → (𝑁 − 1) = 0) |
| 20 | 19 | oveq1d 6094 | . . . . 5 ⊢ (𝑁 = 1 → ((𝑁 − 1) / 2) = (0 / 2)) |
| 21 | 2cn 9358 | . . . . . 6 ⊢ 2 ∈ ℂ | |
| 22 | 2ap0 9380 | . . . . . 6 ⊢ 2 # 0 | |
| 23 | 21, 22 | div0api 9070 | . . . . 5 ⊢ (0 / 2) = 0 |
| 24 | 20, 23 | eqtrdi 2287 | . . . 4 ⊢ (𝑁 = 1 → ((𝑁 − 1) / 2) = 0) |
| 25 | 15, 16, 24 | 3brtr4d 4160 | . . 3 ⊢ (𝑁 = 1 → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| 26 | fldiv4lem1div2uz2 10724 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘2) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) | |
| 27 | 25, 26 | jaoi 728 | . 2 ⊢ ((𝑁 = 1 ∨ 𝑁 ∈ (ℤ≥‘2)) → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| 28 | 1, 27 | sylbi 121 | 1 ⊢ (𝑁 ∈ ℕ → (⌊‘(𝑁 / 4)) ≤ ((𝑁 − 1) / 2)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∨ wo 720 = wceq 1402 ∈ wcel 2209 class class class wbr 4128 ‘cfv 5375 (class class class)co 6079 0cc0 8173 1c1 8174 < clt 8354 ≤ cle 8355 − cmin 8491 / cdiv 8996 ℕcn 9287 2c2 9338 4c4 9340 ℕ0cn0 9546 ℤcz 9627 ℤ≥cuz 9904 ℚcq 10002 ⌊cfl 10686 |
| 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 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 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-mulrcl 8272 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-precex 8283 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 ax-pre-mulgt0 8290 ax-pre-mulext 8291 ax-arch 8292 |
| This theorem depends on definitions: df-bi 117 df-dc 847 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 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-po 4439 df-iso 4440 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-reap 8897 df-ap 8904 df-div 8997 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-n0 9547 df-z 9628 df-uz 9905 df-q 10003 df-rp 10038 df-fl 10688 |
| This theorem is referenced by: gausslemma2dlem0g 16157 |
| Copyright terms: Public domain | W3C validator |