| 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 11238 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 0 ∈ ℝ) | |
| 3 | 1 | recnd 11264 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ) |
| 4 | 3 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℂ) |
| 5 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ≠ 0) | |
| 6 | 4, 4, 5 | divneg2d 12032 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → -(𝐴 / 𝐴) = (𝐴 / -𝐴)) |
| 7 | simpr 490 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0) | |
| 8 | 3, 7 | dividd 12016 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → (𝐴 / 𝐴) = 1) |
| 9 | 8 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / 𝐴) = 1) |
| 10 | 9 | negeqd 11478 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → -(𝐴 / 𝐴) = -1) |
| 11 | 6, 10 | eqtr3d 2797 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / -𝐴) = -1) |
| 12 | absnid 15388 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) | |
| 13 | 12 | adantlr 728 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) |
| 14 | 13 | oveq2d 7430 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / (abs‘𝐴)) = (𝐴 / -𝐴)) |
| 15 | 1 | rexrd 11286 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℝ*) |
| 16 | 1 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℝ) |
| 17 | 0red 11238 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 0 ∈ ℝ) | |
| 18 | simpr 490 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ≤ 0) | |
| 19 | 7 | necomd 3010 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 0 ≠ 𝐴) |
| 20 | 19 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 0 ≠ 𝐴) |
| 21 | 16, 17, 18, 20 | leneltd 11391 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 < 0) |
| 22 | sgnn 15170 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 23 | 15, 21, 22 | syl2an2r 698 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (sgn‘𝐴) = -1) |
| 24 | 11, 14, 23 | 3eqtr4rd 2806 | . 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 15513 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (abs‘𝐴) = 𝐴) |
| 29 | 28 | oveq2d 7430 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (𝐴 / (abs‘𝐴)) = (𝐴 / 𝐴)) |
| 30 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 𝐴 ≠ 0) | |
| 31 | 26, 27, 30 | ne0gt0d 11374 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 0 < 𝐴) |
| 32 | sgnp 15166 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 33 | 15, 31, 32 | syl2an2r 698 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (sgn‘𝐴) = 1) |
| 34 | 25, 29, 33 | 3eqtr4rd 2806 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| 35 | 1, 2, 24, 34 | lecasei 11343 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 class class class wbr 5103 ‘cfv 6533 (class class class)co 7414 ℂcc 11125 ℝcr 11126 0cc0 11127 1c1 11128 ℝ*cxr 11269 < clt 11270 ≤ cle 11271 -cneg 11469 / cdiv 11898 sgncsgn 15162 abscabs 15324 |
| 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 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205 |
| 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-sup 9415 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-div 11899 df-nn 12261 df-2 12330 df-3 12331 df-n0 12532 df-z 12619 df-uz 12891 df-rp 13046 df-seq 14069 df-exp 14129 df-sgn 15163 df-cj 15189 df-re 15190 df-im 15191 df-sqrt 15325 df-abs 15326 |
| This theorem is used by: cos9thpiminplylem2 34296 |
| Copyright terms: Public domain | W3C validator |