[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 fraginf
⊦ fragω(ioa)(sf, af) ↔ (∀ n. ioa.step(sf(n), af(n), sf(n +1)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inffrag-rec
,
Used by units in proved state:
IOtrace-lift
,
IOrefine-conds-imply-IOrefine
,
weakfin-startfin-IObackward-INV-is-leqrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
frag
,
fragomega-def
,
frag-step-inf-inf
,
Used spec theorems:
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstep
nat-basic
/
succ
nat-basic
/
a
nat-basic
/
c
stream
/
sel-inf
nat-inf
/
less-inf2
stream
/
size-inf
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
add-inf2