[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-from-fin
⊦ frag(IOAut(startf, stepf))(⌜sl⌝ , ⌜al⌝ ) ∧ n < # al → (frag(IOAut(startf, stepf))(⌜sl from n⌝ , ⌜al from n⌝ ) ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
beh
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
frag-from
,
Used spec theorems:
Used simplifier rules:
list-data
/actionstream/
l
nat-basic
/
f
stream
/actionstream/
size-fin
nat-inf
/
less-fin
stream
/IOstatestream/
from-fin
stream
/actionstream/
from-fin