[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 get-mklist-01
⊦ m < n → mklist(a, n)[m] = a
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
get-mklist
,
Used by units in proved state:
rowcol-upd
,
array-as-listinstance
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
get-zero-01
,
get-rec-01
,
Used spec theorems:
list-last
/
mk-tail
Used simplifier rules:
nat-basic
/
zero
list-last
/
mk-head-01
list-last
/
mk-empty
nat-basic
/
f
nat-basic
/
succ
list-last
/
mk-zero
nat
/
l-num-06
nat-basic
/
a
nat-basic
/
c
nat
/
pred-03
nat
/
elim-pred-c
nat-basic
/
l
nat-basic
/
oz