[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 putar-in-02
⊦ r -- j ' ∈ putArray(vals, r, i, st) ↔ r -- j ' ∈ st ∨ i ≤ j ∧ j < i + n→i(# vals)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
putbar-in-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
putArray-rec
,
putArray-empty
,
Used spec theorems:
javastore
/
instore-02
Used simplifier rules:
oelem
/intlista/
sls
int-basic1
/
ls-01
int-abs
/
succ-02
storekey
/
inj-04
store
/javastore/
In-insert
refkey
/
inj-01
storefuns
/
instore-01
oelem
/intlista/
lel
storefuns
/
refin
oelem
/intlista/
irreflexivity
int-abs
/
ler
int-basic2
/
ls
intnat
/
nat2int-08
int-abs
/
succ-01
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/javavalues/
len-02
list
/javavalues/
len
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
int-abs
/
lels
int-abs
/
lels-01