[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-firstN
⊦ n ≤ # x → butlastn(n, x) = firstn(# x - n, x)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
elim-lastn-butlastn
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
firstN-rec-01
,
firstN-zero
,
Used spec theorems:
list-last
/
blastN-all-01
list-last
/
blastN-rec-01
Used simplifier rules:
list-data
/
size-01
nat
/
lez-01
list-last
/
butlastN-base
nat-basic2
/
succ
list
/
len-05
list
/
c
nat
/
ler
nat
/
lep-02
nat
/
zero
nat
/
cancel-01
list-last
/
butlastN-rec
list-last
/
butlast-len
nat-basic2
/
add-base
nat
/
add-01
nat
/
lels
nat-basic2
/
a
nat-basic2
/
s
nat
/
lels-02
nat
/
zero-02
nat-basic2
/
c
nat
/
pred-03
list
/
a
list
/
app-08