[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 reorder-step-readPWB
⊦ reorder(l, fowl0, fowl1, rfo) → reorder(l, fowl0 + FO(t) ', fowl1, rfo(t := rfo(t) + FO(l) '))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
reorder-step-readPWB-lifted
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 44
Used lemmas:
reorder-rec-W
,
propFOs-one-fo-same
,
propFOs-append
,
reorder-rec-FO
,
reorder-base
,
Used spec theorems:
list-del
/
app
list
/
in-def
Used simplifier rules:
list
/
a
list
/
Nil
list
/
app
list
/
in-17
list
/
in-append
FLITPSC-preds
/
filter-tid-empty
list
/
e
list
/
app-02
list-del
/
app-01
list-del
/
one-01
list
/
c
FOW
/
sel-FO-dottid
FLITPSC-preds
/
filter-t-one
FLITPSC-preds
/
filter-t-append
list
/
in-11
list-del
/
app
list
/
len-01
list-data
/
elim-add