[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 add-at-gr
⊦ n→i(# vals) ≤ i → (addarray(r, ty, vals, st)[r -- i ']) = st[r -- i ']
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
add-at-other-index
,
putarray-addarray-override
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 11
Used lemmas:
addarrayinit-base
,
addarrayinit-def
,
add-lastrec
,
Used spec theorems:
Used simplifier rules:
nat
/
lep-01
nat
/
le-num-02
nat
/
lels
nat
/
ls-01
nat
/
lels-01
nat-basic1
/
one-01
list-last
/javavalues/
lb
int-abs
/
lels-01
int-basic1
/
forward-pos
oelem
/intlista/
transitivity
nat
/
add-01
nat-basic2
/
z
intnat
/
num-n2i-ls-02
nat-basic1
/
one
intnat
/
nat2int-04
nat-basic1
/
ref-1
intnat
/
pos-int
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list-data
/javavalues/
l
nat
/
elim-pred-c
storekey
/
inj-04
nat
/
pred-03
javastore
/
lookup-if
refkey
/
inj-01
specialkeys
/
len
specialkeys
/
type-03
int-abs
/
forward-le-01
list-data
/javavalues/
size-01