[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 addarrays-auto-22
⊦ addarrays(refs, ty, 2 ' + 2 ', 0, st) = ((# refs = 3 ⊃ addarray (refs .first, mkarraytype(ty), refval(refs .rest .first) ' + refval(refs[2]) ', addarray(refs[1], ty, 2, addarray(refs .rest .rest .first, ty, 2, st))) ; st ) )
Type: A user defined theorem
Validity: The proof is valid.
Features: automatic,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 30
Used lemmas:
addarrays-empty
,
addmultiarrays-done
,
addmultiarrays-base
,
addmultiarrays-rec
,
getdims-zero-04
,
getdims-rec
,
countdims-one-02
,
countdims-rec
,
countrefs-one
,
countrefs-rec
,
addarrays-def
,
Used spec theorems:
list-del
/references/
first-num
Used simplifier rules:
intnat
/
num-n2i-eq
typefuns
/
mktype-one
valuesfuns
/
mkvalsr-rec
valuesfuns
/
mkvalsr-one
list-del
/references/
firstN-zero
list
/references/
c-07
list
/references/
c-08
list
/intlista/
first
list
/references/
first
list-last
/references/
last-def
list-last
/references/
l-05
list-del
/references/
lastn-one
list
/intlista/
e-01
typefuns
/
mkarraytype-zero
list
/intlista/
c-07
list
/intlista/
len
list
/intlista/
len-02
list
/intlista/
c-08
valuesfuns
/
posints-one
valuesfuns
/
posints-rec
list
/intlista/
a
list
/intlista/
e
list
/intlista/
app-02-ant
list
/references/
app
list-data
/references/
l
nat-basic2
/
one-03
list-del
/references/
get-zero-01
list
/references/
e-01
list-del
/references/
get-numrec
nat-basic2
/
c
nat-basic2
/
a
nat
/
add-num-04
list
/references/
a
list
/references/
len-02
list
/references/
len
list
/references/
c
list-data
/references/
size-01
list-data
/references/
elim-list-c