| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > divalglem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for divalg 16497. (Contributed by Paul Chapman, 21-Mar-2011.) |
| Ref | Expression |
|---|---|
| divalglem0.1 | ⊢ 𝑁 ∈ ℤ |
| divalglem0.2 | ⊢ 𝐷 ∈ ℤ |
| divalglem1.3 | ⊢ 𝐷 ≠ 0 |
| Ref | Expression |
|---|---|
| divalglem1 | ⊢ 0 ≤ (𝑁 + (abs‘(𝑁 · 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divalglem0.1 | . . . . 5 ⊢ 𝑁 ∈ ℤ | |
| 2 | 1 | zrei 12624 | . . . 4 ⊢ 𝑁 ∈ ℝ |
| 3 | 0re 11237 | . . . 4 ⊢ 0 ∈ ℝ | |
| 4 | 2, 3 | letrii 11362 | . . 3 ⊢ (𝑁 ≤ 0 ∨ 0 ≤ 𝑁) |
| 5 | divalglem0.2 | . . . . . . . 8 ⊢ 𝐷 ∈ ℤ | |
| 6 | divalglem1.3 | . . . . . . . 8 ⊢ 𝐷 ≠ 0 | |
| 7 | nnabscl 15415 | . . . . . . . 8 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ) | |
| 8 | 5, 6, 7 | mp2an 705 | . . . . . . 7 ⊢ (abs‘𝐷) ∈ ℕ |
| 9 | nnge1 12291 | . . . . . . 7 ⊢ ((abs‘𝐷) ∈ ℕ → 1 ≤ (abs‘𝐷)) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ 1 ≤ (abs‘𝐷) |
| 11 | le0neg1 11749 | . . . . . . . 8 ⊢ (𝑁 ∈ ℝ → (𝑁 ≤ 0 ↔ 0 ≤ -𝑁)) | |
| 12 | 2, 11 | ax-mp 5 | . . . . . . 7 ⊢ (𝑁 ≤ 0 ↔ 0 ≤ -𝑁) |
| 13 | 2 | renegcli 11546 | . . . . . . . 8 ⊢ -𝑁 ∈ ℝ |
| 14 | 5 | zrei 12624 | . . . . . . . . . 10 ⊢ 𝐷 ∈ ℝ |
| 15 | 14 | recni 11250 | . . . . . . . . 9 ⊢ 𝐷 ∈ ℂ |
| 16 | 15 | abscli 15485 | . . . . . . . 8 ⊢ (abs‘𝐷) ∈ ℝ |
| 17 | lemulge11 12104 | . . . . . . . 8 ⊢ (((-𝑁 ∈ ℝ ∧ (abs‘𝐷) ∈ ℝ) ∧ (0 ≤ -𝑁 ∧ 1 ≤ (abs‘𝐷))) → -𝑁 ≤ (-𝑁 · (abs‘𝐷))) | |
| 18 | 13, 16, 17 | mpanl12 715 | . . . . . . 7 ⊢ ((0 ≤ -𝑁 ∧ 1 ≤ (abs‘𝐷)) → -𝑁 ≤ (-𝑁 · (abs‘𝐷))) |
| 19 | 12, 18 | sylanb 593 | . . . . . 6 ⊢ ((𝑁 ≤ 0 ∧ 1 ≤ (abs‘𝐷)) → -𝑁 ≤ (-𝑁 · (abs‘𝐷))) |
| 20 | 10, 19 | mpan2 704 | . . . . 5 ⊢ (𝑁 ≤ 0 → -𝑁 ≤ (-𝑁 · (abs‘𝐷))) |
| 21 | 2 | recni 11250 | . . . . . . 7 ⊢ 𝑁 ∈ ℂ |
| 22 | 21, 15 | absmuli 15494 | . . . . . 6 ⊢ (abs‘(𝑁 · 𝐷)) = ((abs‘𝑁) · (abs‘𝐷)) |
| 23 | 2 | absnidi 15468 | . . . . . . 7 ⊢ (𝑁 ≤ 0 → (abs‘𝑁) = -𝑁) |
| 24 | 23 | oveq1d 7431 | . . . . . 6 ⊢ (𝑁 ≤ 0 → ((abs‘𝑁) · (abs‘𝐷)) = (-𝑁 · (abs‘𝐷))) |
| 25 | 22, 24 | eqtrid 2809 | . . . . 5 ⊢ (𝑁 ≤ 0 → (abs‘(𝑁 · 𝐷)) = (-𝑁 · (abs‘𝐷))) |
| 26 | 20, 25 | breqtrrd 5137 | . . . 4 ⊢ (𝑁 ≤ 0 → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 27 | le0neg2 11750 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (0 ≤ 𝑁 ↔ -𝑁 ≤ 0)) | |
| 28 | 2, 27 | ax-mp 5 | . . . . 5 ⊢ (0 ≤ 𝑁 ↔ -𝑁 ≤ 0) |
| 29 | 2, 14 | remulcli 11252 | . . . . . . . 8 ⊢ (𝑁 · 𝐷) ∈ ℝ |
| 30 | 29 | recni 11250 | . . . . . . 7 ⊢ (𝑁 · 𝐷) ∈ ℂ |
| 31 | 30 | absge0i 15486 | . . . . . 6 ⊢ 0 ≤ (abs‘(𝑁 · 𝐷)) |
| 32 | 30 | abscli 15485 | . . . . . . 7 ⊢ (abs‘(𝑁 · 𝐷)) ∈ ℝ |
| 33 | 13, 3, 32 | letri 11366 | . . . . . 6 ⊢ ((-𝑁 ≤ 0 ∧ 0 ≤ (abs‘(𝑁 · 𝐷))) → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 34 | 31, 33 | mpan2 704 | . . . . 5 ⊢ (-𝑁 ≤ 0 → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 35 | 28, 34 | sylbi 220 | . . . 4 ⊢ (0 ≤ 𝑁 → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 36 | 26, 35 | jaoi 871 | . . 3 ⊢ ((𝑁 ≤ 0 ∨ 0 ≤ 𝑁) → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 37 | 4, 36 | ax-mp 5 | . 2 ⊢ -𝑁 ≤ (abs‘(𝑁 · 𝐷)) |
| 38 | df-neg 11471 | . . . 4 ⊢ -𝑁 = (0 − 𝑁) | |
| 39 | 38 | breq1i 5114 | . . 3 ⊢ (-𝑁 ≤ (abs‘(𝑁 · 𝐷)) ↔ (0 − 𝑁) ≤ (abs‘(𝑁 · 𝐷))) |
| 40 | 3, 2, 32 | lesubadd2i 11801 | . . 3 ⊢ ((0 − 𝑁) ≤ (abs‘(𝑁 · 𝐷)) ↔ 0 ≤ (𝑁 + (abs‘(𝑁 · 𝐷)))) |
| 41 | 39, 40 | bitri 278 | . 2 ⊢ (-𝑁 ≤ (abs‘(𝑁 · 𝐷)) ↔ 0 ≤ (𝑁 + (abs‘(𝑁 · 𝐷)))) |
| 42 | 37, 41 | mpbi 233 | 1 ⊢ 0 ≤ (𝑁 + (abs‘(𝑁 · 𝐷))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∨ wo 861 ∈ wcel 2145 ≠ wne 2957 class class class wbr 5107 ‘cfv 6537 (class class class)co 7416 ℝcr 11126 0cc0 11127 1c1 11128 + caddc 11130 · cmul 11132 ≤ cle 11271 − cmin 11468 -cneg 11469 ℕcn 12260 ℤcz 12618 abscabs 15323 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13045 df-seq 14068 df-exp 14128 df-cj 15188 df-re 15189 df-im 15190 df-sqrt 15324 df-abs 15325 |
| This theorem is used by: divalglem2 16489 |
| Copyright terms: Public domain | W3C validator |