[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-FOFollowsW-stable
⊦ rely(t, pq, bq, pq0, bq0) ∧ bq(t) ⊒w bq0(t) ∧ FOFollowsW(t, bq(t), pq(l), l) → FOFollowsW(t, bq0(t), pq0(l), l)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
FLIT-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 46
Proof steps: 82
Used lemmas:
FOWs-W
,
FOWs-W-split
,
FOWs-FO-split
,
FO-in-FOWs
,
FOWs-FO
,
FOWs-append
,
B-postfix-weak-FOWs-postfix
,
FOFollowsW-def
,
rely-local-def
,
rely-def
,
B-restrict-SF-l
,
B-postfix-weak
,
Used spec theorems:
list-last
/
postfix
list
/
append-size-less
FLITPSC-preds
/
filter-t-split
list
/
in-def
list
/
append-size-less-eq
Used simplifier rules:
list
/
a
FOW
/
sel-W-dottid
FLITPSC-preds
/
filter-t-one
FLITPSC-preds
/
filter-t-append
list-data
/
l
nat-basic
/
f
list
/
len-06
list
/
len
nat
/
lels
nat
/
ls-le-simp
list
/
in-append
list
/
in-14
list
/
app
list
/
Nil
list
/
in-empty
list
/
app-02
list
/
in-rec
nat-basic
/
l
nat-basic
/
refl-Nat
nat-basic
/
a
nat-basic
/
c
list
/
c
list
/
c-06
FOW
/
sel-FO-dottid
Bevent
/
sel-FO-dotl
Bevent
/
disj-FO-SF
filter-count
/
filter-rec
filter-count
/
filter-append
nat-basic
/
l-01
list
/
e
list
/
neq
nat
/
le-def
nat
/
le-ls-simp
list
/
in-13
list
/
len-05
nat-basic
/
succ
nat-basic
/
s-04
Bevent
/
sel-W-dotl
Bevent
/
disj-W-SF