[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-in
⊦ # kx = # ax → (key ∈ ri[kx, ax] ↔ key ∈ ri ∨ key ∈ kx)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
Used by units in proved state:
gjournal-abs
,
gjournal-base
,
aubifs-inv
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 19
Used lemmas:
index-update-key-rec
,
index-update-key-base
,
Used spec theorems:
Used simplifier rules:
list-data
/key-list-set/
size-01
list-data
/address-list-set/
l
list
/key-list-set/
in-empty
list
/key-list-set/
in-rec
list
/key-list-set/
len-05
list
/key-list-set/
c
list-data
/address-list-set/
size-01
nat-basic
/
z-01
list-data
/key-list-set/
l
list
/key-list-set/
a
nat-basic
/
c
nat-basic
/
a
nat-basic
/
eq-01
list
/address-list-set/
a
nat-basic
/
succ
list
/address-list-set/
len-05
list
/address-list-set/
c
store
/node-index/
in-neq
store
/node-index/
In-insert
store
/node-index/
insin