[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-at
⊦ valid-indices(ar, nx) ∧ ¬ dups(nx) ∧ n < # ar → ar.mapIndices(nx, f)[n] = (n ∈ nx ⊃ f(ar[n]);ar[n])
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
map-if-at
,
map-ifn-at
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 22
Used lemmas:
mapindices-rec
,
mapindices-base
,
valid-indices
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
list
/nat-list-set/
in-empty
list-dup
/nat-list-set/
dups-cons
nat-list-less
/
ls-rec
list
/nat-list-set/
a
list
/nat-list-set/
in-rec
list
/nat-list-set/
c
nat
/
lels
nat
/
ls-le-simp
array
/
Put-same
array
/
cngetput
array
/
Size-put
array
/
Put-other