[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-range
bits ≠ [] ⊦ ~(2 ^ n→i(# bits - 1)) ≤ bits2int(bits) ∧ bits2int(bits) < 2 ^ n→i(# bits - 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2int-nle
,
bits2int-nls-01
,
bits2int-nls-02
,
bits2int16
,
bits2int16-01
,
bits2int16-02
,
bits2int16-03
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 18
Used lemmas:
bits2uint-not-neg-01
,
bits2uint-nle
,
bits2uint-zeros-03
,
bits2uint-succ
,
bits2int-neg
,
bits2int-pos-02
,
Used spec theorems:
int-basic2
/
pls-01
Used simplifier rules:
int-pot
/
two-lsz
bitopsaux
/
inv-len
int-abs
/
lels-04
int-abs
/
mone-05
int-abs
/
numle-03
int-abs
/
succ-02
list
/bitlista/
app-02-ant
list
/bitlista/
e
bitopsaux
/
inv-empty
int-abs
/
negle-07
int-basic2
/
add-zero
int-abs
/
sub-ls
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
neg-15
bitopsaux
/
invert-one
list
/bitlista/
e-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len
list
/bitlista/
c
list-data
/bitlista/
elim-list-c
int-abs
/
lels
int-abs
/
lels-01
int-abs
/
negle-13
list-data
/bitlista/
l
nat
/
elim-pred-c