[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 move-split
¬ # el < n, move(IOAut(start, step, ext))(s, el, s2) ⊦ ∃ s1. move(IOAut(start, step, ext))(s, el.take(n), s1) ∧ move(IOAut(start, step, ext))(s1, el.drop(n), s2)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
move-cut
,
move-cut-2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 38
Used lemmas:
move-empty
,
finfrag-one
,
fragstar
,
finfrag-split
,
move
,
Used spec theorems:
remtau
/
finremtau-split-weak
list-del
/
first-append-02
list
/
firsteq-01
Used simplifier rules:
nat
/
lels
IO-Aut-data
/
sel-IOAut-dotext
list-del
/
elim-firstn-restn
nat-basic
/
c
nat-basic
/
a
nat
/
lep
list
/
a
list
/
len
nat-basic
/
l-02
IO-Aut-data
/
sel-IOAut-dotstep
nat-basic
/
succ
nat
/
succ-01
list-getput
/
get-zero-01
list-data
/
l
nat-basic
/
f
list-del
/
firstN-len
stream
/
append-from-size
nat
/
lels-03
nat-basic
/
l-01
list-last
/
lapp
nat-basic
/
lf-02
list
/
app-02
nat-basic
/
s-04
nat-basic
/
lf-01
nat-basic
/
ls-02
nat
/
ler
list-del
/
firstn-one-01
nat
/
zero
nat
/
add-01
list-data
/
elim-add
list
/
c
list
/
first-02
list
/
e
list-data
/
elim-list-c
list
/
in-17
list
/
in-append
list
/
in-rec
list
/
in-14
list
/
in-15
remtau
/
finremtau-empty
list
/
app
list
/
in-empty
list-data
/
size-nil
list
/
c-03
list
/
Nil
list-del
/
get-zero
list
/
in-08
list
/
fr
list
/
len-05
list-last
/
last-01