| 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 15249 | . . . . 5 ⊢ sgn = (𝑥 ∈ ℝ* ↦ if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 2 | 1 | fnmpt 6684 | . . . 4 ⊢ (∀𝑥 ∈ ℝ* if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ { -1, 0, 1} → sgn Fn ℝ*) |
| 3 | sgnval 15250 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) = if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1))) | |
| 4 | sgncl 15259 | . . . . 5 ⊢ (𝑥 ∈ ℝ* → (sgn‘𝑥) ∈ { -1, 0, 1}) | |
| 5 | 3, 4 | eqeltrrd 2861 | . . . 4 ⊢ (𝑥 ∈ ℝ* → if(𝑥 = 0, 0, if(𝑥 < 0, -1, 1)) ∈ { -1, 0, 1}) |
| 6 | 2, 5 | mprg 3082 | . . 3 ⊢ sgn Fn ℝ* |
| 7 | 4 | rgen 3078 | . . 3 ⊢ ∀𝑥 ∈ ℝ* (sgn‘𝑥) ∈ { -1, 0, 1} |
| 8 | fnfvrnss 7126 | . . 3 ⊢ ((sgn Fn ℝ* ∧ ∀𝑥 ∈ ℝ* (sgn‘𝑥) ∈ { -1, 0, 1}) → ran sgn ⊆ { -1, 0, 1}) | |
| 9 | 6, 7, 8 | mp2an 705 | . 2 ⊢ ran sgn ⊆ { -1, 0, 1} |
| 10 | sgnmnf 15257 | . . . 4 ⊢ (sgn‘-∞) = -1 | |
| 11 | mnfxr 11373 | . . . . 5 ⊢ -∞ ∈ ℝ* | |
| 12 | fnfvelrn 7085 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ -∞ ∈ ℝ*) → (sgn‘-∞) ∈ ran sgn) | |
| 13 | 6, 11, 12 | mp2an 705 | . . . 4 ⊢ (sgn‘-∞) ∈ ran sgn |
| 14 | 10, 13 | eqeltrri 2857 | . . 3 ⊢ -1 ∈ ran sgn |
| 15 | sgn0 15251 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 16 | 0xr 11363 | . . . . 5 ⊢ 0 ∈ ℝ* | |
| 17 | fnfvelrn 7085 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 0 ∈ ℝ*) → (sgn‘0) ∈ ran sgn) | |
| 18 | 6, 16, 17 | mp2an 705 | . . . 4 ⊢ (sgn‘0) ∈ ran sgn |
| 19 | 15, 18 | eqeltrri 2857 | . . 3 ⊢ 0 ∈ ran sgn |
| 20 | sgn1 15254 | . . . 4 ⊢ (sgn‘1) = 1 | |
| 21 | 1xr 11375 | . . . . 5 ⊢ 1 ∈ ℝ* | |
| 22 | fnfvelrn 7085 | . . . . 5 ⊢ ((sgn Fn ℝ* ∧ 1 ∈ ℝ*) → (sgn‘1) ∈ ran sgn) | |
| 23 | 6, 21, 22 | mp2an 705 | . . . 4 ⊢ (sgn‘1) ∈ ran sgn |
| 24 | 20, 23 | eqeltrri 2857 | . . 3 ⊢ 1 ∈ ran sgn |
| 25 | tpssi 4792 | . . 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 3925 | 1 ⊢ ran sgn = { -1, 0, 1} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 ∀wral 3076 ⊆ wss 3896 ifcif 4481 {ctp 4588 class class class wbr 5102 ran crn 5652 Fn wfn 6538 ‘cfv 6543 0cc0 11207 1c1 11208 -∞cmnf 11348 ℝ*cxr 11349 < clt 11350 -cneg 11549 sgncsgn 15248 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-po 5559 df-so 5560 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-sgn 15249 |
| This theorem is used by: sgnfo 15261 |
| Copyright terms: Public domain | W3C validator |