| 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 11311 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 0 ∈ ℝ) | |
| 3 | 1 | recnd 11337 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℂ) |
| 4 | 3 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℂ) |
| 5 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ≠ 0) | |
| 6 | 4, 4, 5 | divneg2d 12107 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → -(𝐴 / 𝐴) = (𝐴 / -𝐴)) |
| 7 | simpr 490 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ≠ 0) | |
| 8 | 3, 7 | dividd 12091 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → (𝐴 / 𝐴) = 1) |
| 9 | 8 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / 𝐴) = 1) |
| 10 | 9 | negeqd 11551 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → -(𝐴 / 𝐴) = -1) |
| 11 | 6, 10 | eqtr3d 2798 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / -𝐴) = -1) |
| 12 | absnid 15465 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) | |
| 13 | 12 | adantlr 728 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (abs‘𝐴) = -𝐴) |
| 14 | 13 | oveq2d 7436 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (𝐴 / (abs‘𝐴)) = (𝐴 / -𝐴)) |
| 15 | 1 | rexrd 11359 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 𝐴 ∈ ℝ*) |
| 16 | 1 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ∈ ℝ) |
| 17 | 0red 11311 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 0 ∈ ℝ) | |
| 18 | simpr 490 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 ≤ 0) | |
| 19 | 7 | necomd 3011 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) → 0 ≠ 𝐴) |
| 20 | 19 | adantr 486 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 0 ≠ 𝐴) |
| 21 | 16, 17, 18, 20 | leneltd 11464 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → 𝐴 < 0) |
| 22 | sgnn 15247 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 23 | 15, 21, 22 | syl2an2r 698 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 𝐴 ≤ 0) → (sgn‘𝐴) = -1) |
| 24 | 11, 14, 23 | 3eqtr4rd 2807 | . 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 15590 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (abs‘𝐴) = 𝐴) |
| 29 | 28 | oveq2d 7436 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (𝐴 / (abs‘𝐴)) = (𝐴 / 𝐴)) |
| 30 | simplr 781 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 𝐴 ≠ 0) | |
| 31 | 26, 27, 30 | ne0gt0d 11447 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → 0 < 𝐴) |
| 32 | sgnp 15243 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 33 | 15, 31, 32 | syl2an2r 698 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (sgn‘𝐴) = 1) |
| 34 | 25, 29, 33 | 3eqtr4rd 2807 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐴 ≠ 0) ∧ 0 ≤ 𝐴) → (sgn‘𝐴) = (𝐴 / (abs‘𝐴))) |
| 35 | 1, 2, 24, 34 | lecasei 11416 | 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 2956 class class class wbr 5103 ‘cfv 6538 (class class class)co 7420 ℂcc 11198 ℝcr 11199 0cc0 11200 1c1 11201 ℝ*cxr 11342 < clt 11343 ≤ cle 11344 -cneg 11542 / cdiv 11973 sgncsgn 15239 abscabs 15401 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 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 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 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-sgn 15240 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 |
| This theorem is used by: cos9thpiminplylem2 34415 |
| Copyright terms: Public domain | W3C validator |