[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 no-leading-zeros
⊦ int2bytes(bytes2int(bytes)) = bytes ∧ 1 < # bytes → ¬(bytes.first = i2b(0) ∧ bytes.rest.first = i2b(0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
int2bytes-leading-zeros
,
int2bytes-byte
,
bytes2int-zero
,
bytes2int-append
,
bytes2int-zero-02
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
Mult-zero
list
/bytelist/
e
list
/bytelist/
app
list
/bytelist/
c-03
list
/bytelist/
in-13
list
/bytelist/
in-17
list
/bytelist/
in-append
list
/bytelist/
in-14
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
one
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
a
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
elim-list
list-data
/bytelist/
l
nat-basic1
/
one