[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 finfrag-one-action
⊦ frag*(IOAut(start, step, ext))(s ' + sl, a ') ↔ step(s, a, sl.head) ∧ sl ≠ [] ∧ sl.tail = []
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
fragstar
,
Used spec theorems:
Used simplifier rules:
IO-Aut-data
/
sel-IOAut-dotstep
list
/
a
list-del
/
get-numrec
list-del
/
one-03
list-del
/
get-zero
nat-basic
/
one-01
list
/
len-02
nat-basic
/
c
nat-basic
/
a
nat
/
add-num-04
nat-basic
/
succ
list
/
len-05
nat-basic
/
one-06
list-data
/
l
list
/
c
list
/
app
list-data
/
size-nil
list-data
/
elim-list-c