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 34551
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 34543 . . 3 ((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) → (𝑋 𝑌) = if(𝑌 = 0, 𝑋, 𝑌))
32adantr 480 . 2 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 𝑌) = if(𝑌 = 0, 𝑋, 𝑌))
4 neeq1 2987 . . 3 (𝑋 = if(𝑌 = 0, 𝑋, 𝑌) → (𝑋 ≠ 0 ↔ if(𝑌 = 0, 𝑋, 𝑌) ≠ 0))
5 neeq1 2987 . . 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 2932 . . 3 ((((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) ∧ ¬ 𝑌 = 0) → 𝑌 ≠ 0)
94, 5, 6, 8ifbothda 4527 . 2 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → if(𝑌 = 0, 𝑋, 𝑌) ≠ 0)
103, 9eqnetrd 2992 1 (((𝑋 ∈ {-1, 0, 1} ∧ 𝑌 ∈ {-1, 0, 1}) ∧ 𝑋 ≠ 0) → (𝑋 𝑌) ≠ 0)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1540  wcel 2109  wne 2925  ifcif 4488  {cpr 4591  {ctp 4593  cop 4595  cfv 6511  (class class class)co 7387  cmpo 7389  0cc0 11068  1c1 11069  -cneg 11406  ndxcnx 17163  Basecbs 17179  +gcplusg 17220
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-iota 6464  df-fun 6513  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392
This theorem is referenced by:  signstfvneq0  34563
  Copyright terms: Public domain W3C validator