[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 moveone-splitstep
move(IOAut(start, step, ext))(s, e ', s2) ⊦ ∃ s0, s1, a. ext(a) = Some(e) ∧ move(IOAut(start, step, ext))(s, [], s0) ∧ step(s0, a, s1) ∧ move(IOAut(start, step, ext))(s1, [], s2)
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: 15
Proof steps: 38
Used lemmas:
move-empty
,
finfrag-rec
,
not-finfrag-empty
,
move
,
Used spec theorems:
remtau
/
finremtau-one
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotext
remtau
/
finremtau-empty
list
/
e
list
/
c
list
/
a
remtau
/
finremtau-append
list-del
/
get-zero
list
/
Nil
list-data
/
elim-list-c
list-last
/
last-rec
list
/
app-02
remtau
/
remtau-one-03
list
/
c-03
option
/
elim-Some