[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 Sep-any
⊦ st ≠ ∅ → (((adP ⊗_ st * hP))(h) ↔ (∃ a, d, st0. ¬ a ∈ st0 ∧ st = st0[a, d] ∧ ((adP(a, d) * adP ⊗_ st0 * hP))(h)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 5
Used lemmas:
Sep-ins
,
Used spec theorems:
store
/
exnotempty
Used simplifier rules:
heap-sep
/
sep-com
heap-sep
/
sep-ass