[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 abs-keys-orphans-add2
⊦ abs-keys(orphans(fs0, ri0)) = abs-keys(orphans(fs, ri)) ++ n ↔ orphans(fs0, ri0) = orphans(fs, ri) ++ inodekey(n)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
aubifs-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 13
Used lemmas:
abs-keys
,
Used spec theorems:
set-basic
/node-index/
Extension
set-basic
/dir-heap-refset/
Extension
Used simplifier rules:
set-basic
/node-index/
In-insert
set-basic
/dir-heap-refset/
In-insert
aubifs-inv
/
orphans
key
/
elim-01
key
/
test-02
key
/
sel-04
key
/
inj-03