| 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 489 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 𝐴 = 0) | |
| 2 | 1 | fveq2d 6885 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = (sgn‘0)) |
| 3 | sgn0 15122 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 4 | 2, 3 | eqtrdi 2814 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = 0) |
| 5 | c0ex 11195 | . . . 4 ⊢ 0 ∈ V | |
| 6 | 5 | tpid2 4736 | . . 3 ⊢ 0 ∈ {-1, 0, 1} |
| 7 | 4, 6 | eqeltrdi 2871 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 8 | sgnn 15127 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 9 | negex 11450 | . . . . . 6 ⊢ -1 ∈ V | |
| 10 | 9 | tpid1 4734 | . . . . 5 ⊢ -1 ∈ {-1, 0, 1} |
| 11 | 8, 10 | eqeltrdi 2871 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 12 | 11 | adantlr 727 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 13 | sgnp 15123 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 14 | 1ex 11198 | . . . . . 6 ⊢ 1 ∈ V | |
| 15 | 14 | tpid3 4739 | . . . . 5 ⊢ 1 ∈ {-1, 0, 1} |
| 16 | 13, 15 | eqeltrdi 2871 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 17 | 16 | adantlr 727 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 18 | 0xr 11251 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 19 | xrlttri2 13162 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) → (𝐴 ≠ 0 ↔ (𝐴 < 0 ∨ 0 < 𝐴))) | |
| 20 | 19 | biimpa 481 | . . . 4 ⊢ (((𝐴 ∈ ℝ* ∧ 0 ∈ ℝ*) ∧ 𝐴 ≠ 0) → (𝐴 < 0 ∨ 0 < 𝐴)) |
| 21 | 18, 20 | mpanl2 713 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) → (𝐴 < 0 ∨ 0 < 𝐴)) |
| 22 | 12, 17, 21 | mpjaodan 973 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 23 | 7, 22 | pm2.61dane 3045 | 1 ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 {ctp 4593 class class class wbr 5109 ‘cfv 6536 0cc0 11095 1c1 11096 ℝ*cxr 11237 < clt 11238 -cneg 11437 sgncsgn 15119 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-i2m1 11163 ax-rnegex 11166 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 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-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-po 5569 df-so 5570 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-neg 11439 df-sgn 15120 |
| This theorem is referenced by: sgnrn 15131 sgnclre 15135 sgnmulsgn 15142 sgnmulsgp 33176 cos9thpiminplylem2 34173 signstcl 34952 signstf 34953 signstf0 34955 signstfvn 34956 signsvtn0 34957 signstfvneq0 34959 signsvfn 34969 |
| Copyright terms: Public domain | W3C validator |