[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 modify-agree
⊦ modify*(rs)(h0, h1) ↔ ((h0 ≡ h1))(rs)
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: 81
Proof steps: 126
Used lemmas:
modify+-sym
,
agree-rm-01
,
modify
,
agree
,
modify+
,
Used spec theorems:
rtc
/rtc-heap/
rtc
rtc
/rtc-heap/
rtc-rec
heap
/
at-alloc
heap
/
at-del
rtc
/rtc-heap/
rtc-base
heap
/
ext
heap
/
diffs-sw
heap
/
rm-size
heap
/
in-diffs
heap
/
exin
heap
/
sw-del-add-new
heap
/
size-write
heap
/
in-alloc
rtc
/rtc-heap/
rtc-last
Used simplifier rules:
rtc
/rtc-heap/
rtc-base
nat-basic
/
succ
heap
/
in-write
heap
/
at-write
heap
/
in-alloc
heap
/
in-del
heap
/
in-emp
heap
/
in-diffs
nat-basic
/
l
nat
/
lels
nat
/
eq
nat-basic
/
a
nat-basic
/
c
nat
/
elim-pred-c
nat
/
lez
nat
/
leprf
heap
/
sanity
heap
/
nonnull
heap
/
size-alloc
nat-basic
/
z-01
nat
/
add-01
nat
/
add-num-03
nat-basic
/
add-base
nat-basic
/
oz
heap
/
at-del
heap
/
at-alloc
set-basic
/refset/
size-zero-01
set-basic
/refset/
ne-01