[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-5-3c
⊦ C_≤T_A(cioaut, aioaut) ↔ cbeh(cioaut) ≤T abeh(aioaut)
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 4
Proof steps: 9
Used lemmas:
Used spec theorems:
IOrefine-def
/
leq-def
traceprop
/
leq-def
Used simplifier rules:
beh
/behA/
beh-def
beh
/behC/
beh-def