[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem short-law-righthift-not
⊦ (i = 32768 ∧ j = 1 → i2s(i i>> j) ≠ i2s(s2i(i2s(i)) i>> j)) ∧ (i = 32768 ∧ j = 1 → i2s(i i>>> j) ≠ i2s(s2i(i2s(i)) i>>> j))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 24
Used lemmas:
num-i2s-pos
,
notequal-01
,
sis-pos-high
,
Used spec theorems:
intops
/
intshiftrzero-def
int2bits
/
int2bits-pos-num
int2bits
/
int2bits-neg-num
bitopsaux
/
fill-fill
int2bits
/
int2bits-pos
int2bits
/
bits2int-neg-03
Used simplifier rules:
list-last
/bitlista/
last-def
list-last
/bitlista/
l-05
list-del
/bitlista/
lastn-one
list-del
/bitlista/
num-lastN
bitlista
/
mklist-num-01
int2bits
/
bits2uint-one-02
int2bits
/
bits2uint-one
bitopsaux
/
succ-one
list
/bitlista/
e-01
list
/bitlista/
c-08
list
/bitlista/
app-02-ant
list
/bitlista/
e
bitopsaux
/
sgn-base-01
bitopsaux
/
sgn-rec
bitopsaux
/
succ-zero
bitopsaux
/
succ-rec
list
/bitlista/
c
bitopsaux
/
inv-false
bitopsaux
/
invert-one
bitopsaux
/
invert-zero
int2bits
/
bits2uint-zero
list-del
/bitlista/
sub-zerozero
list-del
/bitlista/
sublist-num-01
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num
int2bits
/
bits2uint-one-03
int2bits
/
bits2int-pos
list
/bitlista/
a
intops
/
bitsand-zerol
intops
/
and-rec-07
list
/bitlista/
Last
int2bits
/
uint2bits-pos-num
list
/bitlista/
Two
int2bits
/
uint2bits-one
intops
/
band-commutativity
intops
/
band-associativity
intops
/
band-num
intops
/
intshiftrsign-num