[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-zero-03
⊦ 2 ≤ # bytes ∧ bytes.first = i2b(0) ∧ b2i(bytes.rest.first) < 0 → int2bytes(bytes2int(bytes)) = 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: 1
Proof steps: 6
Used lemmas:
bytes2bytes-zero
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
one
nat-basic2
/
z-01
nat
/
add-num-03
list
/bytelist/
c-08
byte
/
byte
list
/bytelist/
c-07
int-abs
/
lels
int-abs
/
lels-03
nat
/
lep
nat-basic2
/
c
nat-basic2
/
a
nat
/
le-num-04
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
a
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
l
nat
/
not-zero
int-abs
/
forward-le-02
list-data
/bytelist/
elim-list-c