| 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 15123 | . . . . 5 ⊢ sgn = (𝑥 ∈ ℝ* ↦ if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 2 | 1 | fnmpt 6676 | . . . 4 ⊢ (∀𝑥 ∈ ℝ* if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ {-1, 0, 1} → sgn Fn ℝ*) |
| 3 | sgnval 15124 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) = if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 4 | sgncl 15133 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) ∈ {-1, 0, 1}) | |
| 5 | 3, 4 | eqeltrrd 2870 | . . . 4 ⊢ (𝑥 ∈ ℝ* → if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ {-1, 0, 1}) |
| 6 | 2, 5 | mprg 3091 | . . 3 ⊢ sgn Fn ℝ* |
| 7 | 4 | rgen 3087 | . . 3 ⊢ ∀𝑥 ∈ ℝ* (sgn‘𝑥) ∈ {-1, 0, 1} |
| 8 | fnfvrnss 7117 | . . 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 15131 | . . . 4 ⊢ (sgn‘-∞) = -1 | |
| 11 | mnfxr 11265 | . . . . 5 ⊢ -∞ ∈ ℝ* | |
| 12 | fnfvelrn 7076 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ -∞ ∈ ℝ*) → (sgn‘-∞) ∈ ran sgn) | |
| 13 | 6, 11, 12 | mp2an 704 | . . . 4 ⊢ (sgn‘-∞) ∈ ran sgn |
| 14 | 10, 13 | eqeltrri 2866 | . . 3 ⊢ -1 ∈ ran sgn |
| 15 | sgn0 15125 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 16 | 0xr 11255 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 17 | fnfvelrn 7076 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 0 ∈ ℝ*) → (sgn‘0) ∈ ran sgn) | |
| 18 | 6, 16, 17 | mp2an 704 | . . . 4 ⊢ (sgn‘0) ∈ ran sgn |
| 19 | 15, 18 | eqeltrri 2866 | . . 3 ⊢ 0 ∈ ran sgn |
| 20 | sgn1 15128 | . . . 4 ⊢ (sgn‘1) = 1 | |
| 21 | 1xr 11267 | . . . . 5 ⊢ 1 ∈ ℝ* | |
| 22 | fnfvelrn 7076 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 1 ∈ ℝ*) → (sgn‘1) ∈ ran sgn) | |
| 23 | 6, 21, 22 | mp2an 704 | . . . 4 ⊢ (sgn‘1) ∈ ran sgn |
| 24 | 20, 23 | eqeltrri 2866 | . . 3 ⊢ 1 ∈ ran sgn |
| 25 | tpssi 4807 | . . 3 ⊢ ((-1 ∈ ran sgn ∧ 0 ∈ ran sgn ∧ 1 ∈ ran sgn) → {-1, 0, 1} ⊆ ran sgn) | |
| 26 | 14, 19, 24, 25 | mp3an 1487 | . 2 ⊢ {-1, 0, 1} ⊆ ran sgn |
| 27 | 9, 26 | eqssi 3961 | 1 ⊢ ran sgn = {-1, 0, 1} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1567 ∈ wcel 2149 ∀wral 3085 ⊆ wss 3913 ifcif 4492 {ctp 4598 class class class wbr 5113 ran crn 5663 Fn wfn 6532 ‘cfv 6537 0cc0 11099 1c1 11100 -∞cmnf 11240 ℝ*cxr 11241 < clt 11242 -cneg 11441 sgncsgn 15122 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-po 5570 df-so 5571 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-sgn 15123 |
| This theorem is referenced by: sgnfo 15135 |
| Copyright terms: Public domain | W3C validator |