[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 update-union-switch
⊦ ¬ r ∈ st .refs → update(r, fis, st ∪ st0) = st ∪ update(r, fis, st0)
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: 9
Used lemmas:
update-rec-01
,
update-empty
,
Used spec theorems:
storefunsx
/
union-rec
Used simplifier rules:
pair
/fieldinit/
sel-01
pair
/fieldinit/
sel-02
list
/fieldinit-assoclista/
a
list
/fieldinit-assoclista/
c