[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 inffrag-rec
⊦ fragω(IOAut(start, step, ext))(s ' + sf, a ' + af) ↔ step(s, a, sf(0)) ∧ fragω(IOAut(start, step, ext))(sf, af)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inffrag-rec1
,
inffrag-rec2
,
Used by units in proved state:
product-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 23
Used lemmas:
fraginf
,
Used spec theorems:
stream
/
add-list-fun-def
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstep
nat-basic
/
succ
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
add-01
nat-basic
/
oz
list
/
len-02
list-del
/
one-03
nat-basic
/
one-01
nat
/
elim-pred-c