| 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 37279. (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 12528 | . . . . . . 7 ⊢ (1 / 2) ∈ ℝ | |
| 3 | 2 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (1 / 2) ∈ ℝ) |
| 4 | readdcl 11254 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (1 / 2) ∈ ℝ) → (𝐴 + (1 / 2)) ∈ ℝ) | |
| 5 | 1, 3, 4 | syl2anc2 597 | . . . . 5 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) ∈ ℝ) |
| 6 | flltp1 13908 | . . . . 5 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (𝐴 + (1 / 2)) < ((⌊‘(𝐴 + (1 / 2))) + 1)) | |
| 7 | 5, 6 | syl 18 | . . . 4 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) < ((⌊‘(𝐴 + (1 / 2))) + 1)) |
| 8 | ax-1cn 11229 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 9 | 2halves 12533 | . . . . . . . . 9 ⊢ (1 ∈ ℂ → ((1 / 2) + (1 / 2)) = 1) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . . . 8 ⊢ ((1 / 2) + (1 / 2)) = 1 |
| 11 | 10 | eqcomi 2769 | . . . . . . 7 ⊢ 1 = ((1 / 2) + (1 / 2)) |
| 12 | 11 | a1i 11 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 1 = ((1 / 2) + (1 / 2))) |
| 13 | 12 | oveq2d 7424 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + 1) = ((⌊‘(𝐴 + (1 / 2))) + ((1 / 2) + (1 / 2)))) |
| 14 | reflcl 13904 | . . . . . . . . . 10 ⊢ ((𝐴 + (1 / 2)) ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ) | |
| 15 | 5, 14 | syl 18 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℝ) |
| 16 | 15 | recnd 11308 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (⌊‘(𝐴 + (1 / 2))) ∈ ℂ) |
| 17 | 3 | recnd 11308 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (1 / 2) ∈ ℂ) |
| 18 | 16, 17, 17 | 3jca 1146 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) ∈ ℂ ∧ (1 / 2) ∈ ℂ ∧ (1 / 2) ∈ ℂ)) |
| 19 | addass 11258 | . . . . . . 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 2766 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + ((1 / 2) + (1 / 2))) = (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2))) |
| 22 | 13, 21 | eqtrd 2795 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + 1) = (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2))) |
| 23 | 7, 22 | breqtrd 5130 | . . 3 ⊢ (𝐴 ∈ ℝ → (𝐴 + (1 / 2)) < (((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) + (1 / 2))) |
| 24 | 15, 3 | jca 521 | . . . . 5 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) ∈ ℝ ∧ (1 / 2) ∈ ℝ)) |
| 25 | readdcl 11254 | . . . . 5 ⊢ (((⌊‘(𝐴 + (1 / 2))) ∈ ℝ ∧ (1 / 2) ∈ ℝ) → ((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) ∈ ℝ) | |
| 26 | 24, 25 | syl 18 | . . . 4 ⊢ (𝐴 ∈ ℝ → ((⌊‘(𝐴 + (1 / 2))) + (1 / 2)) ∈ ℝ) |
| 27 | 1, 26, 3 | ltadd1d 11878 | . . 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 11872 | . 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 2145 class class class wbr 5102 ‘cfv 6527 (class class class)co 7408 ℂcc 11169 ℝcr 11170 0cc0 11171 1c1 11172 + caddc 11174 < clt 11314 − cmin 11512 / cdiv 11942 2c2 12366 ⌊cfl 13898 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 ax-pre-sup 11249 |
| 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 2100 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 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 df-ord 6354 df-on 6355 df-lim 6356 df-suc 6357 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7861 df-2nd 7985 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-sup 9412 df-inf 9413 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-div 11943 df-nn 12305 df-2 12374 df-n0 12576 df-z 12663 df-uz 12935 df-fl 13900 |
| This theorem is used by: dnibndlem9 37274 |
| Copyright terms: Public domain | W3C validator |