[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 tolist-at
m < n ⊦ inv(buf) → (tolist(buf, n)[m]) = (buf .data)[(i→n(buf .first) + m) % i→n(buf .size)]
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
pop-corr
,
push-corr
,
tolist-ext-one
,
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:
tolist-size
,
tolist-rec-inv
,
tolist-base
,
Used spec theorems:
list-del
/queue/
get-last
list-del
/queue/
get-butlast
Used simplifier rules:
list-del
/queue/
get-append-grt
list
/queue/
a
nat
/
zero
list-del
/queue/
one-03
nat
/
ler
nat
/
anti
nat
/
lels
nat-basic2
/
s
nat-basic2
/
c
nat-basic2
/
a
list
/queue/
Last
nat-basic2
/
succ
nat-basic1
/
zero-01
nat-basic1
/
f