Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  signswn0 Structured version   Visualization version   GIF version

Theorem signswn0 34563
Description: The zero-skipping operation propagages nonzeros. (Contributed by Thierry Arnoux, 11-Oct-2018.)
Hypotheses
Ref Expression
signsw.p = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏))
signsw.w 𝑊 = {⟨(Base‘ndx), {-1, 0, 1}⟩, ⟨(+g‘ndx), ⟩}
Assertion
Ref Expression
signswn0 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 𝑌) ≠ 0)
Distinct variable groups:   𝑎,𝑏,𝑋   𝑌,𝑎,𝑏
Allowed substitution hints:   (𝑎,𝑏)   𝑊(𝑎,𝑏)

Proof of Theorem signswn0
StepHypRef Expression
1 signsw.p . . . 4 = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏))
21signspval 34555 . . 3 ((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) → (𝑋 𝑌) = if(𝑌 = 0, 𝑋, 𝑌))
32adantr 480 . 2 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 𝑌) = if(𝑌 = 0, 𝑋, 𝑌))
4 neeq1 2988 . . 3 (𝑋 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑋 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0))
5 neeq1 2988 . . 3 (𝑌 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑌 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0))
6 simplr 768 . . 3 ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ 𝑌 = 0) → 𝑋 ≠ 0)
7 simpr 484 . . . 4 ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → ¬ 𝑌 = 0)
87neqned 2933 . . 3 ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → 𝑌 ≠ 0)
94, 5, 6, 8ifbothda 4512 . 2 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)
103, 9eqnetrd 2993 1 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 𝑌) ≠ 0)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2110  wne 2926  ifcif 4473  {cpr 4576  {ctp 4578  cop 4580  cfv 6477  (class class class)co 7341  cmpo 7343  0cc0 10998  1c1 10999  -cneg 11337  ndxcnx 17096  Basecbs 17112  +gcplusg 17153
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3394  df-v 3436  df-sbc 3740  df-dif 3903  df-un 3905  df-ss 3917  df-nul 4282  df-if 4474  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-iota 6433  df-fun 6479  df-fv 6485  df-ov 7344  df-oprab 7345  df-mpo 7346
This theorem is referenced by:  signstfvneq0  34575
  Copyright terms: Public domain W3C validator