[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 short-size-01
⊦ ¬ 32768 < 2 ^ (n→i(# int2bits(s2i(sho))) - 1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
fits-law-band-01
,
fits-law-band-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
short-size
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
one
int-abs
/
sub-ls-01
int-pot
/
pot2-pos-01
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
leone
int-abs
/
sub-le-01
int-pot
/
pot2-pos
int-basic1
/
forward-pos
int-abs
/
forward-le-05
nat-basic2
/
c
int-abs
/
sub-eq
intnat
/
nat2int-05
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
nat-basic1
/
one-01
nat
/
lels-01
nat
/
eq-02
nat-basic2
/
a
int-basic2
/
add-a
int-basic2
/
add-c