[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 write-other-true
⊦ g(r) ≠ a → ((a[hP] * true)[rs, f(r; o), g] ↔ (a[hP] * true)[rs, f, g])
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: 8
Proof steps: 16
Used lemmas:
lift-aux
,
mod-other-hp
,
Used spec theorems:
heap-aux
/
sep
heap-aux
/
split-uni
heap-aux
/
apply
heap-aux
/
ext
Used simplifier rules:
heap-sep
/heap-aux-inst/
sep-com
heap-sep
/heap-aux-inst/
sep-ass
heap-aux
/
prop-true
heap-aux
/
at-mk-M02
heap-aux
/
at-mk-M01
heap-aux
/
in-mk