[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 blastN-mklist
⊦ butlastn(n, x + mklist(a, n)) = x
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
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:
mk-last-02
,
b
,
mk-butlast
,
bin
,
butlastN-rec
,
mk-last
,
mklist-one
,
mk-plus
,
butlastN-base
,
mk-zero
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
succ
list
/
app
nat
/
elim-pred-c
nat-basic2
/
pred
nat-basic2
/
a
nat-basic2
/
c
list
/
a
nat-basic2
/
oz