[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 bits2int-neg
⊦ bits2int(true ' + bits) = ~ bits2uint(bitsinvert(true + bits) +1)
Type: An axiom
Validity: The proof is valid.
Features: localsimp, automatic,
Comment:
Used by:
bits2bits-2pot-01
,
bits2bits-def
,
bits2int-2pot
,
bits2int-first
,
bits2int-inv
,
bits2int-lasteq
,
bits2int-mklist-01
,
bits2int-mklist-02
,
bits2int-neg-01
,
bits2int-neg-02
,
bits2int-neg-03
,
bits2int-neg-1bit
,
bits2int-neg-1bit-01
,
bits2int-one
,
bits2int-ones-01
,
bits2int-ones-02
,
bits2int-range
,
bits2int-rec-01
,
bits2int-rec-03
,
bits2int-rec-false
,
bits2int-sign
,
bits2int-split-01
,
bits2int-zero-01
,
bits2int-zeros-01
,
bits2uint-inv-pos
,
Used by units in proved state:
intops
,
bytes
,
byte
,
Proof exists?: No