[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 lastn-mklist
⊦ m ≤ n → lastn(m, mklist(a, n)) = mklist(a, m)
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: 3
Proof steps: 10
Used lemmas:
lastn-mklist-03
,
lastN-rec-02
,
lastN-zero
,
Used spec theorems:
list-last
/
mk-rec
Used simplifier rules:
list-last
/
mk-zero
nat
/
lez-01
nat-basic2
/
succ
nat
/
les
nat
/
eqle-one
nat-basic1
/
f
nat-basic1
/
lf-01
list-last
/
mk-inj-01
nat
/
lels
nat-basic2
/
s
list-last
/
mk-len
list-data
/
elim-list-c
list
/
in-rec
list
/
in-14
list-last
/
mk-empty
nat-basic2
/
z-01
nat-basic2
/
oz
list
/
a
list
/
c-06
list
/
c
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
add-base
nat
/
add-01