| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sgncl | Structured version Visualization version GIF version | ||
| Description: Closure of the signum: The signum of an extended real is either -1 or 0 or 1. (Contributed by Thierry Arnoux, 28-Sep-2018.) |
| Ref | Expression |
|---|---|
| sgncl | ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 𝐴 = 0) | |
| 2 | 1 | fveq2d 6890 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = (sgn‘0)) |
| 3 | sgn0 15248 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 4 | 2, 3 | eqtrdi 2811 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = 0) |
| 5 | c0ex 11304 | . . . 4 ⊢ 0 ∈ V | |
| 6 | 5 | tpid2 4727 | . . 3 ⊢ 0 ∈ { -1, 0, 1} |
| 7 | 4, 6 | eqeltrdi 2868 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 8 | sgnn 15253 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 9 | negex 11559 | . . . . . 6 ⊢ -1 ∈ V | |
| 10 | 9 | tpid1 4725 | . . . . 5 ⊢ -1 ∈ { -1, 0, 1} |
| 11 | 8, 10 | eqeltrdi 2868 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 12 | 11 | adantlr 728 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 13 | sgnp 15249 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 14 | 1ex 11307 | . . . . . 6 ⊢ 1 ∈ V | |
| 15 | 14 | tpid3 4730 | . . . . 5 ⊢ 1 ∈ { -1, 0, 1} |
| 16 | 13, 15 | eqeltrdi 2868 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 17 | 16 | adantlr 728 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 18 | 0xr 11360 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 19 | xrlttri2 13275 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝐴 ≠ 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) | |
| 20 | 19 | biimpa 482 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) ∧ 𝐴 ≠ 0) → (𝐴 < 0 ∨ 0 < 𝐴)) |
| 21 | 18, 20 | mpanl2 714 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) → (𝐴 < 0 ∨ 0 < 𝐴)) |
| 22 | 12, 17, 21 | mpjaodan 973 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 23 | 7, 22 | pm2.61dane 3042 | 1 ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 {ctp 4588 class class class wbr 5102 ‘cfv 6539 0cc0 11204 1c1 11205 ℝ*cxr 11346 < clt 11347 -cneg 11546 sgncsgn 15245 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-i2m1 11272 ax-rnegex 11275 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 |
| 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 2099 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-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-po 5558 df-so 5559 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-er 8721 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-neg 11548 df-sgn 15246 |
| This theorem is used by: sgnrn 15257 sgnclre 15261 sgnmulsgn 15268 sgnmulsgp 33470 cos9thpiminplylem2 34462 signstcl 35241 signstf 35242 signstf0 35244 signstfvn 35245 signsvtn0 35246 signstfvneq0 35248 signsvfn 35258 |
| Copyright terms: Public domain | W3C validator |