[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 create-corr
0 < i ⊦ 〈create#(i; buf)〉 (inv(buf) ∧ abs(buf, []) ∧ buf .size = i)
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: 2
Proof steps: 5
Used lemmas:
tolist-base
,
abs
,
Used spec theorems:
ring-buffer-inv
/
inv
Used simplifier rules:
list-data
/queue/
size-01
int-abs
/
forward-le-05
int-abs
/
lels-02
ring-buffer
/
sel-01
ring-buffer
/
sel-02
intnat
/
i2i-pos
array
/
Size-mkarray
ring-buffer
/
sel-04
ring-buffer
/
sel-03