[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-nls
⊦ bits ≠ [] → ¬ 2 ^ n→i(# bits) + bits2int(bits) < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 17
Used lemmas:
bits2uint-2pot
,
ubits2ubits-neg
,
ubits2ubits-pos
,
bits2int-first-01
,
bits2int-neg-03
,
int2bits-pos
,
int2bits-2pot
,
int2bits-len-mon
,
Used spec theorems:
int-abs
/
Abs-neg
bitopsaux
/
succ-len
bitopsaux
/
sgn-length-03
Used simplifier rules:
nat
/
lels-01
bitopsaux
/
succ-length
nat-basic1
/
ref-1
bitopsaux
/
inv-len
bitopsaux
/
succ-ones
bitopsaux
/
inv-inv
list
/bitlista/
c
list
/bitlista/
e-01
nat-basic2
/
s
nat
/
lels
nat
/
ler
list
/bitlista/
c-08
bitopsaux
/
inv-in-01
int-basic1
/
irref
list-data
/bitlista/
l
nat-basic1
/
f
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
nat
/
le-num-02
bitopsaux
/
succ-empty-01
int-abs
/
neg-02
int-abs
/
sub-ls
int-abs
/
neg-15
int-abs
/
neg-05
int-abs
/
negle-07
int-basic2
/
add-zero
int-basic1
/
ls-01
int-abs
/
lels-03
int-abs
/
negle-13
int-abs
/
neg-06
int-abs
/
absle
int-abs
/
forward-lsle
int-abs
/
forward-lele
int-basic2
/
ls
int-pot
/
two-lsz
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-01
list
/bitlista/
a
list-last
/bitlista/
mk-len
list
/bitlista/
len-02
list
/bitlista/
len
intnat
/
n2n
intnat
/
nat2int
int-abs
/
lels
int-abs
/
abs-neg
int-pot
/
abs-2pot