[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
⊦ pq(l) = fow ' + fowl → rely(t0, pq, bq, pq(l := fowl), bq)
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: 1
Proof steps: 5
Used lemmas:
rely-local-def
,
rely-def
,
Used spec theorems:
Used simplifier rules:
list
/
a
list
/
in-14
list-last
/
postfix-app-02
list-last
/
postfix-reflexivity
list
/
in-rec
FLITPSC-preds
/
filter-t-append
FLITPSC-preds
/
filter-t-one
list-last
/
postfix-app-01