[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-split-dropn
⊦ n = n0 + n1 → prefixn(n, x) = prefixn(n0, x) + prefixn(n1, dropn(n0, 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: 2
Proof steps: 11
Used lemmas:
dropn
,
prefixn
,
Used spec theorems:
list-del
/
first-append
list-del
/
first-append-01
Used simplifier rules:
nat
/
fle-01
list-del
/
elim-firstn-restn
nat
/
lep-02
list
/
len
nat-basic
/
l-02
nat
/
lep
list-del
/
restN-append
nat-basic
/
a
list-del
/
sublist-part
nat-basic
/
lf-02
nat-basic
/
lf-01
nat-basic
/
ls-02
nat-basic
/
f
list-data
/
size-01
nat
/
lez-01
list-del
/
firstN-zero
list
/
app
list
/
a
nat
/
le-def
nat
/
le-ls-simp
list-del
/
rest-len
nat
/
ls-02
nat-basic
/
c
nat
/
ls-le-simp
list-del
/
firstn-restn-eq