| Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dnibndlem5 | Structured version Visualization version GIF version | ||
| Description: Lemma for dnibnd 37534. (Contributed by Asger C. Ipsen, 4-Apr-2021.) |
| Ref | Expression |
|---|---|
| dnibndlem5 | ⊢ (𝐴 ∈ ℝ → 0 < (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) − 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ) | |
| 2 | halfre 12583 | . . . . . . 7 ⊢ (1 / 2) ∈ ℝ | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (1 / 2) ∈ ℝ) |
| 4 | readdcl 11307 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → (𝐴 + (1 / 2)) ∈ ℝ) | |
| 5 | 1, 3, 4 | syl2anc2 597 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) ∈ ℝ) |
| 6 | flltp1 13964 | . . . . 5 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (𝐴 + (1 / 2)) < ((⌊‘(𝐴 + (1 / 2))) + 1)) | |
| 7 | 5, 6 | syl 18 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) < ((⌊‘(𝐴 + (1 / 2))) + 1)) |
| 8 | ax-1cn 11282 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 9 | 2halves 12588 | . . . . . . . . 9 ⊢ (1 ∈ ℂ → ((1 / 2) + (1 / 2)) = 1) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . . . 8 ⊢ ((1 / 2) + (1 / 2)) = 1 |
| 11 | 10 | eqcomi 2772 | . . . . . . 7 ⊢ 1 = ((1 / 2) + (1 / 2)) |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 1 = ((1 / 2) + (1 / 2))) |
| 13 | 12 | oveq2d 7456 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + 1) = ((⌊‘(𝐴 + (1 / 2))) + ((1 / 2) + (1 / 2)))) |
| 14 | reflcl 13960 | . . . . . . . . . 10 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ) | |
| 15 | 5, 14 | syl 18 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ) |
| 16 | 15 | recnd 11361 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℂ) |
| 17 | 3 | recnd 11361 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (1 / 2) ∈ ℂ) |
| 18 | 16, 17, 17 | 3jca 1146 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) ∈ ℂ ∧ (1 / 2) ∈ ℂ ∧ (1 / 2) ∈ ℂ)) |
| 19 | addass 11311 | . . . . . . 7 ⊢ (((⌊‘(𝐴 + (1 / 2))) ∈ ℂ ∧ (1 / 2) ∈ ℂ ∧ (1 / 2) ∈ ℂ) → (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2)) = ((⌊‘(𝐴 + (1 / 2))) + ((1 / 2) + (1 / 2)))) | |
| 20 | 18, 19 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2)) = ((⌊‘(𝐴 + (1 / 2))) + ((1 / 2) + (1 / 2)))) |
| 21 | 20 | eqcomd 2769 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + ((1 / 2) + (1 / 2))) = (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2))) |
| 22 | 13, 21 | eqtrd 2798 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + 1) = (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2))) |
| 23 | 7, 22 | breqtrd 5134 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) < (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2))) |
| 24 | 15, 3 | jca 521 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) ∈ ℝ ∧ (1 / 2) ∈ ℝ)) |
| 25 | readdcl 11307 | . . . . 5 ⊢ (((⌊‘(𝐴 + (1 / 2))) ∈ ℝ ∧ (1 / 2) ∈ ℝ) → ((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) ∈ ℝ) | |
| 26 | 24, 25 | syl 18 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) ∈ ℝ) |
| 27 | 1, 26, 3 | ltadd1d 11933 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 < ((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) ↔ (𝐴 + (1 / 2)) < (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2)))) |
| 28 | 23, 27 | mpbird 260 | . 2 ⊢ (𝐴 ∈ ℝ → 𝐴 < ((⌊‘(𝐴 + (1 / 2))) + (1 / 2))) |
| 29 | 1, 26 | posdifd 11927 | . 2 ⊢ (𝐴 ∈ ℝ → (𝐴 < ((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) ↔ 0 < (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) − 𝐴))) |
| 30 | 28, 29 | mpbid 235 | 1 ⊢ (𝐴 ∈ ℝ → 0 < (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) − 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 class class class wbr 5106 ‘cfv 6555 (class class class)co 7440 ℂcc 11222 ℝcr 11223 0cc0 11224 1c1 11225 + caddc 11227 < clt 11367 − cmin 11565 / cdiv 11997 2c2 12421 ⌊cfl 13954 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301 ax-pre-sup 11302 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-er 8742 df-en 8999 df-dom 9000 df-sdom 9001 df-sup 9458 df-inf 9459 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-div 11998 df-nn 12360 df-2 12429 df-n0 12631 df-z 12718 df-uz 12990 df-fl 13956 |
| This theorem is used by: dnibndlem9 37529 |
| Copyright terms: Public domain | W3C validator |