[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-rec-inv
⊦ inv(buf) → tolist(buf, n + 1) = push(tolist(buf, n), (buf .data)[(i→n(buf .first) + n) % i→n(buf .size)])
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
push-corr
,
tolist-at
,
tolist-size
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 11
Used lemmas:
tolist-rec
,
Used spec theorems:
nat-div
/
mod-le-02
ring-buffer-inv
/
inv
Used simplifier rules:
intnat
/
nat2int-02
intnat
/
n2n
nat
/
ler
nat-div
/
mod-le-03
int-abs
/
lels-02
int-abs
/
forward-le-05
int-abs
/
forward-le-01
nat-div
/
mod-le-02
nat
/
let
intnat
/
abs-zero
nat
/
lels
nat-basic2
/
c
list
/queue/
Last
list
/queue/
app-01
list
/queue/
a