[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 write-dom
# ax = # ndx ⊦ dom fs[ax, ndx] = dom fs ∪ ax.toSet
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
write-rec
,
write-base
,
Used spec theorems:
Used simplifier rules:
list-data
/address-list-set/
size-01
list-data
/node-list/
l
list+set
/address-list-set/
toSet-empty
set-union
/node-store/
une
list+set
/address-list-set/
toSet-one
list+set
/address-list-set/
toSet-app
list
/address-list-set/
len-05
list
/address-list-set/
c
list-data
/node-list/
size-01
nat-basic
/
z-01
list-data
/address-list-set/
l
list
/address-list-set/
a
nat-basic
/
c
nat-basic
/
a
nat-basic
/
eq-01
list
/node-list/
a
nat-basic
/
succ
list
/node-list/
len-05
list
/node-list/
c
store+set
/node-store/
dom-ins
set-union
/node-store/
unadd
set-union
/node-store/
una
set-union
/node-store/
unc