[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 inftrace
⊦ traceω(IOAut(start, step, ext))(ef) ↔ (∃ sf, af. ⌜ef⌝ = ext !(⌜af⌝ ) ∧ execω(IOAut(start, step, ext))(sf, af))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
weakfin-startfin-IObackward-INV-is-leqrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
fragomega-def
,
frag-inf-al
,
exec
,
trace
,
traceomega
,
infexec
,
Used spec theorems:
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstart
remtau
/
finremtau-def
stream-basic
/
disj-rqui-rqui0
stream
/
sel-inf
stream-basic
/
sel-rqui0-dotf
stream-basic
/
elim-finp-suc