| 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 6889 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = (sgn‘0)) |
| 3 | sgn0 15146 | . . . 4 ⊢ (sgn‘0) = 0 | |
| 4 | 2, 3 | eqtrdi 2816 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) = 0) |
| 5 | c0ex 11211 | . . . 4 ⊢ 0 ∈ V | |
| 6 | 5 | tpid2 4738 | . . 3 ⊢ 0 ∈ {-1, 0, 1} |
| 7 | 4, 6 | eqeltrdi 2873 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 8 | sgnn 15151 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) = -1) | |
| 9 | negex 11466 | . . . . . 6 ⊢ -1 ∈ V | |
| 10 | 9 | tpid1 4736 | . . . . 5 ⊢ -1 ∈ {-1, 0, 1} |
| 11 | 8, 10 | eqeltrdi 2873 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 12 | 11 | adantlr 728 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 𝐴 < 0) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 13 | sgnp 15147 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) = 1) | |
| 14 | 1ex 11214 | . . . . . 6 ⊢ 1 ∈ V | |
| 15 | 14 | tpid3 4741 | . . . . 5 ⊢ 1 ∈ {-1, 0, 1} |
| 16 | 13, 15 | eqeltrdi 2873 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 17 | 16 | adantlr 728 | . . 3 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ 0) ∧ 0 < 𝐴) → (sgn‘𝐴) ∈ {-1, 0, 1}) |
| 18 | 0xr 11267 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 19 | xrlttri2 13179 | . . . . 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 3047 | 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 2146 ≠ wne 2960 {ctp 4595 class class class wbr 5111 ‘cfv 6540 0cc0 11111 1c1 11112 ℝ*cxr 11253 < clt 11254 -cneg 11453 sgncsgn 15143 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-i2m1 11179 ax-rnegex 11182 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 |
| 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 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-neg 11455 df-sgn 15144 |
| This theorem is used by: sgnrn 15155 sgnclre 15159 sgnmulsgn 15166 sgnmulsgp 33222 cos9thpiminplylem2 34213 signstcl 34993 signstf 34994 signstf0 34996 signstfvn 34997 signsvtn0 34998 signstfvneq0 35000 signsvfn 35010 |
| Copyright terms: Public domain | W3C validator |