| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > divalglem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for divalg 16573. (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 12699 | . . . 4 ⊢ 𝑁 ∈ ℝ |
| 3 | 0re 11310 | . . . 4 ⊢ 0 ∈ ℝ | |
| 4 | 2, 3 | letrii 11435 | . . 3 ⊢ (𝑁 ≤ 0 ∨ 0 ≤ 𝑁) |
| 5 | divalglem0.2 | . . . . . . . 8 ⊢ 𝐷 ∈ ℤ | |
| 6 | divalglem1.3 | . . . . . . . 8 ⊢ 𝐷 ≠ 0 | |
| 7 | nnabscl 15493 | . . . . . . . 8 ⊢ ((𝐷 ∈ ℤ ∧ 𝐷 ≠ 0) → (abs‘𝐷) ∈ ℕ) | |
| 8 | 5, 6, 7 | mp2an 705 | . . . . . . 7 ⊢ (abs‘𝐷) ∈ ℕ |
| 9 | nnge1 12366 | . . . . . . 7 ⊢ ((abs‘𝐷) ∈ ℕ → 1 ≤ (abs‘𝐷)) | |
| 10 | 8, 9 | ax-mp 5 | . . . . . 6 ⊢ 1 ≤ (abs‘𝐷) |
| 11 | le0neg1 11824 | . . . . . . . 8 ⊢ (𝑁 ∈ ℝ → (𝑁 ≤ 0 ↔ 0 ≤ -𝑁)) | |
| 12 | 2, 11 | ax-mp 5 | . . . . . . 7 ⊢ (𝑁 ≤ 0 ↔ 0 ≤ -𝑁) |
| 13 | 2 | renegcli 11619 | . . . . . . . 8 ⊢ -𝑁 ∈ ℝ |
| 14 | 5 | zrei 12699 | . . . . . . . . . 10 ⊢ 𝐷 ∈ ℝ |
| 15 | 14 | recni 11323 | . . . . . . . . 9 ⊢ 𝐷 ∈ ℂ |
| 16 | 15 | abscli 15563 | . . . . . . . 8 ⊢ (abs‘𝐷) ∈ ℝ |
| 17 | lemulge11 12179 | . . . . . . . 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 11323 | . . . . . . 7 ⊢ 𝑁 ∈ ℂ |
| 22 | 21, 15 | absmuli 15572 | . . . . . 6 ⊢ (abs‘(𝑁 · 𝐷)) = ((abs‘𝑁) · (abs‘𝐷)) |
| 23 | 2 | absnidi 15546 | . . . . . . 7 ⊢ (𝑁 ≤ 0 → (abs‘𝑁) = -𝑁) |
| 24 | 23 | oveq1d 7435 | . . . . . 6 ⊢ (𝑁 ≤ 0 → ((abs‘𝑁) · (abs‘𝐷)) = ( -𝑁 · (abs‘𝐷))) |
| 25 | 22, 24 | eqtrid 2807 | . . . . 5 ⊢ (𝑁 ≤ 0 → (abs‘(𝑁 · 𝐷)) = ( -𝑁 · (abs‘𝐷))) |
| 26 | 20, 25 | breqtrrd 5132 | . . . 4 ⊢ (𝑁 ≤ 0 → -𝑁 ≤ (abs‘(𝑁 · 𝐷))) |
| 27 | le0neg2 11825 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (0 ≤ 𝑁 ↔ -𝑁 ≤ 0)) | |
| 28 | 2, 27 | ax-mp 5 | . . . . 5 ⊢ (0 ≤ 𝑁 ↔ -𝑁 ≤ 0) |
| 29 | 2, 14 | remulcli 11325 | . . . . . . . 8 ⊢ (𝑁 · 𝐷) ∈ ℝ |
| 30 | 29 | recni 11323 | . . . . . . 7 ⊢ (𝑁 · 𝐷) ∈ ℂ |
| 31 | 30 | absge0i 15564 | . . . . . 6 ⊢ 0 ≤ (abs‘(𝑁 · 𝐷)) |
| 32 | 30 | abscli 15563 | . . . . . . 7 ⊢ (abs‘(𝑁 · 𝐷)) ∈ ℝ |
| 33 | 13, 3, 32 | letri 11439 | . . . . . 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 11544 | . . . 4 ⊢ -𝑁 = (0 − 𝑁) | |
| 39 | 38 | breq1i 5109 | . . 3 ⊢ ( -𝑁 ≤ (abs‘(𝑁 · 𝐷)) ↔ (0 − 𝑁) ≤ (abs‘(𝑁 · 𝐷))) |
| 40 | 3, 2, 32 | lesubadd2i 11876 | . . 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 2144 ≠ wne 2955 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 ℝcr 11199 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 ≤ cle 11344 − cmin 11541 -cneg 11542 ℕcn 12335 ℤcz 12693 abscabs 15401 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 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 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-sup 9434 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-seq 14145 df-exp 14205 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 |
| This theorem is used by: divalglem2 16565 |
| Copyright terms: Public domain | W3C validator |