[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 index-update-dom
⊦ ax0.toSet ⊆ range ri ∧ ri-cons(ri, fs) ∧ # ax0 = # ax1 → dom ri[keys(fs, ax0), ax1] = dom ri
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 15
Used lemmas:
key-cons
,
ri-cons
,
Used spec theorems:
set-union
/node-index/
subdef
aubifs-base
/
keys-in-elim
set-union
/node-store/
subdef
store+set
/node-index/
Data-in
Used simplifier rules:
set-union
/node-index/
unc
set-union
/node-index/
una
set-union
/node-index/
uneq
aubifs-base
/
index-update-dom
aubifs-base
/
keys-length
store+set
/node-index/
Dom
list+set
/key-list-set/
toSet-ext
aubifs-base
/
range
list+set
/address-list-set/
toSet-ext