| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sgnval2 | Structured version Visualization version GIF version | ||
| Description: Value of the signum of a real number, expresssed using absolute value. (Contributed by Thierry Arnoux, 9-Nov-2025.) |
| Ref | Expression |
|---|---|
| sgnval2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 488 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℝ) | |
| 2 | 0red 11321 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 0 ∈ ℝ) | |
| 3 | 1 | recnd 11347 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ) |
| 4 | 3 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℂ) |
| 5 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ≠ 0) | |
| 6 | 4, 4, 5 | divneg2d 12117 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → -(𝐴 / 𝐴) = (𝐴 / -𝐴)) |
| 7 | simpr 490 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0) | |
| 8 | 3, 7 | dividd 12101 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → (𝐴 / 𝐴) = 1) |
| 9 | 8 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / 𝐴) = 1) |
| 10 | 9 | negeqd 11561 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → -(𝐴 / 𝐴) = -1) |
| 11 | 6, 10 | eqtr3d 2800 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / -𝐴) = -1) |
| 12 | absnid 15477 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) | |
| 13 | 12 | adantlr 728 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) |
| 14 | 13 | oveq2d 7443 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / (abs‘𝐴)) = (𝐴 / -𝐴)) |
| 15 | 1 | rexrd 11369 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℝ*) |
| 16 | 1 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℝ) |
| 17 | 0red 11321 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 0 ∈ ℝ) | |
| 18 | simpr 490 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ≤ 0) | |
| 19 | 7 | necomd 3013 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 0 ≠ 𝐴) |
| 20 | 19 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 0 ≠ 𝐴) |
| 21 | 16, 17, 18, 20 | leneltd 11474 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 < 0) |
| 22 | sgnn 15259 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 23 | 15, 21, 22 | syl2an2r 698 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (sgn‘𝐴) = -1) |
| 24 | 11, 14, 23 | 3eqtr4rd 2809 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| 25 | 8 | adantr 486 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (𝐴 / 𝐴) = 1) |
| 26 | 1 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 𝐴 ∈ ℝ) |
| 27 | simpr 490 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 0 ≤ 𝐴) | |
| 28 | 26, 27 | absidd 15602 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (abs‘𝐴) = 𝐴) |
| 29 | 28 | oveq2d 7443 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (𝐴 / (abs‘𝐴)) = (𝐴 / 𝐴)) |
| 30 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 𝐴 ≠ 0) | |
| 31 | 26, 27, 30 | ne0gt0d 11457 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 0 < 𝐴) |
| 32 | sgnp 15255 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 33 | 15, 31, 32 | syl2an2r 698 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (sgn‘𝐴) = 1) |
| 34 | 25, 29, 33 | 3eqtr4rd 2809 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| 35 | 1, 2, 24, 34 | lecasei 11426 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 class class class wbr 5105 ‘cfv 6546 (class class class)co 7427 ℂcc 11208 ℝcr 11209 0cc0 11210 1c1 11211 ℝ*cxr 11352 < clt 11353 ≤ cle 11354 -cneg 11552 / cdiv 11983 sgncsgn 15251 abscabs 15413 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 ax-pre-sup 11288 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-en 8985 df-dom 8986 df-sdom 8987 df-sup 9444 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-2 12415 df-3 12416 df-n0 12617 df-z 12704 df-uz 12976 df-rp 13131 df-seq 14155 df-exp 14215 df-sgn 15252 df-cj 15278 df-re 15279 df-im 15280 df-sqrt 15414 df-abs 15415 |
| This theorem is used by: cos9thpiminplylem2 34468 |
| Copyright terms: Public domain | W3C validator |