[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 addobj-union-switch
⊦ r ≠ r0 → addobj(r, class, fis, update(r0, fis0, st)) = update(r0, fis0, addobj(r, class, fis, st))
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: 5
Proof steps: 10
Used lemmas:
addobj-put-switch
,
Used spec theorems:
okfuns
/
update-rec-01
okfuns
/
update-rec
Used simplifier rules:
pair
/fieldinit/
elim
list
/fieldinit-assoclista/
c
okfuns
/
update-empty