[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-rec-01
⊦ n ≤ # x → butlastn(n, a ' + x) = a ' + butlastn(n, x)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
nodups-butlastn
,
Used by units in proved state:
list-del
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 12
Used lemmas:
butlast-def
,
butlastN-rec
,
blastN-rec
,
butlastN-base
,
Used spec theorems:
list
/
lastdiv
Used simplifier rules:
list
/
app
list-data
/
size-01
nat
/
lez-01
list
/
c-04
list
/
in-17
list
/
in-append
list
/
e-02
list
/
in-15
list
/
app-08
nat
/
pred-03
nat
/
elim-pred-c
nat
/
lep-02
nat-basic2
/
oz
list
/
len
list
/
len-02
list
/
a
nat-basic2
/
s
nat-basic1
/
ref-1
nat-basic2
/
a
nat-basic2
/
c