[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-trans
⊦ move(IOAut(startf, stepf))(s, α1, s1) ∧ move(IOAut(startf, stepf))(s1, α2, s2) → move(IOAut(startf, stepf))(s, α1 + α2, s2)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
move-split
,
Used by units in proved state:
equiv-F-nF-bF
,
IObackward-INV
,
IObackward
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 16
Used lemmas:
not-frag-empty
,
frag-trans
,
fragstar
,
move
,
Used spec theorems:
list-del
/IOstatestream/
get-append-less
Used simplifier rules:
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward
stream
/actionstream/
append-assoc
remtau
/
remtau-append
stream
/actionstream/
finp-append-02
list
/IOstatestream/
a
stream
/IOstatestream/
append-finfin
stream
/IOstatestream/
empty
list-last
/IOstatestream/
lapp
list-del
/IOstatestream/
get-zero
list-data
/IOstatestream/
elim-list-c
stream
/IOstatestream/
append-assoc
list
/IOstatestream/
c
list
/IOstatestream/
e-01
list-last
/IOstatestream/
butlast-last
list-del
/IOstatestream/
get-append-grt
nat-basic
/
zero
list-data
/IOstatestream/
l
list-data
/IOstatestream/
size-01