![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > max0sub | Structured version Visualization version GIF version |
Description: Decompose a real number into positive and negative parts. (Contributed by Mario Carneiro, 6-Aug-2014.) |
Ref | Expression |
---|---|
max0sub | ⊢ (𝐴 ∈ ℝ → (if(0 ≤ 𝐴, 𝐴, 0) − if(0 ≤ -𝐴, -𝐴, 0)) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0red 11262 | . 2 ⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ) | |
2 | id 22 | . 2 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ) | |
3 | iftrue 4537 | . . . . 5 ⊢ (0 ≤ 𝐴 → if(0 ≤ 𝐴, 𝐴, 0) = 𝐴) | |
4 | 3 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → if(0 ≤ 𝐴, 𝐴, 0) = 𝐴) |
5 | 0xr 11306 | . . . . 5 ⊢ 0 ∈ ℝ* | |
6 | renegcl 11570 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → -𝐴 ∈ ℝ) | |
7 | 6 | adantr 480 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → -𝐴 ∈ ℝ) |
8 | 7 | rexrd 11309 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → -𝐴 ∈ ℝ*) |
9 | le0neg2 11770 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ -𝐴 ≤ 0)) | |
10 | 9 | biimpa 476 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → -𝐴 ≤ 0) |
11 | xrmaxeq 13218 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ -𝐴 ∈ ℝ* ∧ -𝐴 ≤ 0) → if(0 ≤ -𝐴, -𝐴, 0) = 0) | |
12 | 5, 8, 10, 11 | mp3an2i 1465 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → if(0 ≤ -𝐴, -𝐴, 0) = 0) |
13 | 4, 12 | oveq12d 7449 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (if(0 ≤ 𝐴, 𝐴, 0) − if(0 ≤ -𝐴, -𝐴, 0)) = (𝐴 − 0)) |
14 | recn 11243 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
15 | 14 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℂ) |
16 | 15 | subid1d 11607 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (𝐴 − 0) = 𝐴) |
17 | 13, 16 | eqtrd 2775 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (if(0 ≤ 𝐴, 𝐴, 0) − if(0 ≤ -𝐴, -𝐴, 0)) = 𝐴) |
18 | rexr 11305 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
19 | 18 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℝ*) |
20 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → 𝐴 ≤ 0) | |
21 | xrmaxeq 13218 | . . . . 5 ⊢ ((0 ∈ ℝ* ∧ 𝐴 ∈ ℝ* ∧ 𝐴 ≤ 0) → if(0 ≤ 𝐴, 𝐴, 0) = 0) | |
22 | 5, 19, 20, 21 | mp3an2i 1465 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → if(0 ≤ 𝐴, 𝐴, 0) = 0) |
23 | le0neg1 11769 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (𝐴 ≤ 0 ↔ 0 ≤ -𝐴)) | |
24 | 23 | biimpa 476 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → 0 ≤ -𝐴) |
25 | 24 | iftrued 4539 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → if(0 ≤ -𝐴, -𝐴, 0) = -𝐴) |
26 | 22, 25 | oveq12d 7449 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (if(0 ≤ 𝐴, 𝐴, 0) − if(0 ≤ -𝐴, -𝐴, 0)) = (0 − -𝐴)) |
27 | df-neg 11493 | . . . 4 ⊢ --𝐴 = (0 − -𝐴) | |
28 | 14 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℂ) |
29 | 28 | negnegd 11609 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → --𝐴 = 𝐴) |
30 | 27, 29 | eqtr3id 2789 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (0 − -𝐴) = 𝐴) |
31 | 26, 30 | eqtrd 2775 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (if(0 ≤ 𝐴, 𝐴, 0) − if(0 ≤ -𝐴, -𝐴, 0)) = 𝐴) |
32 | 1, 2, 17, 31 | lecasei 11365 | 1 ⊢ (𝐴 ∈ ℝ → (if(0 ≤ 𝐴, 𝐴, 0) − if(0 ≤ -𝐴, -𝐴, 0)) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ifcif 4531 class class class wbr 5148 (class class class)co 7431 ℂcc 11151 ℝcr 11152 0cc0 11153 ℝ*cxr 11292 ≤ cle 11294 − cmin 11490 -cneg 11491 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-po 5597 df-so 5598 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 |
This theorem is referenced by: mbfi1flimlem 25772 itgitg1 25859 itgconst 25869 itgaddlem2 25874 itgmulc2lem2 25883 itgaddnclem2 37666 itgmulc2nclem2 37674 |
Copyright terms: Public domain | W3C validator |