[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 switch-obj
⊦ ¬ r ∈ rs → (hR[rs, f(r; o), g] ↔ hR[rs, f, g])
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
write-known
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 6
Used lemmas:
Used spec theorems:
heap-aux
/
apply
heap-aux
/
ext
Used simplifier rules:
heap-aux
/
in-mk
heap-aux
/
at-mk-M01
heap-aux
/
at-mk-M02