| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sgn0 | Structured version Visualization version GIF version | ||
| Description: The signum of 0 is 0. (Contributed by David A. Wheeler, 15-May-2015.) |
| Ref | Expression |
|---|---|
| sgn0 | ⊢ (sgn‘0) = 0 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0xr 11251 | . . 3 ⊢ 0 ∈ ℝ* | |
| 2 | sgnval 15121 | . . 3 ⊢ (0 ∈ ℝ* → (sgn‘0) = if(0 = 0, 0, if(0 < 0, -1, 1))) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ (sgn‘0) = if(0 = 0, 0, if(0 < 0, -1, 1)) |
| 4 | eqid 2763 | . . 3 ⊢ 0 = 0 | |
| 5 | 4 | iftruei 4494 | . 2 ⊢ if(0 = 0, 0, if(0 < 0, -1, 1)) = 0 |
| 6 | 3, 5 | eqtri 2786 | 1 ⊢ (sgn‘0) = 0 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 ifcif 4487 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-pr 5404 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-i2m1 11163 ax-rnegex 11166 ax-cnre 11168 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 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-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7413 df-xr 11242 df-neg 11439 df-sgn 15120 |
| This theorem is referenced by: sgncl 15130 sgnrn 15131 sgnmul 15140 sgnsgn 33175 signstfveq0 34964 |
| Copyright terms: Public domain | W3C validator |