[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-app
⊦ # y ≤ n → lastn(n, x + y) = lastn(n - # y, x) + y
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 17
Used lemmas:
lastN-rec
,
lastN-zero
,
lastn-rec
,
Used spec theorems:
Used simplifier rules:
nat
/
elim-sub
nat-basic
/
c
nat-basic
/
a
nat
/
lep
nat-basic
/
z-01
list-data
/
l
list-data
/
size-nil
list
/
app
list
/
Nil
list
/
a
list
/
Last
nat
/
pred-03
nat
/
elim-pred-c
nat-basic
/
oz
nat-basic
/
add-base
list
/
app-01
list-last
/
lapp
list-last
/
bapp
list-last
/
lb
nat
/
le-def
nat-basic
/
one-01
nat
/
ls-01
nat-basic
/
s-04
nat-basic
/
refl-nat
nat-basic
/
eq-01
list-last
/
butlast-last