[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-lastn-01
⊦ m ≤ n → x.takeRight(n).takeRight(m) = x.takeRight(m)
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: 10
Used lemmas:
lastn-rec
,
lastn-length
,
lastn-restn-01
,
lastN-rec
,
lastN-zero
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat
/
le-ls-simp
nat
/
le-def
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
list
/
Last
nat-basic
/
less-zero
list
/
a
list
/
len-06
list-last
/
last-def
nat
/
pred-03
nat
/
ls-le-simp
nat
/
lels
nat
/
ls-02
nat-basic
/
one-01
list-last
/
butlast-def
nat
/
elim-pred-c
nat-basic
/
s-04
nat-basic
/
oz
nat
/
elim-sub
nat
/
lep
nat
/
eq-01