[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 putArray-in
⊦ rk ∈ putArray(vals, r, i, st) ↔ rk ∈ st ∨ rk .ref = r ∧ is_indexkey(rk .key) ∧ i ≤ rk .key .index ∧ rk .key .index < i + n→i(# vals)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
putBar-in
,
putarray-subset-new-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 17
Used lemmas:
putar-inref
,
putar-rew
,
putArray-rec
,
putArray-empty
,
Used spec theorems:
Used simplifier rules:
intnat
/
nat2int
int-abs
/
lep
int-abs
/
forward-lele
int-abs
/
anti
storekey
/
test-01
oelem
/intlista/
lel
int-basic1
/
ls-01
int-abs
/
lels-03
int-basic2
/
ls
intnat
/
nat2int-08
storekey
/
inj-04
storekey
/
test-08
storekey
/
elim-04
storekey
/
test-02
storefuns
/
instore-01
javastore
/
in-01
int-abs
/
lels
refkey
/
inj
int-abs
/
succ-01
int-abs
/
ler
refkey
/
sel-01
store
/javastore/
In-insert
refkey
/
inj-01
refkey
/
sel-02
storekey
/
test-06
storekey
/
sel-06
oelem
/intlista/
irreflexivity
refkey
/
elim
int-abs
/
succ-02
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/javavalues/
len-02
list
/javavalues/
len
int-abs
/
lels-01
storekey
/
test
list
/javavalues/
a
list
/javavalues/
c
list-data
/javavalues/
size-01
int-basic2
/
ax-04
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-04