[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 move
⊦ move(IOAut(startf, stepf))(s1, β, s2) ↔ (∃ α, sl. frag*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s1 = sl[0] ∧ s2 = sl.last ∧ α ^ = β)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
emptymove-splitfirst
,
frag-move
,
infappend-moves
,
move-cut
,
move-empty
,
move-one
,
move-split
,
move-trans
,
moveone-splitstep
,
Used by units in proved state:
can-refines-traceprop
,
IOrefine-implies-HIObackward
,
restricted-refine-implies-forward
,
IOrefine-implies-HIO-A-backward
,
equiv-F-nF-bF
,
IObackward-INV
,
beh
,
restricted-refine-implies-backward
,
IObackward-INV-is-leqstarrefine
,
infguess-forwardrefines-orig
,
restricted
,
IObackward
,
IOforward-is-leqrefine
,
Proof exists?: No