[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 num-i2bi-neg
i < ~2147483648 ⊦ i2bi((* i)) = i2bi(bits2int(lastn(32, int2bits(i))))
Type: A user defined theorem
Validity: The proof is valid.
Features: automatic,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
inbint
,
int2bint-out
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-03