[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 lemma_2-6
afin(aioaut) ⊦ C_≤T_A(cioaut, aioaut) ↔ C_≤*T_A(cioaut, aioaut)
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: 32
Used lemmas:
Used spec theorems:
IOrefine-def
/
leq-def
IOrefine-def
/
leqstar-def
beh
/behA/
lemma_2-5-2
traceprop
/
limitclosed-def
ext
/
ext-trace-def
IOtrace
/behC/
trace
stream
/actionstream/
prefix-def
Used simplifier rules:
IOtrace
/behA/
tracestar
IOtrace
/behC/
tracestar
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward
beh
/behA/
beh-def
stream-basic
/actionstream/
test-01
stream-basic
/actionstream/
stream-inf-forward
action
/
ext-def
stream
/actionstream/
sel-inf
nat-inf
/
less-inf2
stream
/actionstream/
size-inf
remtau
/
remtau-nottau-2
stream
/actionstream/
append-assoc
IOtrace
/behC/
trace-append