Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rddif | Structured version Visualization version GIF version |
Description: The difference between a real number and its nearest integer is less than or equal to one half. (Contributed by Jeff Madsen, 2-Sep-2009.) (Proof shortened by Mario Carneiro, 14-Sep-2015.) |
Ref | Expression |
---|---|
rddif | ⊢ (𝐴 ∈ ℝ → (abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴)) ≤ (1 / 2)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | halfcn 12118 | . . . . . . . 8 ⊢ (1 / 2) ∈ ℂ | |
2 | 1 | 2timesi 12041 | . . . . . . 7 ⊢ (2 · (1 / 2)) = ((1 / 2) + (1 / 2)) |
3 | 2cn 11978 | . . . . . . . 8 ⊢ 2 ∈ ℂ | |
4 | 2ne0 12007 | . . . . . . . 8 ⊢ 2 ≠ 0 | |
5 | 3, 4 | recidi 11636 | . . . . . . 7 ⊢ (2 · (1 / 2)) = 1 |
6 | 2, 5 | eqtr3i 2768 | . . . . . 6 ⊢ ((1 / 2) + (1 / 2)) = 1 |
7 | 6 | oveq2i 7266 | . . . . 5 ⊢ ((𝐴 − (1 / 2)) + ((1 / 2) + (1 / 2))) = ((𝐴 − (1 / 2)) + 1) |
8 | recn 10892 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
9 | 1 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (1 / 2) ∈ ℂ) |
10 | 8, 9, 9 | nppcan3d 11289 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((𝐴 − (1 / 2)) + ((1 / 2) + (1 / 2))) = (𝐴 + (1 / 2))) |
11 | 7, 10 | eqtr3id 2793 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((𝐴 − (1 / 2)) + 1) = (𝐴 + (1 / 2))) |
12 | halfre 12117 | . . . . . 6 ⊢ (1 / 2) ∈ ℝ | |
13 | readdcl 10885 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → (𝐴 + (1 / 2)) ∈ ℝ) | |
14 | 12, 13 | mpan2 687 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) ∈ ℝ) |
15 | fllep1 13449 | . . . . 5 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (𝐴 + (1 / 2)) ≤ ((⌊‘(𝐴 + (1 / 2))) + 1)) | |
16 | 14, 15 | syl 17 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) ≤ ((⌊‘(𝐴 + (1 / 2))) + 1)) |
17 | 11, 16 | eqbrtrd 5092 | . . 3 ⊢ (𝐴 ∈ ℝ → ((𝐴 − (1 / 2)) + 1) ≤ ((⌊‘(𝐴 + (1 / 2))) + 1)) |
18 | resubcl 11215 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → (𝐴 − (1 / 2)) ∈ ℝ) | |
19 | 12, 18 | mpan2 687 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 − (1 / 2)) ∈ ℝ) |
20 | reflcl 13444 | . . . . 5 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ) | |
21 | 14, 20 | syl 17 | . . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ) |
22 | 1red 10907 | . . . 4 ⊢ (𝐴 ∈ ℝ → 1 ∈ ℝ) | |
23 | 19, 21, 22 | leadd1d 11499 | . . 3 ⊢ (𝐴 ∈ ℝ → ((𝐴 − (1 / 2)) ≤ (⌊‘(𝐴 + (1 / 2))) ↔ ((𝐴 − (1 / 2)) + 1) ≤ ((⌊‘(𝐴 + (1 / 2))) + 1))) |
24 | 17, 23 | mpbird 256 | . 2 ⊢ (𝐴 ∈ ℝ → (𝐴 − (1 / 2)) ≤ (⌊‘(𝐴 + (1 / 2)))) |
25 | flle 13447 | . . 3 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ≤ (𝐴 + (1 / 2))) | |
26 | 14, 25 | syl 17 | . 2 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ≤ (𝐴 + (1 / 2))) |
27 | id 22 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ) | |
28 | 12 | a1i 11 | . . 3 ⊢ (𝐴 ∈ ℝ → (1 / 2) ∈ ℝ) |
29 | absdifle 14958 | . . 3 ⊢ (((⌊‘(𝐴 + (1 / 2))) ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → ((abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴)) ≤ (1 / 2) ↔ ((𝐴 − (1 / 2)) ≤ (⌊‘(𝐴 + (1 / 2))) ∧ (⌊‘(𝐴 + (1 / 2))) ≤ (𝐴 + (1 / 2))))) | |
30 | 21, 27, 28, 29 | syl3anc 1369 | . 2 ⊢ (𝐴 ∈ ℝ → ((abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴)) ≤ (1 / 2) ↔ ((𝐴 − (1 / 2)) ≤ (⌊‘(𝐴 + (1 / 2))) ∧ (⌊‘(𝐴 + (1 / 2))) ≤ (𝐴 + (1 / 2))))) |
31 | 24, 26, 30 | mpbir2and 709 | 1 ⊢ (𝐴 ∈ ℝ → (abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴)) ≤ (1 / 2)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2108 class class class wbr 5070 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 1c1 10803 + caddc 10805 · cmul 10807 ≤ cle 10941 − cmin 11135 / cdiv 11562 2c2 11958 ⌊cfl 13438 abscabs 14873 |
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-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-fl 13440 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 |
This theorem is referenced by: absrdbnd 14981 rddif2 34584 dnibndlem11 34595 knoppcnlem4 34603 cntotbnd 35881 |
Copyright terms: Public domain | W3C validator |