[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 after
⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
lemma_2-2-1
,
lemma_2-2-2
,
lemma_2-2-3a
,
lemma_2-2-3b
,
Used by units in proved state:
restricted-refine-implies-forward
,
beh
,
Proof exists?: No