[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-split
⊦ frag(IOAut(startf, stepf))(σ, α) ∧ ⌜n⌝ < # α → frag*(IOAut(startf, stepf))(σ to n + 1, α to n) ∧ frag(IOAut(startf, stepf))(σ from n, α from n)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
restricted-refine-implies-forward
,
equiv-F-nF-bF
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
frag-to-1
,
frag-from
,
fragstar
,
Used spec theorems:
Used simplifier rules:
stream
/actionstream/
fin-to
nat-inf
/
ls-le