[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 refine-and-cstepdet-implies-forward
C_≤T_A(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf)), cstepdet(CIOAut(cstartf, cstepf)) ⊦ ≤F(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
IOrefine-implies-Cinfguess-fw-A
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
refine-and-cstepdet-implies-forward-aux
,
Used spec theorems:
restricted
/restrictedC/
stepdeterministic
IOforward
/
forwardsim-def
Used simplifier rules:
IOtrace
/traceC/
exec
IOtrace
/traceA/
exec