[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 get-length
⊦ 0 < j → # getarray(r, i, j, st) = i→n(j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
at=get
,
at=get-offset
,
bar-at
,
get-get
,
get-length-01
,
get-length-04
,
getar-at
,
getarray-get
,
getarray-put=set
,
getintarray-at
,
getintarray-in
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 7
Used lemmas:
getArray-one
,
getArray-rec
,
Used spec theorems:
Used simplifier rules:
intnat
/
abs-succ-03
nat-basic2
/
s
intnat
/
labs
int-abs
/
abs-16
oelem
/intlista/
irreflexivity
int-basic2
/
zero-02
int-abs
/
numls-02
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01
intnat
/
rax
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
elim-sub
int-basic1
/
forward-pos
list
/javavalues/
a
list
/javavalues/
len
list
/javavalues/
Last
int-abs
/
lels
int-abs
/
bet
list
/javavalues/
len-02
int-abs
/
forward-le-05