[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(start, step, ext))(σ, α) ↔ # σ = # α + ⌜1⌝ ∧ (∀ n. ⌜n⌝ < # α → step(σ[n], α[n], σ[n +1]))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
allfragto-frag
,
exec-fin1
,
exec-fin2
,
finfrag-one
,
finfrag-two
,
fintrace
,
frag-from-1
,
frag-inf-al
,
frag-inf-sl
,
frag-noactions
,
frag-onestate
,
frag-rec
,
frag-rec-end
,
frag-size
,
frag-size-2
,
frag-split
,
frag-step
,
frag-step-fin
,
frag-step-fin-2
,
frag-step-fin-zero
,
frag-step-inf
,
frag-step-inf-inf
,
frag-step-inf-zero
,
frag-step-zero
,
frag-to
,
frag-trans
,
fragfin-size
,
fragfin-size-02
,
fragfin-size-le
,
fragfin-size-ls
,
fragfin-size-ls-02
,
fragfin-size-notls-02
,
fraginf
,
fragstar
,
infappend-frags
,
infappend-moves-gen
,
not-frag-empty
,
preserve-INV
,
trace-append
,
Used by units in proved state:
product-refine
,
project-right
,
IOtrace-lift
,
Proof exists?: No