[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-firstPersistW-valid
⊦ reorder(l, fowl, fowl0, rfo) ∧ fowl0 = W(v, t) ' + fowl1 → firstPersistW(fowl) < # fowl
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
reorder-firstPersistW-valid-lifted
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
reorder-rec-W
,
reorder-rec-FO
,
reorder-base
,
Used spec theorems:
list
/
firstoc-rew
Used simplifier rules:
nat
/
lels
list-data
/
size-nil
FLITPSCweak-preds
/
firstPersistW-base
list
/
app-02
list
/
e
list
/
a
nat-basic
/
f
list
/
c
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
list
/
len-05
list
/
c-08
list
/
c-07
FOW
/
inj-W
FLITPSCweak-preds
/
firstPersistW-rec-W
nat-basic
/
less-zero
nat-basic
/
s-04
FLITPSCweak-preds
/
firstPersistW-rec-FO
FOW
/
sel-W-dottid
FLITPSC-preds
/
filter-t-one
FLITPSC-preds
/
filter-t-append
FOW
/
disj-FO-W
list
/
inapp-02
list
/
in-rec
list
/
in-append
list
/
in-14
list
/
in-empty
list
/
Nil
FLITPSC-preds
/
filter-tid-empty