[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-end
⊦ frag(IOAut(start, step, ext))(⌜sl⌝ + ⌜s '⌝ , α + ⌜a '⌝ ) ↔ step(sl.last, a, s) ∧ frag(IOAut(start, step, ext))(⌜sl⌝ , α)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
finfrag-rec-end
,
frag-rec-end2
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 29
Used lemmas:
frag
,
Used spec theorems:
stream
/
get-append-notls
list-del
/
get-append-less
stream
/
get-append-ls
Used simplifier rules:
stream
/
append-assoc
stream
/
get-append2-fin
nat-basic
/
succ
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
less-succ-leq
list
/
len-02
stream
/
size-fin
stream
/
size-append
nat-inf
/
add-cancel-num-04
nat-basic
/
c
nat-basic
/
a
nat-inf
/
num-add
stream
/
sel-fin
list-data
/
size-nil
nat-inf
/
sum-zero-fin
stream
/
size-empty-equiv
list-last
/
last-elim
list
/
a
list-del
/
get-butlast
nat-inf
/
less-fin
list
/
e-02
nat-inf
/
add-all-zero
nat-inf
/
add-cancel-num-03
nat-inf
/
add-fin
list
/
len
list-del
/
one-03
list-del
/
get-numrec
list-del
/
get-append-grt-02
list-del
/
get-app
nat-basic
/
refl-Nat
nat-inf
/
sel-rqui-dotn
nat
/
zero
stream
/
get-append-ls
list-data
/
l
nat-basic
/
f
list-del
/
get-append-less
nat-basic
/
ls-02
list-del
/
get-append-grt
nat
/
cancel-01
nat-basic
/
l
nat
/
lels
nat
/
ls-le-simp
stream
/
get-append-notls
nat-basic
/
s-04
nat
/
le-ls-simp
nat
/
anti
list-del
/
get-last
nat
/
ler
nat
/
lels-03