[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 uint2bits-sgn-2pot-01
0 < j, true ∈ uint2bits(j).rest.rest ⊦ sgn(bitsinvert(uint2bits(j)) +1) = bitsinvert(uint2bits(j)) +1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-len-neg
,
int2uint-neg
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
uint2bits-2pot
,
uint2bits-sgn-2pot
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels
int-abs
/
lels-03
int-basic1
/
lf-02
int-abs
/
lels-04
int-abs
/
lels-01
bitopsaux
/
invert-zero
bitopsaux
/
invert-one
bitopsaux
/
inv-mklist
list
/bitlista/
c
list
/bitlista/
a
bitopsaux
/
succ-prefix
bitopsaux
/
succ-mklist
bitopsaux
/
sgn-rec
bitopsaux
/
sgn-2pot
list
/bitlista/
app-01
list
/bitlista/
app-05
list
/bitlista/
e
list
/bitlista/
c-07
bitlista
/
inmklist