[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 replay-orphans-trunc
⊦ key ∈ ro → (ri \ datakeys(key, n, ri)) ⊖ ro = ri ⊖ ro
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
aubifs-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 22
Used lemmas:
Used spec theorems:
store
/node-index/
k-Extension
aubifs-base
/
at-dels-ro-nodata
aubifs-base
/
at-dels-ro-data
store+set
/node-index/
Diff-get
aubifs-base
/
in-dels-ro
store+set
/node-index/
Diff-ext
Used simplifier rules:
set-basic
/node-index/
size-zero-01
set-basic
/node-index/
ne-01
aubifs-base
/
in-dels-ro
key
/
elim-02
aubifs-base
/
at-dels-ro-data
store+set
/node-index/
Diff-ext
aubifs-base
/
at-dels-ro-nodata
store+set
/node-index/
Diff-mems-get
aubifs-base
/
datakeys-ge
aubifs-base
/
datakeys
key
/
test-09
key
/
sel-03
key
/
sel-05
key
/
inodekey-id