[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 exec
⊦ exec(IOAut(startf, stepf))(σ, β) ↔ frag(IOAut(startf, stepf))(σ, β) ∧ startf(σ[0])
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
exec-fin1
,
exec-fin2
,
exec-step
,
exec-step-fin
,
exec-step-fin-2
,
exec-step-fin-zero
,
exec-step-inf
,
exec-step-inf-zero
,
exec-step-zero
,
infappend-moves
,
not-exec-empty
,
trace-append
,
Used by units in proved state:
can-refines-traceprop
,
IOrefine-implies-HIObackward
,
restricted-refine-implies-forward
,
weakfin-startfin-IObackward-INV-is-leqrefine
,
IO-equiv-IO+
,
IOrefine-implies-HIO-A-backward
,
IOrefine-implies-Cinfguess-fw-A
,
IObackward-INV
,
can
,
imfinIObackward-is-refine
,
beh
,
restricted-refine-implies-backward
,
IObackward-INV-is-leqstarrefine
,
infguessAut
,
infguess-forwardrefines-orig
,
IOrefine-def
,
restricted
,
IOforward-is-leqrefine
,
Proof exists?: No