| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 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 22 | . 2 ⊢ (𝐴 ∈ ℝ* → 𝐴 ∈ ℝ*) | |
| 2 | eqeq1 2741 | . . 3 ⊢ ((sgn‘𝐴) = 0 → ((sgn‘𝐴) = 0 ↔ 0 = 0)) | |
| 3 | 2 | bibi1d 343 | . 2 ⊢ ((sgn‘𝐴) = 0 → (((sgn‘𝐴) = 0 ↔ 𝐴 = 0) ↔ (0 = 0 ↔ 𝐴 = 0))) |
| 4 | eqeq1 2741 | . . 3 ⊢ ((sgn‘𝐴) = 1 → ((sgn‘𝐴) = 0 ↔ 1 = 0)) | |
| 5 | 4 | bibi1d 343 | . 2 ⊢ ((sgn‘𝐴) = 1 → (((sgn‘𝐴) = 0 ↔ 𝐴 = 0) ↔ (1 = 0 ↔ 𝐴 = 0))) |
| 6 | eqeq1 2741 | . . 3 ⊢ ((sgn‘𝐴) = -1 → ((sgn‘𝐴) = 0 ↔ -1 = 0)) | |
| 7 | 6 | bibi1d 343 | . 2 ⊢ ((sgn‘𝐴) = -1 → (((sgn‘𝐴) = 0 ↔ 𝐴 = 0) ↔ (-1 = 0 ↔ 𝐴 = 0))) |
| 8 | simpr 484 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 𝐴 = 0) | |
| 9 | 8 | eqcomd 2743 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → 0 = 𝐴) |
| 10 | 9 | eqeq1d 2739 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 = 0) → (0 = 0 ↔ 𝐴 = 0)) |
| 11 | ax-1ne0 11098 | . . . . 5 ⊢ 1 ≠ 0 | |
| 12 | 11 | a1i 11 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 1 ≠ 0) |
| 13 | 12 | neneqd 2938 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → ¬ 1 = 0) |
| 14 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 0 < 𝐴) | |
| 15 | 14 | gt0ne0d 11705 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 𝐴 ≠ 0) |
| 16 | 15 | neneqd 2938 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → ¬ 𝐴 = 0) |
| 17 | 13, 16 | 2falsed 376 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (1 = 0 ↔ 𝐴 = 0)) |
| 18 | 1cnd 11130 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 1 ∈ ℂ) | |
| 19 | 11 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 1 ≠ 0) |
| 20 | 18, 19 | negne0d 11494 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → -1 ≠ 0) |
| 21 | 20 | neneqd 2938 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → ¬ -1 = 0) |
| 22 | simpr 484 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 𝐴 < 0) | |
| 23 | 22 | lt0ne0d 11706 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → 𝐴 ≠ 0) |
| 24 | 23 | neneqd 2938 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → ¬ 𝐴 = 0) |
| 25 | 21, 24 | 2falsed 376 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 < 0) → (-1 = 0 ↔ 𝐴 = 0)) |
| 26 | 1, 3, 5, 7, 10, 17, 25 | sgn3da 32922 | 1 ⊢ (𝐴 ∈ ℝ* → ((sgn‘𝐴) = 0 ↔ 𝐴 = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 class class class wbr 5086 ‘cfv 6492 0cc0 11029 1c1 11030 ℝ*cxr 11169 < clt 11170 -cneg 11369 sgncsgn 15039 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-po 5532 df-so 5533 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-sub 11370 df-neg 11371 df-sgn 15040 |
| This theorem is referenced by: signsvtn0 34730 signstfvneq0 34732 |
| Copyright terms: Public domain | W3C validator |