[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 rely-persist-FO-weak
⊦ isPersistFO(n, p(l)) → rely(t, p, p(l := p(l) -p n))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 28
Used lemmas:
weak-write-postfix
,
rely-def
,
allrely-def
,
isPersistFO
,
Used spec theorems:
list-del
/
firstn-restn-eq
list-del
/
rmpos-take-drop
list-del
/
firstn-last-rec
FLITPSC-preds
/
filterfos-def
forall-indexWhere
/
filter-forall
forall-indexWhere
/
forall-get-def
list-del
/
get-firstn
Used simplifier rules:
list-data
/
l
nat-basic
/
f
FLITPSC-preds
/
filter-tid-empty
list
/
a
list
/
app
list
/
Nil
nat
/
succ-01
nat
/
lels
nat
/
ls-le-simp
nat-basic
/
a
nat-basic
/
c
nat-basic
/
oz
FLITPSC-preds
/
filter-FO-append
list
/
Last
nat-basic
/
pred
filter-count
/
filter-one
list-set
/
subset-app
nat-basic
/
succ
nat-basic
/
trans-Nat
nat-basic
/
lf
list-del
/
firstn-length-03
nat
/
lels-03
FLITPSC-preds
/
filter-FO-empty
list-set
/
subset-empty