[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 int2bits-neg
⊦ i < 0 → int2bits(i) = sgn(bitsinvert(uint2bits(abs(i))) +1)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2bits-def
,
int2bits-2pot-01
,
int2bits-2pot-04
,
int2bits-bits2unit-01
,
int2bits-eq
,
int2bits-exneg
,
int2bits-falsein-01
,
int2bits-first
,
int2bits-len-neg
,
int2bits-neg-01
,
int2bits-neg-03
,
int2bits-neg-num
,
int2bits-not-empty
,
int2bits-ones
,
int2bits-rec-2pot-neg-02
,
int2bits-rec-neg
,
int2bits-rest
,
int2bits-sgn
,
int2bits-sgn-02
,
int2bits-true
,
int2bits-truein
,
int2bits-truetrue
,
int2bits-truetrue-01
,
int2int-inj
,
int2uint-neg
,
Used by units in proved state:
intops
,
byte
,
Proof exists?: No