| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > signswn0 | Structured version Visualization version GIF version | ||
| Description: The zero-skipping operation propagates nonzeros. (Contributed by Thierry Arnoux, 11-Oct-2018.) |
| Ref | Expression |
|---|---|
| signsw.p | ⊢ ⨣ = (𝑎 ∈ { -1, 0, 1}, 𝑏 ∈ { -1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏)) |
| signsw.w | ⊢ 𝑊 = {〈(Base‘ndx), { -1, 0, 1}〉, 〈(+g‘ndx), ⨣ 〉} |
| Ref | Expression |
|---|---|
| signswn0 | ⊢ (((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 ⨣ 𝑌) ≠ 0) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | signsw.p | . . . 4 ⊢ ⨣ = (𝑎 ∈ { -1, 0, 1}, 𝑏 ∈ { -1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏)) | |
| 2 | 1 | signspval 35223 | . . 3 ⊢ ((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) → (𝑋 ⨣ 𝑌) = if(𝑌 = 0, 𝑋, 𝑌)) |
| 3 | 2 | adantr 486 | . 2 ⊢ (((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 ⨣ 𝑌) = if(𝑌 = 0, 𝑋, 𝑌)) |
| 4 | neeq1 3017 | . . 3 ⊢ (𝑋 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑋 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)) | |
| 5 | neeq1 3017 | . . 3 ⊢ (𝑌 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑌 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)) | |
| 6 | simplr 781 | . . 3 ⊢ ((((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ 𝑌 = 0) → 𝑋 ≠ 0) | |
| 7 | simpr 490 | . . . 4 ⊢ ((((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → ¬ 𝑌 = 0) | |
| 8 | 7 | neqned 2962 | . . 3 ⊢ ((((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → 𝑌 ≠ 0) |
| 9 | 4, 5, 6, 8 | ifbothda 4520 | . 2 ⊢ (((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) → if(𝑌 = 0, 𝑋, 𝑌) ≠ 0) |
| 10 | 3, 9 | eqnetrd 3022 | 1 ⊢ (((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 ⨣ 𝑌) ≠ 0) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ifcif 4481 {cpr 4585 {ctp 4587 〈cop 4589 ‘cfv 6538 (class class class)co 7420 ∈ cmpo 7422 0cc0 11200 1c1 11201 -cneg 11542 ndxcnx 17371 Basecbs 17387 +gcplusg 17428 |
| 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-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-iota 6494 df-fun 6540 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 |
| This theorem is used by: signstfvneq0 35243 |
| Copyright terms: Public domain | W3C validator |