| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sgnrn | Structured version Visualization version GIF version | ||
| Description: The range of the signum function. (Contributed by AV, 16-Jun-2026.) (Proof shortened by TA, 21-Jun-2026.) |
| Ref | Expression |
|---|---|
| sgnrn | ⊢ ran sgn = {-1, 0, 1} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-sgn 15114 | . . . . 5 ⊢ sgn = (𝑥 ∈ ℝ* ↦ if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 2 | 1 | fnmpt 6665 | . . . 4 ⊢ (∀𝑥 ∈ ℝ* if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ {-1, 0, 1} → sgn Fn ℝ*) |
| 3 | sgnval 15115 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) = if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 4 | sgncl 15124 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) ∈ {-1, 0, 1}) | |
| 5 | 3, 4 | eqeltrrd 2866 | . . . 4 ⊢ (𝑥 ∈ ℝ* → if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ {-1, 0, 1}) |
| 6 | 2, 5 | mprg 3085 | . . 3 ⊢ sgn Fn ℝ* |
| 7 | 4 | rgen 3081 | . . 3 ⊢ ∀𝑥 ∈ ℝ* (sgn‘𝑥) ∈ {-1, 0, 1} |
| 8 | fnfvrnss 7106 | . . 3 ⊢ ((sgn Fn ℝ* ∧ ∀𝑥 ∈ ℝ* (sgn‘𝑥) ∈ {-1, 0, 1}) → ran sgn ⊆ {-1, 0, 1}) | |
| 9 | 6, 7, 8 | mp2an 704 | . 2 ⊢ ran sgn ⊆ {-1, 0, 1} |
| 10 | sgnmnf 15122 | . . . 4 ⊢ (sgn‘-∞) = -1 | |
| 11 | mnfxr 11254 | . . . . 5 ⊢ -∞ ∈ ℝ* | |
| 12 | fnfvelrn 7065 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ -∞ ∈ ℝ*) → (sgn‘-∞) ∈ ran sgn) | |
| 13 | 6, 11, 12 | mp2an 704 | . . . 4 ⊢ (sgn‘-∞) ∈ ran sgn |
| 14 | 10, 13 | eqeltrri 2862 | . . 3 ⊢ -1 ∈ ran sgn |
| 15 | sgn0 15116 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 16 | 0xr 11244 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 17 | fnfvelrn 7065 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 0 ∈ ℝ*) → (sgn‘0) ∈ ran sgn) | |
| 18 | 6, 16, 17 | mp2an 704 | . . . 4 ⊢ (sgn‘0) ∈ ran sgn |
| 19 | 15, 18 | eqeltrri 2862 | . . 3 ⊢ 0 ∈ ran sgn |
| 20 | sgn1 15119 | . . . 4 ⊢ (sgn‘1) = 1 | |
| 21 | 1xr 11256 | . . . . 5 ⊢ 1 ∈ ℝ* | |
| 22 | fnfvelrn 7065 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 1 ∈ ℝ*) → (sgn‘1) ∈ ran sgn) | |
| 23 | 6, 21, 22 | mp2an 704 | . . . 4 ⊢ (sgn‘1) ∈ ran sgn |
| 24 | 20, 23 | eqeltrri 2862 | . . 3 ⊢ 1 ∈ ran sgn |
| 25 | tpssi 4799 | . . 3 ⊢ ((-1 ∈ ran sgn ∧ 0 ∈ ran sgn ∧ 1 ∈ ran sgn) → {-1, 0, 1} ⊆ ran sgn) | |
| 26 | 14, 19, 24, 25 | mp3an 1485 | . 2 ⊢ {-1, 0, 1} ⊆ ran sgn |
| 27 | 9, 26 | eqssi 3955 | 1 ⊢ ran sgn = {-1, 0, 1} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1563 ∈ wcel 2145 ∀wral 3079 ⊆ wss 3907 ifcif 4483 {ctp 4589 class class class wbr 5105 ran crn 5653 Fn wfn 6520 ‘cfv 6525 0cc0 11088 1c1 11089 -∞cmnf 11229 ℝ*cxr 11230 < clt 11231 -cneg 11430 sgncsgn 15113 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-po 5560 df-so 5561 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-sgn 15114 |
| This theorem is referenced by: sgnfo 15126 |
| Copyright terms: Public domain | W3C validator |