[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 map-indices-append
⊦ ¬ n ∈ nx ∧ valid-indices(ar, nx) ∧ n < # ar → ar.mapIndices(nx + n ', f) = ar.mapIndices(nx, f)[n, f(ar[n])]
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: 0
Proof steps: 8
Used lemmas:
mapindices-rec
,
mapindices-base
,
map-indices-one
,
valid-indices
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
list
/nat-list-set/
Nil
list
/nat-list-set/
in-06
nat-list-less
/
ls-rec
list
/nat-list-set/
a
list
/nat-list-set/
c
nat
/
lels
nat
/
ls-le-simp
array
/
Size-put
array
/
Put-other