| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > divalglem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for divalg 16526. (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 12654 | . . . 4 ⊢ 𝑁 ∈ ℝ |
| 3 | 0re 11267 | . . . 4 ⊢ 0 ∈ ℝ | |
| 4 | 2, 3 | letrii 11392 | . . 3 ⊢ (𝑁 ≤ 0 ∨ 0 ≤ 𝑁) |
| 5 | divalglem0.2 | . . . . . . . 8 ⊢ 𝐷 ∈ ℤ | |
| 6 | divalglem1.3 | . . . . . . . 8 ⊢ 𝐷 ≠ 0 | |
| 7 | nnabscl 15446 | . . . . . . . 8 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ) | |
| 8 | 5, 6, 7 | mp2an 705 | . . . . . . 7 ⊢ (abs‘𝐷) ∈ ℕ |
| 9 | nnge1 12321 | . . . . . . 7 ⊢ ((abs‘𝐷) ∈ ℕ → 1 ≤ (abs‘𝐷)) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ 1 ≤ (abs‘𝐷) |
| 11 | le0neg1 11779 | . . . . . . . 8 ⊢ (𝑁 ∈ ℝ → (𝑁 ≤ 0 ↔ 0 ≤ -𝑁)) | |
| 12 | 2, 11 | ax-mp 5 | . . . . . . 7 ⊢ (𝑁 ≤ 0 ↔ 0 ≤ -𝑁) |
| 13 | 2 | renegcli 11576 | . . . . . . . 8 ⊢ -𝑁 ∈ ℝ |
| 14 | 5 | zrei 12654 | . . . . . . . . . 10 ⊢ 𝐷 ∈ ℝ |
| 15 | 14 | recni 11280 | . . . . . . . . 9 ⊢ 𝐷 ∈ ℂ |
| 16 | 15 | abscli 15516 | . . . . . . . 8 ⊢ (abs‘𝐷) ∈ ℝ |
| 17 | lemulge11 12134 | . . . . . . . 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 11280 | . . . . . . 7 ⊢ 𝑁 ∈ ℂ |
| 22 | 21, 15 | absmuli 15525 | . . . . . 6 ⊢ (abs‘(𝑁 · 𝐷)) = ((abs‘𝑁) · (abs‘𝐷)) |
| 23 | 2 | absnidi 15499 | . . . . . . 7 ⊢ (𝑁 ≤ 0 → (abs‘𝑁) = -𝑁) |
| 24 | 23 | oveq1d 7424 | . . . . . 6 ⊢ (𝑁 ≤ 0 → ((abs‘𝑁) · (abs‘𝐷)) = (-𝑁 · (abs‘𝐷))) |
| 25 | 22, 24 | eqtrid 2807 | . . . . 5 ⊢ (𝑁 ≤ 0 → (abs‘(𝑁 · 𝐷)) = (-𝑁 · (abs‘𝐷))) |
| 26 | 20, 25 | breqtrrd 5133 | . . . 4 ⊢ (𝑁 ≤ 0 → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 27 | le0neg2 11780 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (0 ≤ 𝑁 ↔ -𝑁 ≤ 0)) | |
| 28 | 2, 27 | ax-mp 5 | . . . . 5 ⊢ (0 ≤ 𝑁 ↔ -𝑁 ≤ 0) |
| 29 | 2, 14 | remulcli 11282 | . . . . . . . 8 ⊢ (𝑁 · 𝐷) ∈ ℝ |
| 30 | 29 | recni 11280 | . . . . . . 7 ⊢ (𝑁 · 𝐷) ∈ ℂ |
| 31 | 30 | absge0i 15517 | . . . . . 6 ⊢ 0 ≤ (abs‘(𝑁 · 𝐷)) |
| 32 | 30 | abscli 15516 | . . . . . . 7 ⊢ (abs‘(𝑁 · 𝐷)) ∈ ℝ |
| 33 | 13, 3, 32 | letri 11396 | . . . . . 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 11501 | . . . 4 ⊢ -𝑁 = (0 − 𝑁) | |
| 39 | 38 | breq1i 5110 | . . 3 ⊢ (-𝑁 ≤ (abs‘(𝑁 · 𝐷)) ↔ (0 − 𝑁) ≤ (abs‘(𝑁 · 𝐷))) |
| 40 | 3, 2, 32 | lesubadd2i 11831 | . . 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 2955 class class class wbr 5103 ‘cfv 6528 (class class class)co 7409 ℝcr 11156 0cc0 11157 1c1 11158 + caddc 11160 · cmul 11162 ≤ cle 11301 − cmin 11498 -cneg 11499 ℕcn 12290 ℤcz 12648 abscabs 15354 |
| 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 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-cnex 11213 ax-resscn 11214 ax-1cn 11215 ax-icn 11216 ax-addcl 11217 ax-addrcl 11218 ax-mulcl 11219 ax-mulrcl 11220 ax-mulcom 11221 ax-addass 11222 ax-mulass 11223 ax-distr 11224 ax-i2m1 11225 ax-1ne0 11226 ax-1rid 11227 ax-rnegex 11228 ax-rrecex 11229 ax-cnre 11230 ax-pre-lttri 11231 ax-pre-lttrn 11232 ax-pre-ltadd 11233 ax-pre-mulgt0 11234 ax-pre-sup 11235 |
| 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-pnf 11302 df-mnf 11303 df-xr 11304 df-ltxr 11305 df-le 11306 df-sub 11500 df-neg 11501 df-div 11929 df-nn 12291 df-2 12360 df-3 12361 df-n0 12562 df-z 12649 df-uz 12921 df-rp 13076 df-seq 14099 df-exp 14159 df-cj 15219 df-re 15220 df-im 15221 df-sqrt 15355 df-abs 15356 |
| This theorem is used by: divalglem2 16518 |
| Copyright terms: Public domain | W3C validator |