| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ledivp1 | GIF version | ||
| Description: Less-than-or-equal-to and division relation. (Lemma for computing upper bounds of products. The "+ 1" prevents division by zero.) (Contributed by NM, 28-Sep-2005.) |
| Ref | Expression |
|---|---|
| ledivp1 | ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 / (𝐵 + 1)) · 𝐵) ≤ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprl 531 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 𝐵 ∈ ℝ) | |
| 2 | peano2re 8374 | . . . 4 ⊢ (𝐵 ∈ ℝ → (𝐵 + 1) ∈ ℝ) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐵 + 1) ∈ ℝ) |
| 4 | simpll 527 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 𝐴 ∈ ℝ) | |
| 5 | 0red 8240 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 0 ∈ ℝ) | |
| 6 | simprr 533 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 0 ≤ 𝐵) | |
| 7 | ltp1 9083 | . . . . . . . 8 ⊢ (𝐵 ∈ ℝ → 𝐵 < (𝐵 + 1)) | |
| 8 | 1, 7 | syl 14 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 𝐵 < (𝐵 + 1)) |
| 9 | 5, 1, 3, 6, 8 | lelttrd 8363 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 0 < (𝐵 + 1)) |
| 10 | 3, 9 | gt0ap0d 8868 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐵 + 1) # 0) |
| 11 | 4, 3, 10 | redivclapd 9074 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐴 / (𝐵 + 1)) ∈ ℝ) |
| 12 | simpl 109 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴)) | |
| 13 | divge0 9112 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ ((𝐵 + 1) ∈ ℝ ∧ 0 < (𝐵 + 1))) → 0 ≤ (𝐴 / (𝐵 + 1))) | |
| 14 | 12, 3, 9, 13 | syl12anc 1272 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 0 ≤ (𝐴 / (𝐵 + 1))) |
| 15 | 11, 14 | jca 306 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 / (𝐵 + 1)) ∈ ℝ ∧ 0 ≤ (𝐴 / (𝐵 + 1)))) |
| 16 | 1, 3, 8 | ltled 8357 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 𝐵 ≤ (𝐵 + 1)) |
| 17 | lemul2a 9098 | . . 3 ⊢ (((𝐵 ∈ ℝ ∧ (𝐵 + 1) ∈ ℝ ∧ ((𝐴 / (𝐵 + 1)) ∈ ℝ ∧ 0 ≤ (𝐴 / (𝐵 + 1)))) ∧ 𝐵 ≤ (𝐵 + 1)) → ((𝐴 / (𝐵 + 1)) · 𝐵) ≤ ((𝐴 / (𝐵 + 1)) · (𝐵 + 1))) | |
| 18 | 1, 3, 15, 16, 17 | syl31anc 1277 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 / (𝐵 + 1)) · 𝐵) ≤ ((𝐴 / (𝐵 + 1)) · (𝐵 + 1))) |
| 19 | 4 | recnd 8267 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → 𝐴 ∈ ℂ) |
| 20 | 3 | recnd 8267 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → (𝐵 + 1) ∈ ℂ) |
| 21 | 19, 20, 10 | divcanap1d 9030 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 / (𝐵 + 1)) · (𝐵 + 1)) = 𝐴) |
| 22 | 18, 21 | breqtrd 4119 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝐵 ∈ ℝ ∧ 0 ≤ 𝐵)) → ((𝐴 / (𝐵 + 1)) · 𝐵) ≤ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2202 class class class wbr 4093 (class class class)co 6028 ℝcr 8091 0cc0 8092 1c1 8093 + caddc 8095 · cmul 8097 < clt 8273 ≤ cle 8274 / cdiv 8911 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8183 ax-resscn 8184 ax-1cn 8185 ax-1re 8186 ax-icn 8187 ax-addcl 8188 ax-addrcl 8189 ax-mulcl 8190 ax-mulrcl 8191 ax-addcom 8192 ax-mulcom 8193 ax-addass 8194 ax-mulass 8195 ax-distr 8196 ax-i2m1 8197 ax-0lt1 8198 ax-1rid 8199 ax-0id 8200 ax-rnegex 8201 ax-precex 8202 ax-cnre 8203 ax-pre-ltirr 8204 ax-pre-ltwlin 8205 ax-pre-lttrn 8206 ax-pre-apti 8207 ax-pre-ltadd 8208 ax-pre-mulgt0 8209 ax-pre-mulext 8210 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-id 4396 df-po 4399 df-iso 4400 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8275 df-mnf 8276 df-xr 8277 df-ltxr 8278 df-le 8279 df-sub 8411 df-neg 8412 df-reap 8814 df-ap 8821 df-div 8912 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |