[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 getbar-restn
⊦ n→i(n) ≤ st[r -- _length] .intval → # restn(n, getbytearray(r, st)) = i→n(st[r -- _length] .intval - n→i(n))
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: 9
Used lemmas:
getbar-len-01
,
bar-length
,
Used spec theorems:
list-del
/bytelist/
rest-len
intnat
/
sub
nat
/
elim-sub
Used simplifier rules:
intnat
/
abs-zero
nat
/
lez-01
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
nat
/
eq-02
nat
/
le-ls-simp
intnat
/
n2n
int-abs
/
lels-01
int-abs
/
lels-04
intnat
/
nat2int
intnat
/
inni-ls
nat-basic1
/
z
int-abs
/
forward-le-02
int-abs
/
forward-lels
intnat
/
nat2int-08
nat-basic1
/
f
nat
/
lels-01