[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 getarray-addarray-05
⊦ 0 ≤ i ∧ i ≤ j → getarray(r, 0, i, addarray(r, val, j, st)) = mklist(val, i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
getarray-addarray-04
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 14
Used lemmas:
1dim
,
addarray-rec
,
getarray-addarray-03
,
Used spec theorems:
storearrays
/
getarray-put-01
Used simplifier rules:
intnat
/
rax-04
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
oelem
/intlista/
irreflexivity
nat-basic2
/
a
nat-basic2
/
c
int-basic2
/
ax-04
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
numleledel-01
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
succ-02
int-abs
/
numle-02
int-basic2
/
neq-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
elim-sub
int-abs
/
ax-02
int-abs
/
lels
int-abs
/
anti
oelem
/intlista/
lel
int-abs
/
forward-le-05
int-abs
/
lels-02
int-abs
/
ler
int-abs
/
zero-gels-04
int-abs
/
forward-le-01