[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 restn-firstn
⊦ m ≤ n ∧ m + n ≤ # x → restn(m, firstn(n, x)) = firstn(n - m, restn(m, x))
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: 1
Proof steps: 8
Used lemmas:
restN-rec
,
firstN-rec
,
restN-zero
,
Used spec theorems:
Used simplifier rules:
nat
/
elim-sub
nat
/
lep
nat-basic2
/
add-base
list
/
c-07
list-data
/
size-01
nat
/
le-num-06
list-data
/
elim-list-c
list-data
/
l
nat-basic1
/
f
nat
/
succ-01
nat
/
le-num-02
nat-basic2
/
succ
list
/
len-05
list
/
a
list
/
e-01
list
/
c
nat-basic2
/
a
nat-basic2
/
c
nat
/
lels-03