[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-bytes2int-length-01
⊦ n ≠ 0 ∧ # bytes = n → ¬ n < # int2bytes(bytes2int(bytes))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 16
Used lemmas:
bytes2bits-length
,
bits2bytes-len-02
,
bits2bytes-len-01
,
bits2bytes-empty
,
bytes2bits-empty-01
,
int2bytes
,
bytes2int
,
int2bytes-empty
,
Used spec theorems:
nat-div
/
modex
bitopsaux
/
sgn-length
Used simplifier rules:
nat-mult
/
le-num
nat
/
ls-le-simp
nat-div
/
mult-01
nat-mult
/
mod-nle-01
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-div
/
div-elim
nat-basic2
/
c
nat-basic2
/
a
nat
/
lels
nat-basic2
/
s
bitopsaux
/
sgn-empty-01
int2bits
/
bits2bits-def
nat-basic1
/
f
list-data
/bytelist/
l