[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 trace-append
⊦ trace(IOAut(startf, stepf))(⌜al⌝ + α) → (trace(IOAut(startf, stepf))(⌜al⌝ ) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
can-refines-traceprop
,
IOrefine-equiv-behrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
frag
,
frag-size-2
,
frag-to-1
,
exec
,
trace
,
Used spec theorems:
remtau
/
remtau-to-strong
stream
/IOstatestream/
get-to
Used simplifier rules:
stream
/actionstream/
size-append
stream
/actionstream/
size-fin
stream
/actionstream/
append-assoc
nat-inf
/
add-not-less
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-basic
/
c
nat-basic
/
a
stream
/actionstream/
append-to-size-01
stream-basic
/actionstream/
inj-02
stream-basic
/actionstream/
test-01
stream
/actionstream/
to-inf
stream-basic
/actionstream/
stream-inf-forward
nat-inf
/
less-inf1
stream
/actionstream/
notfin-sizeinf
nat-inf
/
lele-trans
stream
/IOstatestream/
size-succ
nat-inf
/
add-fin
nat-basic
/
oz
nat-basic
/
zero
stream
/actionstream/
size-inf
nat-inf
/
add-inf2
stream
/IOstatestream/
get-to