[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 head-corr
inv(buf), abs(buf, a + x) ⊦ 〈head#(buf; b)〉 a = b
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: 3
Proof steps: 11
Used lemmas:
tolist-ext-one
,
at-first-mod
,
abs
,
Used spec theorems:
ring-buffer-inv
/
inv
Used simplifier rules:
int-abs
/
zero-gels-04
int-abs
/
lels
int-abs
/
forward-lels
int-abs
/
forward-lele
int-abs
/
forward-lsle
int-basic1
/
irref
nat-basic2
/
z
list-del
/queue/
get-zero-01
intnat
/
abs-zero
int-basic2
/
mone-03
int-basic2
/
add-a
int-basic2
/
add-c
intnat
/
nat2int-07
nat-basic1
/
zero
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05
list
/queue/
in-17
list
/queue/
in-append
list
/queue/
in-14
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/queue/
a
list
/queue/
len-02
list
/queue/
len
list
/queue/
c