| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > max0add | Structured version Visualization version GIF version | ||
| Description: The sum of the positive and negative part functions is the absolute value function over the reals. (Contributed by Mario Carneiro, 24-Aug-2014.) |
| Ref | Expression |
|---|---|
| max0add | ⊢ (𝐴 ∈ ℝ → (if(0 ≤ 𝐴, 𝐴, 0) + if(0 ≤ -𝐴, -𝐴, 0)) = (abs‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0red 11243 | . 2 ⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ) | |
| 2 | id 22 | . 2 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ) | |
| 3 | recn 11224 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℂ) |
| 5 | 4 | addridd 11440 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 + 0) = 𝐴) |
| 6 | iftrue 4511 | . . . . 5 ⊢ (0 ≤ 𝐴 → if(0 ≤ 𝐴, 𝐴, 0) = 𝐴) | |
| 7 | 6 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → if(0 ≤ 𝐴, 𝐴, 0) = 𝐴) |
| 8 | le0neg2 11751 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ -𝐴 ≤ 0)) | |
| 9 | 8 | biimpa 476 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → -𝐴 ≤ 0) |
| 10 | 9 | adantr 480 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ 0 ≤ -𝐴) → -𝐴 ≤ 0) |
| 11 | simpr 484 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ 0 ≤ -𝐴) → 0 ≤ -𝐴) | |
| 12 | renegcl 11551 | . . . . . . . . 9 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
| 13 | 12 | ad2antrr 726 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ 0 ≤ -𝐴) → -𝐴 ∈ ℝ) |
| 14 | 0re 11242 | . . . . . . . 8 ⊢ 0 ∈ ℝ | |
| 15 | letri3 11325 | . . . . . . . 8 ⊢ ((-𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (-𝐴 = 0 ↔ (-𝐴 ≤ 0 ∧ 0 ≤ -𝐴))) | |
| 16 | 13, 14, 15 | sylancl 586 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ 0 ≤ -𝐴) → (-𝐴 = 0 ↔ (-𝐴 ≤ 0 ∧ 0 ≤ -𝐴))) |
| 17 | 10, 11, 16 | mpbir2and 713 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ 0 ≤ -𝐴) → -𝐴 = 0) |
| 18 | 17 | ifeq1da 4537 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → if(0 ≤ -𝐴, -𝐴, 0) = if(0 ≤ -𝐴, 0, 0)) |
| 19 | ifid 4546 | . . . . 5 ⊢ if(0 ≤ -𝐴, 0, 0) = 0 | |
| 20 | 18, 19 | eqtrdi 2787 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → if(0 ≤ -𝐴, -𝐴, 0) = 0) |
| 21 | 7, 20 | oveq12d 7428 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (if(0 ≤ 𝐴, 𝐴, 0) + if(0 ≤ -𝐴, -𝐴, 0)) = (𝐴 + 0)) |
| 22 | absid 15320 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (abs‘𝐴) = 𝐴) | |
| 23 | 5, 21, 22 | 3eqtr4d 2781 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (if(0 ≤ 𝐴, 𝐴, 0) + if(0 ≤ -𝐴, -𝐴, 0)) = (abs‘𝐴)) |
| 24 | 3 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℂ) |
| 25 | 24 | negcld 11586 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → -𝐴 ∈ ℂ) |
| 26 | 25 | addlidd 11441 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (0 + -𝐴) = -𝐴) |
| 27 | letri3 11325 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 0 ∈ ℝ) → (𝐴 = 0 ↔ (𝐴 ≤ 0 ∧ 0 ≤ 𝐴))) | |
| 28 | 14, 27 | mpan2 691 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → (𝐴 = 0 ↔ (𝐴 ≤ 0 ∧ 0 ≤ 𝐴))) |
| 29 | 28 | biimprd 248 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → ((𝐴 ≤ 0 ∧ 0 ≤ 𝐴) → 𝐴 = 0)) |
| 30 | 29 | impl 455 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) ∧ 0 ≤ 𝐴) → 𝐴 = 0) |
| 31 | 30 | ifeq1da 4537 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → if(0 ≤ 𝐴, 𝐴, 0) = if(0 ≤ 𝐴, 0, 0)) |
| 32 | ifid 4546 | . . . . 5 ⊢ if(0 ≤ 𝐴, 0, 0) = 0 | |
| 33 | 31, 32 | eqtrdi 2787 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → if(0 ≤ 𝐴, 𝐴, 0) = 0) |
| 34 | le0neg1 11750 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (𝐴 ≤ 0 ↔ 0 ≤ -𝐴)) | |
| 35 | 34 | biimpa 476 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → 0 ≤ -𝐴) |
| 36 | 35 | iftrued 4513 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → if(0 ≤ -𝐴, -𝐴, 0) = -𝐴) |
| 37 | 33, 36 | oveq12d 7428 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (if(0 ≤ 𝐴, 𝐴, 0) + if(0 ≤ -𝐴, -𝐴, 0)) = (0 + -𝐴)) |
| 38 | absnid 15322 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) | |
| 39 | 26, 37, 38 | 3eqtr4d 2781 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (if(0 ≤ 𝐴, 𝐴, 0) + if(0 ≤ -𝐴, -𝐴, 0)) = (abs‘𝐴)) |
| 40 | 1, 2, 23, 39 | lecasei 11346 | 1 ⊢ (𝐴 ∈ ℝ → (if(0 ≤ 𝐴, 𝐴, 0) + if(0 ≤ -𝐴, -𝐴, 0)) = (abs‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ifcif 4505 class class class wbr 5124 ‘cfv 6536 (class class class)co 7410 ℂcc 11132 ℝcr 11133 0cc0 11134 + caddc 11137 ≤ cle 11275 -cneg 11472 abscabs 15258 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 ax-pre-sup 11212 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 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 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-sup 9459 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-div 11900 df-nn 12246 df-2 12308 df-3 12309 df-n0 12507 df-z 12594 df-uz 12858 df-rp 13014 df-seq 14025 df-exp 14085 df-cj 15123 df-re 15124 df-im 15125 df-sqrt 15259 df-abs 15260 |
| This theorem is referenced by: iblabslem 25786 iblabsnclem 37712 |
| Copyright terms: Public domain | W3C validator |