| 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 6920 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = (sgn‘0)) |
| 3 | sgn0 15285 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 4 | 2, 3 | eqtrdi 2814 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = 0) |
| 5 | c0ex 11339 | . . . 4 ⊢ 0 ∈ V | |
| 6 | 5 | tpid2 4733 | . . 3 ⊢ 0 ∈ { -1, 0, 1} |
| 7 | 4, 6 | eqeltrdi 2872 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 8 | sgnn 15290 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 9 | negex 11594 | . . . . . 6 ⊢ -1 ∈ V | |
| 10 | 9 | tpid1 4731 | . . . . 5 ⊢ -1 ∈ { -1, 0, 1} |
| 11 | 8, 10 | eqeltrdi 2872 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 12 | 11 | adantlr 728 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 13 | sgnp 15286 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 14 | 1ex 11342 | . . . . . 6 ⊢ 1 ∈ V | |
| 15 | 14 | tpid3 4736 | . . . . 5 ⊢ 1 ∈ { -1, 0, 1} |
| 16 | 13, 15 | eqeltrdi 2872 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 17 | 16 | adantlr 728 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| 18 | 0xr 11395 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 19 | xrlttri2 13311 | . . . . 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 3046 | 1 ⊢ (𝐴 ∈ ℝ* → (sgn‘𝐴) ∈ { -1, 0, 1}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 {ctp 4592 class class class wbr 5108 ‘cfv 6566 0cc0 11239 1c1 11240 ℝ*cxr 11381 < clt 11382 -cneg 11581 sgncsgn 15282 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-i2m1 11307 ax-rnegex 11310 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-neg 11583 df-sgn 15283 |
| This theorem is used by: sgnrn 15294 sgnclre 15298 sgnmulsgn 15305 sgnmulsgp 33519 cos9thpiminplylem2 34526 signstcl 35305 signstf 35306 signstf0 35308 signstfvn 35309 signsvtn0 35310 signstfvneq0 35312 signsvfn 35322 |
| Copyright terms: Public domain | W3C validator |