[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 keys-nodes-in-ri
⊦ ax.toSet = range ri | n ∧ ri-cons(ri, fs) → keys(fs, ax).toSet ⊆ 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: 5
Proof steps: 11
Used lemmas:
Used spec theorems:
set-union
/node-index/
subdef
gjournal-abs
/
in-keys-elim
set-basic
/node-store/
Extension
store+set
/node-index/
Data-in
Used simplifier rules:
store+set
/node-index/
Dom
list+set
/key-list-set/
toSet-ext
list+set
/address-list-set/
toSet-ext
aubifs-base
/
range
ablock-store-refsize-cons
/group-store/
restrict-leb
aubifs-inv
/
ri-cons-key
store
/node-index/
notmemlookup