[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 at-write-at
⊦ # ax = # ndx ∧ adr ∈ ax ∧ ¬ dups(ax) → fs[ax, ndx][adr] = ndx[pos(adr, ax)]
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: 11
Used lemmas:
Used spec theorems:
list
/address-list-set/
in-def
Used simplifier rules:
nat-basic
/
add-base
list-del
/address-list-set/
pos-y
list-del
/address-list-set/
app-05-neg
list-dup
/address-list-set/
f-01
list
/address-list-set/
len
list-dup
/address-list-set/
e-01
list
/address-list-set/
in-empty
list
/address-list-set/
Nil
list-data
/address-list-set/
size-01
nat-basic
/
eq-01
gjournal-base
/
at-write-other
store
/node-store/
At-same
list-del
/node-list/
get-zero-01
list-dup
/address-list-set/
a
list-dup
/address-list-set/
c-02
list
/address-list-set/
in-append
list-dup
/address-list-set/
dups-cons
list
/address-list-set/
in-06
list
/address-list-set/
len-05
list
/address-list-set/
c
list-data
/node-list/
size-01
nat-basic
/
z-01
list-del
/node-list/
get-succ
list
/address-list-set/
a
aubifs-base
/
write-rec
nat-basic
/
c
nat-basic
/
a
nat
/
add-num-01
list
/node-list/
a
nat-basic
/
succ
list
/node-list/
len-05
list
/node-list/
c