[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 ri-cons
⊦ ri-cons(ri, fs) ↔ (∀ key. key ∈ ri → ri[key] ∈ fs ∧ key-cons(key, fs[ri[key]]))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
datanode-pagesize
,
in-ri-update-in-ri
,
index-update-dom
,
log-cons-copy-new
,
read-lookup-copy
,
ri-closed-gc-one
,
ri-cons-copy
,
ri-cons-copy-new
,
ri-cons-del-orphans
,
ri-cons-drop
,
ri-cons-empty-2
,
ri-cons-gc-one
,
ri-cons-in
,
ri-cons-inj
,
ri-cons-key
,
ri-cons-range-ri
,
ri-cons-truncnode
,
ri-cons-variant1-01
,
ri-key-cons
,
ubifs-cons-log-cons
,
ubifs-cons-logadr-in
,
ubifs-cons-ri-closed
,
ubifs-cons-ri-inj
,
ubifs-file-in
,
ubifs-file-notdir
,
ubifs-fo-subset
,
ubifs-in-fs
,
ubifs-log-nodups-add1
,
ubifs-log-nodups-add2
,
ubifs-log-nodups-add3
,
ubifs-log-nodups-add4
,
ubifs-log-nodups-add5
,
ubifs-parent-dir
,
ubifs-parent-in
,
ubifs-ri-cons
,
ubifs-ro-subset
,
Used by units in proved state:
gjournal-asm
,
gjournal-abs
,
Proof exists?: No