[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 int2bytes-len-le-01
⊦ 0 ≤ i ∧ int2bytes(i).first = i2b(0) → (n ≤ # int2bytes(i) ↔ 2 ^ ((n→i(n) - 1) * 8 - 1) ≤ i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-len-ls-04
,
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:
int2bytes-len-ls-01
,
Used spec theorems:
intnat
/
n2i-sub
Used simplifier rules:
int-abs
/
lels-03
nat
/
lels-02
intnat
/
ls-int-ls-nat
nat
/
sub-ls
nat
/
le-ls-simp
nat
/
lels
int-abs
/
forward-le-05
int-abs
/
forward-lels
nat-basic1
/
f
int-pot
/
pot2-pos
int-abs
/
sub-le-01
int-abs
/
leone
int-mult
/
zero-gr
intnat
/
num-n2i-ls-02
nat-basic1
/
z
int-mult
/
associativity
int-mult
/
commutativity
nat-basic1
/
one
int-abs
/
sub-ls-01
int-pot
/
ls-pos-2pot-01
int-abs
/
sub-ls
int-abs
/
Sub-def
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
ls-pos
int-abs
/
succ-02
intnat
/
le
nat
/
ls-02
nat
/
le-add
int-abs
/
sub-pred
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
nat
/
ls-01
nat
/
lels-01
nat-basic1
/
one-01
int-abs
/
lels
int-abs
/
zero-gels-04
nat
/
lez
nat
/
pred-03
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
lels-01