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 11214 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
2 | reflcl 13444 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℝ) | |
3 | 1, 2 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℝ) |
4 | 3 | recnd 10934 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘-𝐴) ∈ ℂ) |
5 | ax-1cn 10860 | . . . 4 ⊢ 1 ∈ ℂ | |
6 | negdi 11208 | . . . 4 ⊢ (((⌊‘-𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → -((⌊‘-𝐴) + 1) = (-(⌊‘-𝐴) + -1)) | |
7 | 4, 5, 6 | sylancl 585 | . . 3 ⊢ (𝐴 ∈ ℝ → -((⌊‘-𝐴) + 1) = (-(⌊‘-𝐴) + -1)) |
8 | 4 | negcld 11249 | . . . 4 ⊢ (𝐴 ∈ ℝ → -(⌊‘-𝐴) ∈ ℂ) |
9 | negsub 11199 | . . . 4 ⊢ ((-(⌊‘-𝐴) ∈ ℂ ∧ 1 ∈ ℂ) → (-(⌊‘-𝐴) + -1) = (-(⌊‘-𝐴) − 1)) | |
10 | 8, 5, 9 | sylancl 585 | . . 3 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) + -1) = (-(⌊‘-𝐴) − 1)) |
11 | 7, 10 | eqtr2d 2779 | . 2 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) = -((⌊‘-𝐴) + 1)) |
12 | peano2re 11078 | . . . 4 ⊢ ((⌊‘-𝐴) ∈ ℝ → ((⌊‘-𝐴) + 1) ∈ ℝ) | |
13 | 3, 12 | syl 17 | . . 3 ⊢ (𝐴 ∈ ℝ → ((⌊‘-𝐴) + 1) ∈ ℝ) |
14 | flltp1 13448 | . . . . . 6 ⊢ (-𝐴 ∈ ℝ → -𝐴 < ((⌊‘-𝐴) + 1)) | |
15 | 1, 14 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ ℝ → -𝐴 < ((⌊‘-𝐴) + 1)) |
16 | 15 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → -𝐴 < ((⌊‘-𝐴) + 1)) |
17 | ltnegcon1 11406 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → (-𝐴 < ((⌊‘-𝐴) + 1) ↔ -((⌊‘-𝐴) + 1) < 𝐴)) | |
18 | 16, 17 | mpbid 231 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ ((⌊‘-𝐴) + 1) ∈ ℝ) → -((⌊‘-𝐴) + 1) < 𝐴) |
19 | 13, 18 | mpdan 683 | . 2 ⊢ (𝐴 ∈ ℝ → -((⌊‘-𝐴) + 1) < 𝐴) |
20 | 11, 19 | eqbrtrd 5092 | 1 ⊢ (𝐴 ∈ ℝ → (-(⌊‘-𝐴) − 1) < 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 1c1 10803 + caddc 10805 < clt 10940 − cmin 11135 -cneg 11136 ⌊cfl 13438 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-sup 9131 df-inf 9132 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-n0 12164 df-z 12250 df-uz 12512 df-fl 13440 |
This theorem is referenced by: ceilm1lt 13496 ceile 13497 ltflcei 35692 |
Copyright terms: Public domain | W3C validator |