| 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 35251 | . . 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 3021 | . . 3 ⊢ (𝑋 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑋 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)) | |
| 5 | neeq1 3021 | . . 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 2966 | . . 3 ⊢ ((((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → 𝑌 ≠ 0) |
| 9 | 4, 5, 6, 8 | ifbothda 4524 | . 2 ⊢ (((𝑋 ∈ { -1, 0, 1} ∧ 𝑌 ∈ { -1, 0, 1}) ∧ 𝑋 ≠ 0) → if(𝑌 = 0, 𝑋, 𝑌) ≠ 0) |
| 10 | 3, 9 | eqnetrd 3026 | 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 1570 ∈ wcel 2147 ≠ wne 2959 ifcif 4485 {cpr 4590 {ctp 4592 〈cop 4838 ‘cfv 6558 (class class class)co 7443 ∈ cmpo 7445 0cc0 11227 1c1 11228 -cneg 11569 ndxcnx 17400 Basecbs 17416 +gcplusg 17457 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-iota 6512 df-fun 6560 df-fv 6566 df-ov 7446 df-oprab 7447 df-mpo 7448 |
| This theorem is used by: signstfvneq0 35271 |
| Copyright terms: Public domain | W3C validator |