[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 equivstar-both-leqstar
⊦ C_≡*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ↔ C_≤*T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)) ∧ A_≤*T_C(AIOAut(astartf, astepf), CIOAut(cstartf, cstepf))
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
can-refines-traceprop
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 13
Used lemmas:
leqstar-def-rev
,
leqstar-def
,
equivstar-def
,
Used spec theorems:
Used simplifier rules:
IOtrace
/traceC/
tracestar
IOtrace
/traceA/
tracestar
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward