[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 bytes2int-first-pos-01
⊦ ¬ 0 ≤ bytes2int(by ' + bytes) → ¬ 0 ≤ b2i(by)
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: 4
Proof steps: 5
Used lemmas:
bytes2int-first-pos
,
Used spec theorems:
list
/bytelist/
One
list
/bytelist/
Cons
list
/bytelist/
Nil
Used simplifier rules:
list
/bytelist/
c
int-abs
/
lels-04
int-abs
/
zero-gels-01
int-abs
/
forward-le-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
lels-01