[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 prefixn-append-slice
⊦ n ≤ n0 → prefixn(n, x) + slice(n, n0, x) = prefixn(n0, x)
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: 0
Proof steps: 9
Used lemmas:
dropn
,
slice
,
prefixn
,
Used spec theorems:
Used simplifier rules:
nat
/
ls-03
list-data
/
size-01
nat-basic
/
add-base
nat
/
anti
nat
/
zero
list-del
/
firstN-zero
list
/
app
nat
/
fle
nat-basic
/
f
nat
/
ls-le-simp
list-del
/
rest-len
nat
/
le-ls-simp
nat
/
le-def
list-del
/
elim-firstn-restn
nat
/
eq-01
list
/
len
nat
/
lep
nat
/
let
list-del
/
firstn-app
list
/
a
nat-basic
/
a
nat-basic
/
c
list
/
app-01
nat
/
elim-sub