[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 bar-zero
⊦ getbytearray(r, st) = [] ↔ st[r -- _length] .intval ≤ 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
getbytearray-length-zero
,
getbytearray-put-index-length
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
bar-empty-01
,
bar-empty
,
getbar-rec
,
getByteArray-all
,
Used spec theorems:
Used simplifier rules:
int-abs
/
anti
int-abs
/
forward-le-04
int-abs
/
zero-gels-04
list
/bytelist/
c
list
/bytelist/
app-02-ant
list
/bytelist/
e
list
/bytelist/
a
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
lels-01