| 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. (Contributed by Thierry Arnoux, 28-Sep-2018.) |
| Ref | Expression |
|---|---|
| sgncl | ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 488 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 𝐴 = 0) | |
| 2 | 1 | fveq2d 6866 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = (sgn‘0)) |
| 3 | sgn0 15096 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 4 | 2, 3 | eqtrdi 2812 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = 0) |
| 5 | c0ex 11167 | . . . 4 ⊢ 0 ∈ V | |
| 6 | 5 | tpid2 4726 | . . 3 ⊢ 0 ∈ {-1, 0, 1} |
| 7 | 4, 6 | eqeltrdi 2869 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 8 | sgnn 15101 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 9 | negex 11422 | . . . . . 6 ⊢ -1 ∈ V | |
| 10 | 9 | tpid1 4724 | . . . . 5 ⊢ -1 ∈ {-1, 0, 1} |
| 11 | 8, 10 | eqeltrdi 2869 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 12 | 11 | adantlr 725 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 13 | sgnp 15097 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 14 | 1ex 11170 | . . . . . 6 ⊢ 1 ∈ V | |
| 15 | 14 | tpid3 4729 | . . . . 5 ⊢ 1 ∈ {-1, 0, 1} |
| 16 | 13, 15 | eqeltrdi 2869 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 17 | 16 | adantlr 725 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 18 | 0xr 11223 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 19 | xrlttri2 13138 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝐴 ≠ 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) | |
| 20 | 19 | biimpa 480 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) ∧ 𝐴 ≠ 0) → (𝐴 < 0 ∨ 0 < 𝐴)) |
| 21 | 18, 20 | mpanl2 711 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) → (𝐴 < 0 ∨ 0 < 𝐴)) |
| 22 | 12, 17, 21 | mpjaodan 971 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 23 | 7, 22 | pm2.61dane 3043 | 1 ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∨ wo 858 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 {ctp 4583 class class class wbr 5097 ‘cfv 6516 0cc0 11067 1c1 11068 ℝ*cxr 11209 < clt 11210 -cneg 11409 sgncsgn 15093 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-i2m1 11135 ax-rnegex 11138 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-po 5551 df-so 5552 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-ov 7394 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-neg 11411 df-sgn 15094 |
| This theorem is referenced by: sgnclre 15106 sgnmulsgn 15113 sgnmulsgp 32995 cos9thpiminplylem2 34041 signstcl 34820 signstf 34821 signstf0 34823 signstfvn 34824 signsvtn0 34825 signstfvneq0 34827 signsvfn 34837 |
| Copyright terms: Public domain | W3C validator |