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