| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sgn0bi | Structured version Visualization version GIF version | ||
| Description: Zero signum. (Contributed by Thierry Arnoux, 10-Oct-2018.) |
| Ref | Expression |
|---|---|
| sgn0bi | ⊢ (𝐴 ∈ ℝ* → ((sgn‘𝐴) = 0 ↔ 𝐴 = 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . 2 ⊢ (𝐴 ∈ ℝ* → 𝐴 ∈ ℝ*) | |
| 2 | eqeq1 2773 | . . 3 ⊢ ((sgn‘𝐴) = 0 → ((sgn‘𝐴) = 0 ↔ 0 = 0)) | |
| 3 | 2 | bibi1d 346 | . 2 ⊢ ((sgn‘𝐴) = 0 → (((sgn‘𝐴) = 0 ↔ 𝐴 = 0) ↔ (0 = 0 ↔ 𝐴 = 0))) |
| 4 | eqeq1 2773 | . . 3 ⊢ ((sgn‘𝐴) = 1 → ((sgn‘𝐴) = 0 ↔ 1 = 0)) | |
| 5 | 4 | bibi1d 346 | . 2 ⊢ ((sgn‘𝐴) = 1 → (((sgn‘𝐴) = 0 ↔ 𝐴 = 0) ↔ (1 = 0 ↔ 𝐴 = 0))) |
| 6 | eqeq1 2773 | . . 3 ⊢ ((sgn‘𝐴) = -1 → ((sgn‘𝐴) = 0 ↔ -1 = 0)) | |
| 7 | 6 | bibi1d 346 | . 2 ⊢ ((sgn‘𝐴) = -1 → (((sgn‘𝐴) = 0 ↔ 𝐴 = 0) ↔ (-1 = 0 ↔ 𝐴 = 0))) |
| 8 | simpr 489 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 𝐴 = 0) | |
| 9 | 8 | eqcomd 2775 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 0 = 𝐴) |
| 10 | 9 | eqeq1d 2771 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (0 = 0 ↔ 𝐴 = 0)) |
| 11 | ax-1ne0 11165 | . . . . 5 ⊢ 1 ≠ 0 | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 1 ≠ 0) |
| 13 | 12 | neneqd 2969 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → ¬ 1 = 0) |
| 14 | simpr 489 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 0 < 𝐴) | |
| 15 | 14 | gt0ne0d 11774 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 𝐴 ≠ 0) |
| 16 | 15 | neneqd 2969 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → ¬ 𝐴 = 0) |
| 17 | 13, 16 | 2falsed 379 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (1 = 0 ↔ 𝐴 = 0)) |
| 18 | 1cnd 11198 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 1 ∈ ℂ) | |
| 19 | 11 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 1 ≠ 0) |
| 20 | 18, 19 | negne0d 11563 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → -1 ≠ 0) |
| 21 | 20 | neneqd 2969 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → ¬ -1 = 0) |
| 22 | simpr 489 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 𝐴 < 0) | |
| 23 | 22 | lt0ne0d 11775 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 𝐴 ≠ 0) |
| 24 | 23 | neneqd 2969 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → ¬ 𝐴 = 0) |
| 25 | 21, 24 | 2falsed 379 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (-1 = 0 ↔ 𝐴 = 0)) |
| 26 | 1, 3, 5, 7, 10, 17, 25 | sgn3da 15134 | 1 ⊢ (𝐴 ∈ ℝ* → ((sgn‘𝐴) = 0 ↔ 𝐴 = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 class class class wbr 5110 ‘cfv 6534 0cc0 11096 1c1 11097 ℝ*cxr 11238 < clt 11239 -cneg 11438 sgncsgn 15119 |
| 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 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 |
| 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 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-sub 11439 df-neg 11440 df-sgn 15120 |
| This theorem is referenced by: signsvtn0 34898 signstfvneq0 34900 |
| Copyright terms: Public domain | W3C validator |