[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 uint2uint-neg
⊦ i < 0 → bits2uint(uint2bits(~ i)) = ~ i
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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:
uint2uint-pos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
negeq
int-abs
/
neg-03
int-abs
/
negle-07
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-01
int-basic1
/
ls-01