[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 frag
⊦ frag(IOAut(startf, stepf))(σ, β) ↔ # σ = # β + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # β → stepf(σ[n], β[n], σ[n +1]))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
emptymove-splitfirst
,
exec-fin1
,
exec-fin2
,
frag-fin1
,
frag-fin2
,
frag-from
,
frag-one
,
frag-rec
,
frag-rec-end
,
frag-size
,
frag-size-2
,
frag-step
,
frag-step-fin
,
frag-step-fin-2
,
frag-step-inf
,
frag-step-inf-inf
,
frag-step-inf-zero
,
frag-to
,
frag-trans
,
frag-two
,
fragfin-size
,
fragfin-size-le
,
fragfin-size-ls
,
infappend-moves
,
move-cut
,
move-one
,
move-split
,
moveone-splitstep
,
not-frag-empty
,
preserve-INV
,
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
,
equiv-F-nF-bF
,
IObackward-INV
,
can
,
imfinIObackward-is-refine
,
beh
,
restricted-refine-implies-backward
,
IObackward-INV-is-leqstarrefine
,
infguess-forwardrefines-orig
,
IOrefine-def
,
restricted
,
IObackward
,
IOforward-is-leqrefine
,
Proof exists?: No