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

Theorem signswrid 30635
Description: The zero-skipping operation propagages nonzeros. (Contributed by Thierry Arnoux, 11-Oct-2018.)
Hypotheses
Ref Expression
signsw.p  |-  .+^  =  ( a  e.  { -u
1 ,  0 ,  1 } ,  b  e.  { -u 1 ,  0 ,  1 }  |->  if ( b  =  0 ,  a ,  b ) )
signsw.w  |-  W  =  { <. ( Base `  ndx ) ,  { -u 1 ,  0 ,  1 } >. ,  <. ( +g  `  ndx ) , 
.+^  >. }
Assertion
Ref Expression
signswrid  |-  ( X  e.  { -u 1 ,  0 ,  1 }  ->  ( X  .+^  0 )  =  X )
Distinct variable group:    a, b, X
Allowed substitution hints:    .+^ ( a, b)    W( a, b)

Proof of Theorem signswrid
StepHypRef Expression
1 c0ex 10034 . . . 4  |-  0  e.  _V
21tpid2 4304 . . 3  |-  0  e.  { -u 1 ,  0 ,  1 }
3 signsw.p . . . 4  |-  .+^  =  ( a  e.  { -u
1 ,  0 ,  1 } ,  b  e.  { -u 1 ,  0 ,  1 }  |->  if ( b  =  0 ,  a ,  b ) )
43signspval 30629 . . 3  |-  ( ( X  e.  { -u
1 ,  0 ,  1 }  /\  0  e.  { -u 1 ,  0 ,  1 } )  ->  ( X  .+^  0 )  =  if ( 0  =  0 ,  X ,  0 ) )
52, 4mpan2 707 . 2  |-  ( X  e.  { -u 1 ,  0 ,  1 }  ->  ( X  .+^  0 )  =  if ( 0  =  0 ,  X ,  0 ) )
6 eqid 2622 . . 3  |-  0  =  0
7 iftrue 4092 . . 3  |-  ( 0  =  0  ->  if ( 0  =  0 ,  X ,  0 )  =  X )
86, 7mp1i 13 . 2  |-  ( X  e.  { -u 1 ,  0 ,  1 }  ->  if (
0  =  0 ,  X ,  0 )  =  X )
95, 8eqtrd 2656 1  |-  ( X  e.  { -u 1 ,  0 ,  1 }  ->  ( X  .+^  0 )  =  X )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1483    e. wcel 1990   ifcif 4086   {cpr 4179   {ctp 4181   <.cop 4183   ` cfv 5888  (class class class)co 6650    |-> cmpt2 6652   0cc0 9936   1c1 9937   -ucneg 10267   ndxcnx 15854   Basecbs 15857   +g cplusg 15941
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-mulcl 9998  ax-i2m1 10004
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655
This theorem is referenced by:  signstfveq0  30654
  Copyright terms: Public domain W3C validator