[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 init-toArc-rec
c ≤ n ⊦ toArc(mkmatrix(m, n, i), c) = mklist(i, m * c)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
init-toArc
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
selcol-mkmatrix
,
toArc-rec
,
toArc-base
,
Used spec theorems:
list-last
/list-as-arrayinstance/
mk-plus
Used simplifier rules:
nat-mult
/
zero
nat-mult
/
mult-a
nat-mult
/
mult-c
list-last
/list-as-arrayinstance/
mk-zero
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
nat-mult
/
rsucc-02
list
/list-as-arrayinstance/
a
list
/list-as-arrayinstance/
len-06
nat
/
lels-03