[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 cforest-and-leqstarrefine-implies-backward
cforest(cioaut), C_≤*T_A(cioaut, aioaut) ⊦ ≤B(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: 4
Proof steps: 9
Used lemmas:
cforest-and-leqstarrefine-implies-backward-aux
,
Used spec theorems:
IObackward
/
backwardsim-def
Used simplifier rules:
stream
/traceC-IOstatestream/
sel-fin
IOtrace
/traceC/
exec
stream
/traceA-IOstatestream/
sel-fin
IOtrace
/traceA/
exec