[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-fo-follows-w-stable
⊦ FOFollowsW(t, p0(l)) ∧ rely(t, p0, p1) → FOFollowsW(t, p1(l))
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: 17
Proof steps: 49
Used lemmas:
weak-write-postfix
,
rely-def
,
allrely-def
,
Used spec theorems:
FLITPSC-preds
/
FOFollowsW-def
list-del
/
get-append-less
list
/
some-element
list-del
/
in-get
list-del
/
get-append-grt
list-set
/
subset
Used simplifier rules:
list-data
/
l
nat-basic
/
f
FOW
/
elim-W
FOW
/
test-dotWque-W
list
/
a
list
/
len
list
/
app-02
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-01
nat-basic
/
l
nat
/
fle-01
nat
/
lels
list-del
/
get-append-grt
nat
/
elim-sub
nat
/
lep
nat
/
lep-02
FLITPSC-preds
/
in-filter-t
FOW
/
sel-W-dottid
nat-basic
/
l-08
nat-basic
/
succ
nat-basic
/
trans-Nat
nat-basic
/
lf
list-del
/
get-append-grt-02
list-del
/
get-append-less
nat-basic
/
l-05
nat-basic
/
l-02
FLITPSC-preds
/
in-filter-FO
FOW
/
test-dotFOque-W