| 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 11457 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 2 | reflcl 13755 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℝ) | |
| 3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℝ) |
| 4 | 3 | recnd 11173 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℂ) |
| 5 | ax-1cn 11096 | . . . 4 ⊢ 1 ∈ ℂ | |
| 6 | negdi 11451 | . . . 4 ⊢ (((⌊‘-𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → -((⌊‘-𝐴) + 1) = (-(⌊‘-𝐴) + -1)) | |
| 7 | 4, 5, 6 | sylancl 587 | . . 3 ⊢ (𝐴 ∈ ℝ → -((⌊‘-𝐴) + 1) = (-(⌊‘-𝐴) + -1)) |
| 8 | 4 | negcld 11492 | . . . 4 ⊢ (𝐴 ∈ ℝ → -(⌊‘-𝐴) ∈ ℂ) |
| 9 | negsub 11442 | . . . 4 ⊢ ((-(⌊‘-𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → (-(⌊‘-𝐴) + -1) = (-(⌊‘-𝐴) − 1)) | |
| 10 | 8, 5, 9 | sylancl 587 | . . 3 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) + -1) = (-(⌊‘-𝐴) − 1)) |
| 11 | 7, 10 | eqtr2d 2772 | . 2 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) = -((⌊‘-𝐴) + 1)) |
| 12 | peano2re 11319 | . . . 4 ⊢ ((⌊‘-𝐴) ∈ ℝ → ((⌊‘-𝐴) + 1) ∈ ℝ) | |
| 13 | 3, 12 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℝ → ((⌊‘-𝐴) + 1) ∈ ℝ) |
| 14 | flltp1 13759 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ → -𝐴 < ((⌊‘-𝐴) + 1)) | |
| 15 | 1, 14 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 < ((⌊‘-𝐴) + 1)) |
| 16 | 15 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → -𝐴 < ((⌊‘-𝐴) + 1)) |
| 17 | ltnegcon1 11651 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → (-𝐴 < ((⌊‘-𝐴) + 1) ↔ -((⌊‘-𝐴) + 1) < 𝐴)) | |
| 18 | 16, 17 | mpbid 232 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → -((⌊‘-𝐴) + 1) < 𝐴) |
| 19 | 13, 18 | mpdan 688 | . 2 ⊢ (𝐴 ∈ ℝ → -((⌊‘-𝐴) + 1) < 𝐴) |
| 20 | 11, 19 | eqbrtrd 5107 | 1 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) < 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 ℂcc 11036 ℝcr 11037 1c1 11039 + caddc 11041 < clt 11179 − cmin 11377 -cneg 11378 ⌊cfl 13749 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-fl 13751 |
| This theorem is referenced by: ceilm1lt 13807 ceile 13808 ltflcei 37929 |
| Copyright terms: Public domain | W3C validator |