[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-rec
⊦ frag(IOAut(startf, stepf))(⌜s '⌝ + σ, ⌜a '⌝ + α) ↔ stepf(s, a, hd(σ)) ∧ frag(IOAut(startf, stepf))(σ, α)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
weakfin-startfin-IObackward-INV-is-leqrefine
,
equiv-F-nF-bF
,
IObackward-INV
,
restricted
,
IObackward
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 21
Used lemmas:
frag
,
Used spec theorems:
stream
/IOstatestream/
get-append-ls
Used simplifier rules:
stream
/IOstatestream/
append-assoc
nat-basic
/
c
nat-basic
/
a
stream
/IOstatestream/
get-cons-succ
nat-basic
/
succ
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
less-succ-leq
stream
/actionstream/
append-assoc
list
/actionstream/
len-02
stream
/actionstream/
size-fin
stream
/actionstream/
size-append
nat-inf
/
add-cancel-num-04
nat-inf
/
num-add
list
/IOstatestream/
len-02
stream
/IOstatestream/
size-fin
stream
/IOstatestream/
size-append
stream
/actionstream/
get-cons-zero
stream
/IOstatestream/
get-cons-zero
nat-inf
/
not-less-zero
nat-inf
/
add-cancel-num-03
nat-inf
/
add-all-zero
stream
/IOstatestream/
cons-empty
stream
/IOstatestream/
cons-append
stream
/IOstatestream/
size-empty
nat-inf
/
sum-zero-fin
stream
/actionstream/
size-empty-equiv
stream
/IOstatestream/
elim-hd-tl
nat-inf
/
add-fin
stream
/actionstream/
size-succ
stream
/actionstream/
get-cons-succ
nat-basic
/
one-01
nat-inf
/
less-fin
nat-basic
/
oz
list-del
/IOstatestream/
one-03
stream
/IOstatestream/
sel-fin