[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
⊦ rely(a, rs0, f0, g0, rs1, f1, g1) ↔ (∀ r. (g0(r) = a ∧ r ∈ rs0 ↔ g1(r) = a ∧ r ∈ rs1) ∧ (g0(r) = a ∧ r ∈ rs0 → f0(r) = f1(r)))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
rely-alloc
,
rely-map-write-known
,
rely-map-write-unknown
,
rely-owned-in-rs
,
rely-owned-unchgd
,
rely-owns-none
,
rely-owns-one
,
rely-refl
,
rely-reuse
,
rely-trans
,
rely-transfer-owner
,
Used by units in proved state:
Proof exists?: No