| 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 11349 | . . 3 ⊢ 0 ∈ ℝ* | |
| 2 | sgnval 15234 | . . 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 2761 | . . 3 ⊢ 0 = 0 | |
| 5 | 4 | iftruei 4489 | . 2 ⊢ if(0 = 0, 0, if(0 < 0, -1, 1)) = 0 |
| 6 | 3, 5 | eqtri 2784 | 1 ⊢ (sgn‘0) = 0 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 ifcif 4482 class class class wbr 5103 ‘cfv 6537 0cc0 11193 1c1 11194 ℝ*cxr 11335 < clt 11336 -cneg 11535 sgncsgn 15232 |
| 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-pr 5391 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-i2m1 11261 ax-rnegex 11264 ax-cnre 11266 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7421 df-xr 11340 df-neg 11537 df-sgn 15233 |
| This theorem is used by: sgncl 15243 sgnrn 15244 sgnmul 15253 sgnsgn 33415 signstfveq0 35199 |
| Copyright terms: Public domain | W3C validator |