[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-nle
⊦ # bits ≤ n ∧ bits ≠ [] → ¬ 2 ^ n→i(n) + bits2int(bits) ≤ 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
int2int-lastn-negneg
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
bits2int-range
,
Used spec theorems:
int-pot
/
two-le
Used simplifier rules:
intnat
/
nat2int
intnat
/
le
nat
/
fle-01
nat
/
fle
nat-basic1
/
ref-1
nat-basic1
/
f
nat
/
eqle-one
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
list-data
/bitlista/
l
nat
/
elim-pred-c
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
lep-02
int-abs
/
forward-lele
int-abs
/
negle-13