[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 finfrag-split
⊦ ¬ # al < n ∧ n < # sl → ( frag*(IOAut(start, step, ext))(sl, al) ↔ frag*(IOAut(start, step, ext))(sl.take(n + 1), al.take(n)) ∧ frag*(IOAut(start, step, ext))(sl.drop(n), al.drop(n)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
move-split
,
move-trans
,
Used by units in proved state:
IOtrace-lift
,
IOrefine-conds-imply-IOrefine
,
IOrefine-conds
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 5
Used lemmas:
fragstar-def
,
frag-finite-sl
,
frag-split
,
Used spec theorems:
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat
/
lels
list-del
/
elim-firstn-restn
nat-basic
/
c
nat-basic
/
a
nat
/
lep
list
/
a
list
/
len
stream
/
size-append
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic
/
l-02
nat-inf
/
add-assoc
nat-inf
/
add-comm
stream
/
size-fin
nat-inf
/
less-fin
stream
/
appfin-sel
stream
/
to-fin
stream
/
append-to-size-01
stream
/
from-fin
stream
/
append-finfin
stream
/
append-from-size-01
stream-basic
/
elim-finp-suc
stream
/
neq-fin-inf-03
stream-basic
/
disj-rqui-rqui0
stream
/
append-assoc