[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 B-restrict-SF-l
⊦ bel |SF l = bel.filter(λ be. be = SF ∨ be.l = l)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
B-postfix-weak-FOWs-postfix
,
B-postfix-weak-append
,
B-postfix-weak-delpos-propFO
,
B-postfix-weak-empty
,
B-postfix-weak-not-in-stable
,
B-postfix-weak-of-empty
,
B-postfix-weak-one
,
B-postfix-weak-refl
,
B-postfix-weak-same-loc
,
B-postfix-weak-same-loc-postfix
,
isPropFO-restrict-SF-l-head
,
rely-FOFollowsW-stable
,
rely-noPending-stable-strong
,
restrict-SF-eq-FOWs-eq
,
Used by units in proved state:
Proof exists?: No