[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 mk-tail
⊦ n ≠ 0 → mklist(a, n).tail = mklist(a, n -1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
list-del
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 7
Used lemmas:
mk-rec
,
mk-empty
,
Used spec theorems:
Used simplifier rules:
nat
/
pred-03
nat
/
elim-pred-c
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz
nat-basic
/
z-01
list-data
/
elim-list-c
list
/
a
list
/
in-rec
list
/
in-14
list
/
c
nat
/
add-01
nat-basic
/
add-base
list
/
c-06