| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ceim1l | Structured version Visualization version GIF version | ||
| Description: One less than the ceiling of a real number is strictly less than that number. (Contributed by Jeff Hankins, 10-Jun-2007.) |
| Ref | Expression |
|---|---|
| ceim1l | ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) < 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | renegcl 11544 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 2 | reflcl 13811 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℝ) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℝ) |
| 4 | 3 | recnd 11261 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℂ) |
| 5 | ax-1cn 11185 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | negdi 11538 | . . . 4 ⊢ (((⌊‘-𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → -((⌊‘-𝐴) + 1) = (-(⌊‘-𝐴) + -1)) | |
| 7 | 4, 5, 6 | sylancl 586 | . . 3 ⊢ (𝐴 ∈ ℝ → -((⌊‘-𝐴) + 1) = (-(⌊‘-𝐴) + -1)) |
| 8 | 4 | negcld 11579 | . . . 4 ⊢ (𝐴 ∈ ℝ → -(⌊‘-𝐴) ∈ ℂ) |
| 9 | negsub 11529 | . . . 4 ⊢ ((-(⌊‘-𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → (-(⌊‘-𝐴) + -1) = (-(⌊‘-𝐴) − 1)) | |
| 10 | 8, 5, 9 | sylancl 586 | . . 3 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) + -1) = (-(⌊‘-𝐴) − 1)) |
| 11 | 7, 10 | eqtr2d 2771 | . 2 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) = -((⌊‘-𝐴) + 1)) |
| 12 | peano2re 11406 | . . . 4 ⊢ ((⌊‘-𝐴) ∈ ℝ → ((⌊‘-𝐴) + 1) ∈ ℝ) | |
| 13 | 3, 12 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℝ → ((⌊‘-𝐴) + 1) ∈ ℝ) |
| 14 | flltp1 13815 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ → -𝐴 < ((⌊‘-𝐴) + 1)) | |
| 15 | 1, 14 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 < ((⌊‘-𝐴) + 1)) |
| 16 | 15 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → -𝐴 < ((⌊‘-𝐴) + 1)) |
| 17 | ltnegcon1 11736 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → (-𝐴 < ((⌊‘-𝐴) + 1) ↔ -((⌊‘-𝐴) + 1) < 𝐴)) | |
| 18 | 16, 17 | mpbid 232 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → -((⌊‘-𝐴) + 1) < 𝐴) |
| 19 | 13, 18 | mpdan 687 | . 2 ⊢ (𝐴 ∈ ℝ → -((⌊‘-𝐴) + 1) < 𝐴) |
| 20 | 11, 19 | eqbrtrd 5141 | 1 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) < 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 class class class wbr 5119 ‘cfv 6530 (class class class)co 7403 ℂcc 11125 ℝcr 11126 1c1 11128 + caddc 11130 < clt 11267 − cmin 11464 -cneg 11465 ⌊cfl 13805 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-riota 7360 df-ov 7406 df-oprab 7407 df-mpo 7408 df-om 7860 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-er 8717 df-en 8958 df-dom 8959 df-sdom 8960 df-sup 9452 df-inf 9453 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11466 df-neg 11467 df-nn 12239 df-n0 12500 df-z 12587 df-uz 12851 df-fl 13807 |
| This theorem is referenced by: ceilm1lt 13863 ceile 13864 ltflcei 37578 |
| Copyright terms: Public domain | W3C validator |