[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-04
⊦ 0 ≤ i ∧ i ≤ j → getarray(r, 0, i, addarray(r, int_type, j, st)) = mklist(intval(0), i→n(i))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
getintarray-addarray-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 12
Used lemmas:
getarray-addarray-05
,
add-put-switch
,
addarray-def
,
Used spec theorems:
storearrays
/
getarray-put-04
Used simplifier rules:
int-abs
/
lels-01
int-abs
/
lels-04
specialkeys
/
type-06
specialkeys
/
length-04
valuefuns
/
init_val_int
int-abs
/
forward-le-01