[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+-sym
⊦ modify*(rs)(H0, H1) ↔ modify*(rs)(H1, H0)
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: 12
Proof steps: 18
Used lemmas:
modify-sym
,
modify+
,
Used spec theorems:
rtc
/rtc-heap/
rtc
rtc
/rtc-heap/
rtc-rec
rtc
/rtc-heap/
rtc-last
Used simplifier rules:
rtc
/rtc-heap/
rtc-base
nat-basic
/
succ
nat-basic
/
z-01
nat-basic
/
add-base
nat
/
add-01
nat-basic
/
c
nat-basic
/
a
nat-basic
/
oz