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 propagages 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 32539 | . . 3 ⊢ ((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) → (𝑋 ⨣ 𝑌) = if(𝑌 = 0, 𝑋, 𝑌)) |
3 | 2 | adantr 481 | . 2 ⊢ (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 ⨣ 𝑌) = if(𝑌 = 0, 𝑋, 𝑌)) |
4 | neeq1 3006 | . . 3 ⊢ (𝑋 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑋 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)) | |
5 | neeq1 3006 | . . 3 ⊢ (𝑌 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑌 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)) | |
6 | simplr 766 | . . 3 ⊢ ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ 𝑌 = 0) → 𝑋 ≠ 0) | |
7 | simpr 485 | . . . 4 ⊢ ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → ¬ 𝑌 = 0) | |
8 | 7 | neqned 2950 | . . 3 ⊢ ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → 𝑌 ≠ 0) |
9 | 4, 5, 6, 8 | ifbothda 4497 | . 2 ⊢ (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → if(𝑌 = 0, 𝑋, 𝑌) ≠ 0) |
10 | 3, 9 | eqnetrd 3011 | 1 ⊢ (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 ⨣ 𝑌) ≠ 0) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ifcif 4459 {cpr 4563 {ctp 4565 〈cop 4567 ‘cfv 6426 (class class class)co 7267 ∈ cmpo 7269 0cc0 10881 1c1 10882 -cneg 11216 ndxcnx 16904 Basecbs 16922 +gcplusg 16972 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5221 ax-nul 5228 ax-pr 5350 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3431 df-sbc 3716 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5074 df-opab 5136 df-id 5484 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-iota 6384 df-fun 6428 df-fv 6434 df-ov 7270 df-oprab 7271 df-mpo 7272 |
This theorem is referenced by: signstfvneq0 32559 |
Copyright terms: Public domain | W3C validator |