| Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dnizeq0 | Structured version Visualization version GIF version | ||
| Description: The distance to nearest integer is zero for integers. (Contributed by Asger C. Ipsen, 15-Jun-2021.) |
| Ref | Expression |
|---|---|
| dnizeq0.t | ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥))) |
| dnizeq0.1 | ⊢ (𝜑 → 𝐴 ∈ ℤ) |
| Ref | Expression |
|---|---|
| dnizeq0 | ⊢ (𝜑 → (𝑇‘𝐴) = 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dnizeq0.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℤ) | |
| 2 | 1 | zred 12810 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| 3 | dnizeq0.t | . . . 4 ⊢ 𝑇 = (𝑥 ∈ ℝ ↦ (abs‘((⌊‘(𝑥 + (1 / 2))) − 𝑥))) | |
| 4 | 3 | dnival 37461 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝑇‘𝐴) = (abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴))) |
| 5 | 2, 4 | syl 18 | . 2 ⊢ (𝜑 → (𝑇‘𝐴) = (abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴))) |
| 6 | halfre 12566 | . . . . . . . . . 10 ⊢ (1 / 2) ∈ ℝ | |
| 7 | 6 | a1i 11 | . . . . . . . . 9 ⊢ (𝜑 → (1 / 2) ∈ ℝ) |
| 8 | 1, 7 | jca 521 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ∈ ℤ ∧ (1 / 2) ∈ ℝ)) |
| 9 | flzadd 13973 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℤ ∧ (1 / 2) ∈ ℝ) → (⌊‘(𝐴 + (1 / 2))) = (𝐴 + (⌊‘(1 / 2)))) | |
| 10 | 8, 9 | syl 18 | . . . . . . 7 ⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) = (𝐴 + (⌊‘(1 / 2)))) |
| 11 | 6 | rexri 11374 | . . . . . . . . . . . . 13 ⊢ (1 / 2) ∈ ℝ* |
| 12 | 0re 11317 | . . . . . . . . . . . . . 14 ⊢ 0 ∈ ℝ | |
| 13 | halfgt0 12568 | . . . . . . . . . . . . . 14 ⊢ 0 < (1 / 2) | |
| 14 | 12, 6, 13 | ltleii 11440 | . . . . . . . . . . . . 13 ⊢ 0 ≤ (1 / 2) |
| 15 | halflt1 12570 | . . . . . . . . . . . . 13 ⊢ (1 / 2) < 1 | |
| 16 | 11, 14, 15 | 3pm3.2i 1358 | . . . . . . . . . . . 12 ⊢ ((1 / 2) ∈ ℝ* ∧ 0 ≤ (1 / 2) ∧ (1 / 2) < 1) |
| 17 | 0xr 11363 | . . . . . . . . . . . . . 14 ⊢ 0 ∈ ℝ* | |
| 18 | 1xr 11375 | . . . . . . . . . . . . . 14 ⊢ 1 ∈ ℝ* | |
| 19 | 17, 18 | pm3.2i 476 | . . . . . . . . . . . . 13 ⊢ (0 ∈ ℝ* ∧ 1 ∈ ℝ*) |
| 20 | elico1 13526 | . . . . . . . . . . . . 13 ⊢ ((0 ∈ ℝ* ∧ 1 ∈ ℝ*) → ((1 / 2) ∈ (0[,)1) ↔ ((1 / 2) ∈ ℝ* ∧ 0 ≤ (1 / 2) ∧ (1 / 2) < 1))) | |
| 21 | 19, 20 | ax-mp 5 | . . . . . . . . . . . 12 ⊢ ((1 / 2) ∈ (0[,)1) ↔ ((1 / 2) ∈ ℝ* ∧ 0 ≤ (1 / 2) ∧ (1 / 2) < 1)) |
| 22 | 16, 21 | mpbir 234 | . . . . . . . . . . 11 ⊢ (1 / 2) ∈ (0[,)1) |
| 23 | 22 | a1i 11 | . . . . . . . . . 10 ⊢ (𝜑 → (1 / 2) ∈ (0[,)1)) |
| 24 | ico01fl0 13966 | . . . . . . . . . 10 ⊢ ((1 / 2) ∈ (0[,)1) → (⌊‘(1 / 2)) = 0) | |
| 25 | 23, 24 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → (⌊‘(1 / 2)) = 0) |
| 26 | 25 | oveq2d 7440 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 + (⌊‘(1 / 2))) = (𝐴 + 0)) |
| 27 | 2 | recnd 11344 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 28 | 27 | addridd 11517 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 + 0) = 𝐴) |
| 29 | 26, 28 | eqtrd 2795 | . . . . . . 7 ⊢ (𝜑 → (𝐴 + (⌊‘(1 / 2))) = 𝐴) |
| 30 | 10, 29 | eqtrd 2795 | . . . . . 6 ⊢ (𝜑 → (⌊‘(𝐴 + (1 / 2))) = 𝐴) |
| 31 | 30 | oveq1d 7439 | . . . . 5 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) − 𝐴) = (𝐴 − 𝐴)) |
| 32 | 27 | subidd 11664 | . . . . 5 ⊢ (𝜑 → (𝐴 − 𝐴) = 0) |
| 33 | 31, 32 | eqtrd 2795 | . . . 4 ⊢ (𝜑 → ((⌊‘(𝐴 + (1 / 2))) − 𝐴) = 0) |
| 34 | 33 | fveq2d 6894 | . . 3 ⊢ (𝜑 → (abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴)) = (abs‘0)) |
| 35 | abs0 15461 | . . . 4 ⊢ (abs‘0) = 0 | |
| 36 | 35 | a1i 11 | . . 3 ⊢ (𝜑 → (abs‘0) = 0) |
| 37 | 34, 36 | eqtrd 2795 | . 2 ⊢ (𝜑 → (abs‘((⌊‘(𝐴 + (1 / 2))) − 𝐴)) = 0) |
| 38 | 5, 37 | eqtrd 2795 | 1 ⊢ (𝜑 → (𝑇‘𝐴) = 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ↦ cmpt 5185 ‘cfv 6543 (class class class)co 7424 ℝcr 11206 0cc0 11207 1c1 11208 + caddc 11210 ℝ*cxr 11349 < clt 11350 ≤ cle 11351 − cmin 11548 / cdiv 11980 2c2 12404 ℤcz 12700 [,)cico 13485 ⌊cfl 13937 abscabs 15410 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-n0 12614 df-z 12701 df-uz 12973 df-rp 13128 df-ico 13489 df-fl 13939 df-seq 14152 df-exp 14212 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 |
| This theorem is used by: knoppndvlem6 37507 knoppndvlem8 37509 |
| Copyright terms: Public domain | W3C validator |