| 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 15120 | . . . . 5 ⊢ sgn = (𝑥 ∈ ℝ* ↦ if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 2 | 1 | fnmpt 6675 | . . . 4 ⊢ (∀𝑥 ∈ ℝ* if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ {-1, 0, 1} → sgn Fn ℝ*) |
| 3 | sgnval 15121 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) = if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 4 | sgncl 15130 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) ∈ {-1, 0, 1}) | |
| 5 | 3, 4 | eqeltrrd 2864 | . . . 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 7116 | . . 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 15128 | . . . 4 ⊢ (sgn‘-∞) = -1 | |
| 11 | mnfxr 11261 | . . . . 5 ⊢ -∞ ∈ ℝ* | |
| 12 | fnfvelrn 7075 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ -∞ ∈ ℝ*) → (sgn‘-∞) ∈ ran sgn) | |
| 13 | 6, 11, 12 | mp2an 704 | . . . 4 ⊢ (sgn‘-∞) ∈ ran sgn |
| 14 | 10, 13 | eqeltrri 2860 | . . 3 ⊢ -1 ∈ ran sgn |
| 15 | sgn0 15122 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 16 | 0xr 11251 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 17 | fnfvelrn 7075 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 0 ∈ ℝ*) → (sgn‘0) ∈ ran sgn) | |
| 18 | 6, 16, 17 | mp2an 704 | . . . 4 ⊢ (sgn‘0) ∈ ran sgn |
| 19 | 15, 18 | eqeltrri 2860 | . . 3 ⊢ 0 ∈ ran sgn |
| 20 | sgn1 15125 | . . . 4 ⊢ (sgn‘1) = 1 | |
| 21 | 1xr 11263 | . . . . 5 ⊢ 1 ∈ ℝ* | |
| 22 | fnfvelrn 7075 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 1 ∈ ℝ*) → (sgn‘1) ∈ ran sgn) | |
| 23 | 6, 21, 22 | mp2an 704 | . . . 4 ⊢ (sgn‘1) ∈ ran sgn |
| 24 | 20, 23 | eqeltrri 2860 | . . 3 ⊢ 1 ∈ ran sgn |
| 25 | tpssi 4803 | . . 3 ⊢ ((-1 ∈ ran sgn ∧ 0 ∈ ran sgn ∧ 1 ∈ ran sgn) → {-1, 0, 1} ⊆ ran sgn) | |
| 26 | 14, 19, 24, 25 | mp3an 1490 | . 2 ⊢ {-1, 0, 1} ⊆ ran sgn |
| 27 | 9, 26 | eqssi 3953 | 1 ⊢ ran sgn = {-1, 0, 1} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 ∀wral 3079 ⊆ wss 3905 ifcif 4487 {ctp 4593 class class class wbr 5109 ran crn 5662 Fn wfn 6531 ‘cfv 6536 0cc0 11095 1c1 11096 -∞cmnf 11236 ℝ*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-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 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-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-po 5569 df-so 5570 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-sgn 15120 |
| This theorem is referenced by: sgnfo 15132 |
| Copyright terms: Public domain | W3C validator |