[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 firstn-butlast
⊦ x = firstn(# x - 1 + # z, x) + a ' + z → firstn(# x - # z, x).butlast = firstn(# x - 1 + # z, x)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
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: 18
Used lemmas:
firstN-zero
,
firstN-rec-01
,
firstN-rec
,
firstN-empty
,
Used spec theorems:
Used simplifier rules:
list-data
/
size-nil
list
/
app-02
list
/
e
list
/
a
list
/
in-rec
list
/
in-append
list
/
in-14
list
/
c
nat-basic
/
c
nat-basic
/
a
nat
/
cancel-01
nat-basic
/
succ
list
/
len-05
nat
/
le-def
list
/
len-03
nat
/
elim-sub
list
/
c-07
list
/
c-08
nat
/
add-01
nat-basic
/
eqs
list
/
Nil
list
/
c-06
nat-basic
/
add-base
list
/
app
list-last
/
butlast-one
nat
/
pred-03
list
/
len-01
nat
/
elim-pred-c
nat-basic
/
oz
list-last
/
butlast-rec
list-data
/
elim-list-c
nat-basic
/
eq-01